Formal Methods in Computing(Most of the papers antecedent to 1995are not included in the list) FRAMES  NO FRAME

 alesbarbdeza06 (Article) Author(s) Fabio Alessi, Franco Barbanera and Mariangiola Dezani-Ciancaglini Title « Intersection Types and Lambda Models » Journal Theoretical Compututer Science Volume 355 Number 2 Page(s) 108--126 Year 2006 PDF http://www.di.unito.it/˜dezani/papers/abdtcs.pdf
 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$, $\eta$, but also for a number of relevant restrictions of those. Characterisations will be also provided for (intersection) filter structures that are indeed $\lambda$-models.

 BibTeX code

@article{alesbarbdeza06,
volume = {355},
number = {2},
pdf = {http://www.di.unito.it/~dezani/papers/abdtcs.pdf},
author = {Alessi, Fabio and Barbanera, Franco and Dezani-Ciancaglini,
Mariangiola},
title = {Intersection Types and Lambda Models},
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$, $\eta$, but also for a number of
relevant restrictions of those. Characterisations will be also
provided for (intersection) filter structures that are indeed
$\lambda$-models.},
year = 2006,
journal = {Theoretical Compututer Science},
pages = {108--126},
}

 Formal Methods in Computing(Most of the papers antecedent to 1995are not included in the list) FRAMES  NO FRAME

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)