On polymorphic types of untyped terms

DOI10.1007/978-3-642-20920-8_24MaRDI QIDQ3003364zbMATH OpenOpenAlexFDO

Authors Richard Statman

Publication date 27 May 2011

Published in Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20920-8_24

zbMATH Keywords

Böhm's theoremlambda calculuslambda calculus with surjective pairingpolymorphic typings

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• On polymorphic types of untyped terms
• On the type correctness of polymorphic -terms. II
• On the type correctness of polymorphic -terms. I
• scientific article; zbMATH DE number 177803
• Typing untyped \(\lambda\)-terms, or reducibility strikes again!

Cited in

(9)

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

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 Q3003364)