A Finite Model Property for Intersection Types

Rick Statman
(Carnegie Mellon University)

We show that the relational theory of intersection types known as BCD has the finite model property; that is, BCD is complete for its finite models. Our proof uses rewriting techniques which have as an immediate by-product the polynomial time decidability of the preorder <= (although this also follows from the so called beta soundness of BCD).

In Jakob Rehof: Proceedings Seventh Workshop on Intersection Types and Related Systems (ITRS 2014), Vienna, Austria, 18 July 2014, Electronic Proceedings in Theoretical Computer Science 177, pp. 1–9.
Published: 17th March 2015.

ArXived at: http://dx.doi.org/10.4204/EPTCS.177.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org