On polymorphic types of untyped terms

DOI10.1016/J.JCSS.2014.04.008MaRDI QIDQ2453585zbMATH OpenOpenAlexFDO

Authors Richard Statman

Publication date 10 June 2014

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2014.04.008

zbMATH Keywords

lambda calculuslambda calculus with surjective pairingpolymorphic typingsBöhm's theorem

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• On polymorphic types of untyped terms
• On the type correctness of polymorphic \(\lambda\)-terms. II
• scientific article; zbMATH DE number 6496907
• scientific article; zbMATH DE number 445160
• On the type correctness of polymorphic \(\lambda\)-terms. I
• Set-theoretic types for polymorphic variants
• Intensional polymorphism in type-erasure semantics
• Intensional polymorphism in type-erasure semantics
• Intensional polymorphism in type-erasure semantics
• Polymorphism and separation in Hoare type theory

Cites work

• scientific article; zbMATH DE number 4179332 (Why is no real title available?)
• scientific article; zbMATH DE number 3556025 (Why is no real title available?)
• Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative

Cited in

(6)

• scientific article; zbMATH DE number 177803 (Why is no real title available?)
• Two beta-equal lambda-I-terms with no types in common
• On the type correctness of polymorphic \(\lambda\)-terms. II
• Type inhabitation of atomic polymorphism is undecidable
• Mathematics of Program Construction
• On polymorphic types of untyped terms

This page was built for publication: On polymorphic types of untyped terms

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