Satisfying subtype inequalities in polynomial space

DOI10.1016/S0304-3975(00)00314-5zbMath0996.68033OpenAlexW2074295441MaRDI QIDQ1605226

Alexandre Frey

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00314-5

zbMATH Keywords

\(\lambda\)-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Uses Software

• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamental properties of infinite trees
• A theory of type polymorphism in programming
• Some complexity bounds for subtype inequalities
• Efficient recursive subtyping
• Subtyping constrained types