A Polymorphic Language Which Is Typable and Poly-step

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

[1]  Andrea Asperti.  Light affine logic , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[2]  Gordon D. Plotkin,et al.  Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..

[3]  Carl A. Gunter.  Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

[4]  Martin Hofmann,et al.  A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion , 1997, CSL.

[5]  Robin Milner,et al.  Definition of standard ML , 1990 .

[6]  J. Girard,et al.  Proofs and types , 1989 .

[7]  Daniel Leivant,et al.  Lambda Calculus Characterizations of Poly-Time , 1993, Fundam. Informaticae.

[8]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[9]  Jean-Yves Girard.  Light Linear Logic , 1994, LCC.