**Abstract** |

The aim of this paper is to discuss the design of an explicitly typed lambda-calculus corresponding to the Intersection Type Assignment System (IT), which assigns intersection types to the untyped lambda-calculus. Two different proposals are given. The logical foundation of all of them is the Intersection Logic IL. |

```
@inproceedings{Ronchi:ITRS-2002,
volume = {70(1)},
author = {Ronchi Della Rocca, Simona},
series = {Electronic Notes in Computer Science},
booktitle = {L{TRS} 2002},
url = {http://www.di.unito.it/~ronchi/papers/ronchi-itrs02.pdf},
tag = {L{TRS} 2002},
title = {Typed {I}ntersection {L}ambda {C}alculus},
abstract = {The aim of this paper is to discuss the design of an explicitly
typed lambda-calculus corresponding to the Intersection Type
Assignment System (IT), which assigns intersection types to the
untyped lambda-calculus. Two different proposals are given. The
logical foundation of all of them is the Intersection Logic IL.},
publisher = {Elsevier},
pages = {},
year = 2002,
}
```

This document was generated by bib2html 3.3.

(Modified by Luca Paolini, under the GNU General Public License)