@article{Alessi2006108,
    Abstract = {Invariance of interpretation by {$\beta$} -conversion is one of the minimal requirements for any standard model for the {$\lambda$} -calculus. With the intersection-type systems being a general framework for the study of semantic domains for the {$\lambda$} -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 {$\beta$} , η , but also for a number of relevant restrictions of those. Characterisations will be also provided for (intersection) filter structures that are indeed {$\lambda$} -models.},
    Author = {Alessi, Fabio and Barbanera, Franco and Dezani-Ciancaglini, Mariangiola},
    File = {Intersection types and lambda models - Alessi, Barbanera, Dezani-Ciancaglini (0) (0) - a - a - g.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Keywords = {{$\beta$} - and η -reduction/expansion},
    Note = {Logic, Language, Information and Computation 10th Workshop on Logic, Language, Information and Computation 2003},
    Number = {2},
    Pages = {108 - 126},
    Title = {Intersection types and lambda models},
    URL = {http://www.sciencedirect.com/science/article/pii/S0304397506000405},
    Volume = {355},
    Year = {2006},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397506000405},
    bdsk-url-2 = {http://dx.doi.org/10.1016/j.tcs.2006.01.004},
    date-added = {2014-09-08 07:44:55 +0000},
    date-modified = {2014-09-08 07:44:55 +0000},
    doi = {10.1016/j.tcs.2006.01.004}
}

@article{Alessi2006108, Abstract = {Invariance of interpretation by {$\beta$} -conversion is one of the minimal requirements for any standard model for the {$\lambda$} -calculus. With the intersection-type systems being a general framework for the study of semantic domains for the {$\lambda$} -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 {$\beta$} , η , but also for a number of relevant restrictions of those. Characterisations will be also provided for (intersection) filter structures that are indeed {$\lambda$} -models.}, Author = {Alessi, Fabio and Barbanera, Franco and Dezani-Ciancaglini, Mariangiola}, File = {Intersection types and lambda models - Alessi, Barbanera, Dezani-Ciancaglini (0) (0) - a - a - g.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Keywords = {{$\beta$} - and η -reduction/expansion}, Note = {Logic, Language, Information and Computation 10th Workshop on Logic, Language, Information and Computation 2003}, Number = {2}, Pages = {108 - 126}, Title = {Intersection types and lambda models}, URL = {http://www.sciencedirect.com/science/article/pii/S0304397506000405}, Volume = {355}, Year = {2006}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397506000405}, bdsk-url-2 = {http://dx.doi.org/10.1016/j.tcs.2006.01.004}, date-added = {2014-09-08 07:44:55 +0000}, date-modified = {2014-09-08 07:44:55 +0000}, doi = {10.1016/j.tcs.2006.01.004} }