论文信息 - Principal Typing in Elementary Affine Logic

Principal Typing in Elementary Affine Logic

Elementary Affine Logic (EAL) is a variant of the Linear Logic characterizing the computational power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assigning to terms of λ-calculus EAL formulas as types. This problem is proved to be decidable, and an algorithm is showed, building, for every λ-term, either a negative answer or a finite set of type schemata, from which all and only its typings can be derived, through suitable operations.

Paolo Coppola | Simona Ronchi Della Rocca | P. Coppola | S. D. Rocca

[1] Simona Ronchi Della Rocca,et al. Principal Type Scheme and Unification for Intersection Type Discipline , 1988, Theor. Comput. Sci..

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

[3] Haskell B. Curry,et al. Combinatory Logic, Volume I , 1959 .

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

[5] Simona Ronchi Della Rocca,et al. Principal Type Schemes for an Extended Type Theory , 1984, Theor. Comput. Sci..

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

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

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

[9] R. Hindley. The Principal Type-Scheme of an Object in Combinatory Logic , 1969 .

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

[11] H.A.J.M. Schellinx,et al. The noble art of linear decorating , 1994 .

[12] John C. Mitchell,et al. A probabilistic poly-time framework for protocol analysis , 1998, CCS '98.

[13] John Lamping,et al. An algorithm for optimal lambda calculus reduction , 1989, POPL '90.

[14] H B Curry,et al. Functionality in Combinatory Logic. , 1934, Proceedings of the National Academy of Sciences of the United States of America.