**Abstract** |

A functional language LambdaLAL is given. A sub-set LambdaLAL typ of LambdaLAL is automatically typable. The types are formulas of Intuitionistic Light Affine Logic with polymorphism a la ML. Every term of LambdaLALtyp can reduce to its normal form in, at most, poly-steps. LambdaLALtyp can be used as a prototype of programming language for P-TIME algorithms. |

```
@inproceedings{Roversi:1998-ASIAN,
volume = {1538},
month = {December},
author = {Roversi, Luca},
series = {Lecture Notes in Computer Science},
booktitle = {Proceedings of the Asian Computing Science Conference
(ASIAN'98)},
url = {http://www.di.unito.it/~rover/RESEARCH/PUBLICATIONS/1998-ASIAN/Roversi1998ASIAN.ps.gz},
address = {Manila (The Philippines)},
title = {A {P}olymorphic {L}anguage which is {T}ypable and {P}oly-step},
abstract = {A functional language LambdaLAL is given. A sub-set LambdaLAL typ
of LambdaLAL is automatically typable. The types are formulas of
Intuitionistic Light Affine Logic with polymorphism a la ML. Every
term of LambdaLALtyp can reduce to its normal form in, at most,
poly-steps. LambdaLALtyp can be used as a prototype of programming
language for P-TIME algorithms.},
copyrightspringer = {http://www.springer.de/comp/lncs/index.html},
publisher = {Springer Verlag},
year = {1998},
pages = {43 -- 60},
}
```

This document was generated by bib2html 3.3.

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