**Abstract** |

A functional language LambdaLAL, endowed with automatic type inference, is given. The types for LambdaLAL are formulas of Light Affine Logic with polymorphism a la ML. The language LambdaLAL is a notation to write P-TIME programs. |

```
@inproceedings{Roversi:1998-ICTCS,
month = {November},
author = {Roversi, Luca},
booktitle = {Sixth Italian Conference on Theoretical Computer Science
(ICTCS'98)},
url = {http://www.di.unito.it/~rover/RESEARCH/PUBLICATIONS/1998-ICTCS/Roversi1998ICTCS.ps.gz},
abstract = {A functional language LambdaLAL, endowed with automatic type
inference, is given. The types for LambdaLAL are formulas of Light
Affine Logic with polymorphism a la ML. The language LambdaLAL is
a notation to write P-TIME programs.},
title = {{C}oncrete {S}yntax for {I}ntuitionistic {L}ight {A}ffine {L}ogic
with {P}olymorphic {T}ype {A}ssignment},
address = {Prato (Italy)},
publisher = {World Scientific},
year = {1998},
pages = {24 -- 36},
}
```

This document was generated by bib2html 3.3.

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