On sets of terms having a given intersection type

DOI10.46298/LMCS-18(3:35)2022OpenAlexW4289542596MaRDI QIDQ5043597

Andrew Polonsky, Richard Statman

Publication date: 6 October 2022

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection type assignment systems
• Easy lambda-terms are not always simple
• Axiomatizing the Quote
• A filter lambda model and the completeness of type assignment
• Functional Characters of Solvable Terms
• 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