CATEGORICAL MODEL CONSTRUCTION FOR PROVING SYNTACTIC PROPERTIES

DOI10.1142/S012905410100045XzbMath1321.68159OpenAlexW2057820817MaRDI QIDQ5249254

Takafumi Sakurai

Publication date: 30 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410100045x

zbMATH Keywords

categorystrong normalizabilitysecond-order \(\lambda\)-calculussemi-adjointnessnon-extensional modelsyntactic property

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Cites Work

• The semantics of second-order lambda calculus
• Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
• Comprehension categories and the semantics of type dependency
• Categorical semantics for higher order polymorphic lambda calculus
• Semantics of the second order lambda calculus
• Normalization and the Yoneda embedding

This page was built for publication: CATEGORICAL MODEL CONSTRUCTION FOR PROVING SYNTACTIC PROPERTIES