Light affine logic as a programming language: A first contribution

International Journal of Foundations of Computer Science

Volumn 11, Issue 1, 2000, Pages 113-152

  Roversi, Luca ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

Automatic type inference; Functional programming languages; Light Affine Logic; P TIME computations

Indexed keywords

EID: 0004096610     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054100000077     Document Type: Conference Paper

References (18)

1. A. Asperti. Light Affine Logic. In Proceedings of Symposium on Logic in Computer Science LICS'98, 1998.
2. L. Damas and R. Milner. Principal type-schemes for functional programs. In Proceedings of 9th ACM Symposium on Principles of Programming Languages POPL'82, January 1982.
3. R. Di Cosmo and D. Kesner. Strong normalization of explicit substitutions via cut elimination in proof nets (extended abstract). In Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science LICS'98, pages 35-46, June-July 1997.
4. J.-Y. Girard. Light Linear Logic. Information and Computation, 143:175-204, 1998.
5. J.-Y. Girard, Y. Lafont, and L. Regnier. Advances in Linear Logic, volume 222 of London Mathematical Society Lecture Note Series. Cambridge University Press, 1995.
6. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
7. C. A. Gunter. Semantics of Programming Languages: Structures and Techniques. Foundations of Computing. The MIT Press, 1992.
8. M. Hoffmann. A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion. In Proceedings of Computer Science Logic 1997 (CSL'97), Aarhus, Denmark, volume To appear, 1997.
9. W. A. Howard. To H. B. Curry: Essay on Combinatory Logic, Lambda Calculus and Formalisms, chapter The formulae-as-type notion of construction, pages 479-490. J. R. Hindley and J. P. Seldin editors, Academic press, 1980.
10. Oukseh Lee and Kwangkeun Yi. Proofs about a folklore let-polymorphic type inference algorithm. Transactions on Programming Languages and Systems, 20(4) :707-723, 1998.
11. D. Leivant and J.-Y. Marion. Lambda calculus characterizations of poly-time. Fundamenta Informaticae, 19:167-184, 1993.
12. R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. The MIT Press, 1990.
13. J. C. Mitchell. Polymorphic type inference and containment. Information and Computation, 76:211-249, 1988.
14. G. Plotkin. Call-by-name, call-by-value and the A-calculus. Theoretical Computer Science, 1:125-159, 1975.
15. S. Ronchi della Rocca and L. Roversi. Lambda calculus and intuitionistic linear logic. Studia Logica, 57:417-448, 1997.
16. L. Roversi. Concrete syntax for intuitionistic light affine logic with polymorphic type assignment. In Sixth Italian Conference on Theoretical Computer Science, pages 24-36. World Scientific, 9-1 1 November (Prato-Italy) 1998.
17. L. Roversi. A polymorphic language which is typable and poly-step. In Advances in Computing Science-ASIAN}98, volume LNCS 1538, pages 43-60. Springer-Verlag, 8-1 0 December (Manila-The Philippines) 1998.
18. L. Roversi. A P-Time completeness proof for light logics. In Proceedings of Computer Science Logic 1999 (CSL}99) (Madrid-Spain), volume LNCS. Springer-Verlag, 20-25 September 1999.