Comparing models of the intensional typed -calculus

DOI10.1016/0304-3975(95)00140-9zbMATH Open0872.03009OpenAlexW1971835373MaRDI QIDQ671646FDOQ671646

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1499094
• scientific article; zbMATH DE number 4103048
• A semantic characterization of the well-typed formulae of \(\lambda\)- calculus
• The Intensional Lambda Calculus
• scientific article; zbMATH DE number 1841836

zbMATH Keywords

typed lambda calculuspowerset models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

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

Cited In (7)

• HTLC: hyperintensional typed lambda calculus
• \(M\)-set models
• A semantic characterization of the well-typed formulae of \(\lambda\)- calculus
• Title not available (Why is that?)
• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• Title not available (Why is that?)
• Title not available (Why is that?)

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

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