Invariance of interpretation by β-conversion is one of the minimal requirements for any standard model for the λ-calculus. With the intersection type systems being a general framework for the study of semantic domains for the λ-calculus, the present paper provides a (syntactic) characterisation of the above mentioned requirement in terms of characterisation results for intersection type assignment systems. Instead of considering conversion as a whole, reduction and expansion will be considered separately. Not only for usual computational rules like β, η, but also for a number of relevant restrictions of those. Characterisations will be also provided for (intersection) filter structures that are indeed λ-models.
|Titolo:||Intersection types and lambda models|
|Data di pubblicazione:||2006|
|Citazione:||Intersection types and lambda models / FABIO ALESSI; BARBANERA F; MARIANGIOLA DEZANI-CIANCAGLINI. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 355(2006), pp. 108-126.|
|Appare nelle tipologie:||1.1 Articolo in rivista|