Comparing models of the non-extensional typed lambda-calculus

DOI10.1007/3-540-58140-5_17MaRDI QIDQ4501148zbMATH OpenFDO

Authors R. Hoofman

Publication date 3 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58140-5_17

zbMATH Keywords

minimal interpretation of type constructornon-extensional typed lambda calculuspowerset models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Comparing models of the intensional typed -calculus
• scientific article; zbMATH DE number 4051567
• scientific article; zbMATH DE number 4103048
• Categorical models for non-extensional λ-calculi and combinatory logic
• Models of the lambda calculus: an introduction

Cited in

(5)

• A semantic characterization of the well-typed formulae of \(\lambda\)- calculus
• M-set models
• scientific article; zbMATH DE number 1497732 (Why is no real title available?)
• Constructive set theoretic models of typed combinatory logic
• Comparing models of the intensional typed -calculus

This page was built for publication: Comparing models of the non-extensional typed lambda-calculus

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