Categorical models for non-extensional λ-calculi and combinatory logic

DOI10.1017/S096012950000150XzbMath0795.03099MaRDI QIDQ4279260

Simone Martini

Publication date: 28 February 1994

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

zbMATH Keywords

reflexive objectsPL-categorytyped Combinatory Logictyped non-extensional lambda-calculusweak Cartesian closed category

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Combinatory logic and lambda calculus (03B40)

Related Items

What is a categorical model of the differential and the resource λ-calculi?

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A category-theoretic characterization of functional completeness
• Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
• Algebra of constructions. I. The word problem for partial algebras
• Weak adjoint functors
• Models of the lambda calculus
• On specifications, theories, and models with higher types
• An ideal model for recursive polymorphic types
• Categorical semantics for higher order polymorphic lambda calculus