Least fixpoints of endofunctors of cartesian closed categories

Least fixpoints are constructed for finite coproducts of definable endofunctors of Cartesian closed categories that have weak polynomial products and joint equalizers of arbitrary families of pairs of parallel arrows. Both conditions hold in PER, the category whose objects are partial equivalence relations on N, and whose arrows are partial recursive functions. Weak polynomial products exist in any cartesian closed category with a finite number of objects as well as in any model of second order polymorphic lambda calculus: that is, in the proof theory of any second order positive intuitionistic propositional calculus, but such a category need not have equalizers. However, any finite coproduct of definable endofunctors of a cartesian closed category with weak polynomial products will have a least fixpoint in a larger category with equalizers whose objects are right ideals (or sieves) of modulo certain congruence relations, and whose arrows are induced from .

[1]  M. Arbib,et al.  Machines in a category , 1980 .

[2]  J. Roger Hindley,et al.  To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .

[3]  A. Pitt,et al.  Non trivial power types can't be subtypes of polymorphic types , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[4]  J. Adámek,et al.  Automata and Algebras in Categories , 1990 .

[5]  Eugenio Moggi,et al.  Constructive Natural Deduction and its 'Omega-Set' Interpretation , 1991, Math. Struct. Comput. Sci..

[6]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[7]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[8]  F. W. Lawvere,et al.  Diagonal arguments and cartesian closed categories , 1969 .

[9]  Peter Freyd,et al.  Aspects of topoi , 1972, Bulletin of the Australian Mathematical Society.

[10]  Joachim Lambek.  Fixpoints Revisited , 1989, Logic at Botik.

[11]  P. H. Rodenburg,et al.  Manufacturing a cartesian closed category with exactly two objects out of a C-monoid , 1989, Stud Logica.

[12]  Andrew M. Pitts,et al.  Polymorphism is Set Theoretic, Constructively , 1987, Category Theory and Computer Science.

[13]  Andrea Asperti.  Categorical topics in computer science , 1990 .

[14]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[15]  John C. Reynolds,et al.  Polymorphism is not Set-Theoretic , 1984, Semantics of Data Types.

[16]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[17]  J. Lambek.  Functional completeness of cartesian categories , 1974 .

[18]  Badri Raghavachari Narayanan.  A general framework for models of type polymorphism , 1988 .

[19]  K. Hofmann,et al.  A Compendium of Continuous Lattices , 1980 .

[20]  John C. Reynolds,et al.  On Functors Expressible in the Polymorphic Typed Lambda Calculus , 1993, Inf. Comput..

[21]  S. Feferman.  Polymorphic typed lambda-calculi in a type-free axiomatic framework , 1990 .

[22]  J. Girard,et al.  Proofs and types , 1989 .

[23]  Michael A. Arbib,et al.  Free Dynamic and Algebraic Semantics , 1977, FCT.

[24]  M. Arbib,et al.  MACHINES IN A CATEGORY: AN EXPOSITORY INTRODUCTION* , 1974 .

[25]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[26]  Gérard Huet,et al.  Logical Foundations of Functional Programming , 1990 .

[27]  John W. Gray,et al.  The Integration of Logical and Algebraic Types , 1988, Categorial Methods in Computer Science.

[28]  Axel Poigné,et al.  A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category , 1990, Theor. Comput. Sci..

[29]  F. William Lawvere,et al.  Adjointness in Foundations , 1969 .

[30]  Garrett Birkhoff,et al.  Lattice Theory Revised Edition , 1948 .

[31]  R. A. G. Seely,et al.  Categorical semantics for higher order polymorphic lambda calculus , 1987, Journal of Symbolic Logic.

[32]  Joachim Lambek.  On some connections between logic and category theory , 1989, Stud Logica.

[33]  Andre Scedrov,et al.  Functorial Polymorphism , 1990, Theor. Comput. Sci..

[34]  Gordon D. Plotkin,et al.  The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract) , 1977, FOCS.

[35]  Giuseppe Longo,et al.  Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.

[36]  J. Łoś.  Un théorème sur les superpositions des fonctions définies dans les ensembles arbitraires , 1950 .

[37]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[38]  J. Lambek.  A fixpoint theorem for complete categories , 1968 .

[39]  Martin Hyland.  A small complete category , 1988, Ann. Pure Appl. Log..