Abstract
We propose a notion of the Kripke-style model for intersection logic. Using a game interpretation, we prove soundness and completeness of the proposed semantics. In other words, a formula is provable (a type is inhabited) if and only if it is forced in every model. As a by-product, we obtain another proof of normalization for the Barendregt–Coppo–Dezani intersection type assignment system.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference21 articles.
1. A filter lambda model and the completeness of type assignment
2. The "Relevance" of Intersection and Union Types
3. Melvin Fitting. 1969. Intuitionistic Logic Model Theory and Forcing. North-Holland. Melvin Fitting. 1969. Intuitionistic Logic Model Theory and Forcing. North-Holland.