Intersection and singleton type assignment characterizing finite Böhm-trees

DOI10.1016/S0890-5401(02)92907-XzbMath1012.03023OpenAlexW2044292167MaRDI QIDQ1854555

Toshihiko Kurata

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(02)92907-x

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Complete restrictions of the intersection type discipline
• Singleton, union, and intersection types for program extraction
• A filter lambda model and the completeness of type assignment
• Functional Characters of Solvable Terms
• Data Types as Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intersection and singleton type assignment characterizing finite Böhm-trees