On sets of terms having a given intersection type

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

Authors: 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

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

zbMATH Keywords

lambda calculusintersection typesuniqueness typing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Easy lambda-terms are not always simple
• A filter lambda model and the completeness of type assignment
• Intersection type assignment systems
• Functional Characters of Solvable Terms
• Title not available (Why is that?)
• Axiomatizing the quote
• Title not available (Why is that?)
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Title not available (Why is that?)

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)