Comparing models of the intensional typed \(\lambda\)-calculus

DOI10.1016/0304-3975(95)00140-9zbMath0872.03009OpenAlexW1971835373MaRDI QIDQ671646

R. Hoofman

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00140-9

zbMATH Keywords

typed lambda calculuspowerset models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (1)

Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
• The system \({\mathcal F}\) of variable types, fifteen years later
• Continuous information systems
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Lambda‐Calculus Models and Extensionality
• The theory of semi-functors

This page was built for publication: Comparing models of the intensional typed \(\lambda\)-calculus