Least fixpoints of endofunctors of cartesian closed categories

DOI10.1017/S0960129500000190zbMath0788.18006OpenAlexW2041920040MaRDI QIDQ4279245

Joachim Lambek

Publication date: 2 June 1994

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129500000190

zbMATH Keywords

least fixed pointsecond order polymorphic lambda calculusweak polynomial product

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theories (e.g., algebraic theories), structure, and semantics (18C10) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Intuitionistic mathematics (03F55) Combinatory logic and lambda calculus (03B40)

Related Items

Categorical fixed point calculus ⋮ Relations in operational categories ⋮ An equational variant of Lawvere's natural numbers object ⋮ An exactification of the monoid of primitive recursive functions

Cites Work

• Unnamed Item
• A note on inconsistencies caused by fixpoints in a cartesian closed category
• Functorial polymorphism
• Manufacturing a Cartesian closed category with exactly two objects out of a C-monoid
• On some connections between logic and category theory
• The system \({\mathcal F}\) of variable types, fifteen years later
• A small complete category
• A fixpoint theorem for complete categories
• A lattice-theoretical fixpoint theorem and its applications
• Categorical semantics for higher order polymorphic lambda calculus
• The Category-Theoretic Solution of Recursive Domain Equations
• Adjointness in Foundations
• Functional completeness of cartesian categories
• Machines in a Category: An Expository Introduction
• Subequalizers