A functional language ΛLA is given. A sub-set ΛTLA of ΛLA is automatically typable. The types are formulas of Intuitionistic Light Affine Logic with polymorphism à la ML. Every term of ΛTLA can reduce to its normal form in, at most, poly-steps. ΛTLA can be used as a prototype of programming language for P-TIME algorithms.
CITATION STYLE
Roversi, L. (1998). A polymorphic language which is typable and poly-step. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1538, pp. 43–60). Springer Verlag. https://doi.org/10.1007/3-540-49366-2_4
Mendeley helps you to discover research relevant for your work.