On sets of terms having a given intersection type

DOI10.46298/LMCS-18(3:35)2022MaRDI QIDQ5043597zbMATH OpenOpenAlexFDO

Authors Andrew Polonsky, Richard Statman

Publication date 6 October 2022

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1809.08169

zbMATH Keywords

lambda calculusintersection typesuniqueness typing

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Strong normalization and typability with intersection types
• Intersection and singleton type assignment characterizing finite Böhm-trees
• Complete restrictions of the intersection type discipline
• scientific article; zbMATH DE number 1929308
• The emptiness problem for intersection types

Cites work

• scientific article; zbMATH DE number 5852776 (Why is no real title available?)
• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• scientific article; zbMATH DE number 7030644 (Why is no real title available?)
• scientific article; zbMATH DE number 7204443 (Why is no real title available?)
• A filter lambda model and the completeness of type assignment
• Axiomatizing the quote
• Easy lambda-terms are not always simple
• Functional Characters of Solvable Terms
• Intersection type assignment systems
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: On sets of terms having a given intersection type

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