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.
A Polymorphic Language which is Typable and Poly-step
ROVERSI, Luca
1998-01-01
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Roversi1998ASIAN.pdf
Accesso riservato
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
224.73 kB
Formato
Adobe PDF
|
224.73 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
