On polymorphic types of untyped terms

DOI10.1016/J.JCSS.2014.04.008zbMATH Open1311.03031OpenAlexW2032679009MaRDI QIDQ2453585FDOQ2453585

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative

Cited In (6)

• On the type correctness of polymorphic \(\lambda\)-terms. II
• On polymorphic types of untyped terms
• Title not available (Why is that?)
• Type inhabitation of atomic polymorphism is undecidable
• Mathematics of Program Construction
• 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 Q2453585)