Comparing models of the intensional typed -calculus

DOI10.1016/0304-3975(95)00140-9MaRDI QIDQ671646zbMATHOpenAlexFDO

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

zbMATH Keywords

typed lambda calculuspowerset models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Publication:4501148
• Publication:3827990
• A semantic characterization of the well-typed formulae of \(\lambda\)- calculus
• The Intensional Lambda Calculus
• Publication:4783324

Cites work

• scientific article; zbMATH DE number 1678365 (Why is no real title available?)
• scientific article; zbMATH DE number 1499094 (Why is no real title available?)
• Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
• Continuous information systems
• Lambda‐Calculus Models and Extensionality
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The system \({\mathcal F}\) of variable types, fifteen years later
• The theory of semi-functors

Cited in

(7)

• A semantic characterization of the well-typed formulae of \(\lambda\)- calculus
• HTLC: hyperintensional typed lambda calculus
• scientific article; zbMATH DE number 800564 (Why is no real title available?)
• scientific article; zbMATH DE number 4014020 (Why is no real title available?)
• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• scientific article; zbMATH DE number 1497732 (Why is no real title available?)
• \(M\)-set models

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)