A Feasible Algorithm for Typing in Elementary Affine Logic

We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant where sharing is restricted to variables and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time in the size of the derivation.

[1]  Patrick Baillot.  Type inference for light affine logic via constraints on words , 2004, Theor. Comput. Sci..

[2]  Andre Scedrov,et al.  Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability , 1992, Theor. Comput. Sci..

[3]  Luca Roversi.  A Polymorphic Language Which Is Typable and Poly-step , 1998, ASIAN.

[4]  Paolo Coppola,et al.  Principal Typing in Elementary Affine Logic , 2003, TLCA.

[5]  Andrea Asperti,et al.  Intuitionistic Light Affine Logic , 2002, TOCL.

[6]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[7]  Kazushige Terui,et al.  Light types for polynomial time computation in lambda-calculus , 2004, LICS 2004.

[8]  Kazushige Terui,et al.  Light types for polynomial time computation in lambda-calculus , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[9]  Paolo Coppola,et al.  Typing Lambda Terms in Elementary Logic with Linear Constraints , 2001, TLCA.

[10]  Jean-Yves Girard,et al.  Light Linear Logic , 1998, Inf. Comput..

[11]  Yves Lafont,et al.  Soft linear logic and polynomial time , 2004, Theor. Comput. Sci..

[12]  Kazushige Terui,et al.  Light affine lambda calculus and polytime strong normalization , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[13]  Paolo Coppola,et al.  (Optimal) duplication is not elementary recursive , 2000, POPL '00.

[14]  Vincent Danos,et al.  Linear logic and elementary time , 2003, Inf. Comput..

[15]  Vincent Danos,et al.  Linear Logic & Elementary Time , 1999 .

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

[17]  Daniel de Carvalho.  Intersection Types for Light Affine Lambda Calculus , 2005, Electron. Notes Theor. Comput. Sci..

[18]  Paolo Coppola,et al.  Optimizing optimal reduction: A type inference algorithm for elementary affine logic , 2006, TOCL.

[19]  Patrick Baillot.  Checking Polynomial Time Complexity with Types , 2002, IFIP TCS.

[20]  Vincent Danos,et al.  On the linear decoration of intuitionistic derivations , 1995, Arch. Math. Log..