How to think of intersection types as Cartesian products

DOI10.1016/j.entcs.2016.09.045zbMath1394.03029OpenAlexW2527771724WikidataQ113317627 ScholiaQ113317627MaRDI QIDQ1744395

Richard Statman

Publication date: 23 April 2018

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.09.045

zbMATH Keywords

semigroupsrepresentationlambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• A new type assignment for λ-terms
• A filter lambda model and the completeness of type assignment
• Intersection types and λ-definability
• Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative
• Unnamed Item
• Unnamed Item

This page was built for publication: How to think of intersection types as Cartesian products