Intersection Types and Lambda Theories
| dc.creator | Dezani-Ciancaglini, M. | |
| dc.creator | Lusin, S. | |
| dc.date | 2002-11-12 | |
| dc.date.accessioned | 2026-07-07T03:18:59Z | |
| dc.date.available | 2026-07-07T03:18:59Z | |
| dc.description | We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation of an arbitrary simple easy term is any filter which can be described in an uniform way by a predicate. This allows us to prove the consistency of a well-know lambda theory: this consistency has interesting consequences on the algebraic structure of the lattice of lambda theories. | |
| dc.identifier | https://arxiv.org/abs/cs/0211011 | |
| dc.identifier | http://arxiv.org/abs/cs/0211011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31339 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.3.2 | |
| dc.title | Intersection Types and Lambda Theories | |
| dc.type | text |