CATEGORICAL MODEL CONSTRUCTION FOR PROVING SYNTACTIC PROPERTIES

DOI10.1142/S012905410100045XMaRDI QIDQ5249254zbMATH OpenOpenAlexFDO

Authors 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

categorynon-extensional modelsecond-order \(\lambda\)-calculussemi-adjointnessstrong normalizabilitysyntactic property

Mathematics Subject Classification ID

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

Recommendations

• A Concrete Categorical Model for the Lambek Syntactic Calculus
• Proof-oriented categorical semantics
• Basic category theory for models of syntax.
• Categorical models of logical systems in the mathematical theory of programming
• Syntactic approach to constructions of generic models
• Categorical models for a semantically linear \(\lambda\)-calculus
• scientific article; zbMATH DE number 1231534
• scientific article; zbMATH DE number 3957067
• Grammar specification in categorial logics and theorem proving
• scientific article; zbMATH DE number 4120168

Cites work

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

Cited in

(1)

• Syntactic approach to constructions of generic models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249254)