**Abstract** |

We introduce and study a functional language LV, having two main features. LV has the same computational power of the lambda calculus. LV enjoys the resource-awareness of the typed/typable functional languages which encode the Intuitionistic Linear Logic. |

```
@inproceedings{Roversi:1996-CSL,
volume = {1258},
month = {September},
author = {Roversi, Luca},
series = {Lecture Notes in Computer Science},
booktitle = {Fifth Annual Conference of the EACSL (CSL'96)},
url = {http://www.di.unito.it/~rover/RESEARCH/PUBLICATIONS/1996-CSL/Roversi1996CSL.ps.gz},
address = {Utrecht (The Nederland)},
title = {a {T}ype-{F}ree {R}esource-{A}ware $\lambda$-{C}alculus},
abstract = {We introduce and study a functional language LV, having two main
features. LV has the same computational power of the lambda
calculus. LV enjoys the resource-awareness of the typed/typable
functional languages which encode the Intuitionistic Linear
Logic.},
copyrightspringer = {http://www.springer.de/comp/lncs/index.html},
publisher = {Springer-Verlag},
year = {1996},
pages = {399 -- 413},
}
```

This document was generated by bib2html 3.3.

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