Intuitionistic Light Affine Logic

ACM Transactions on Computational Logic

Volumn 3, Issue 1, 2002, Pages 137-175

  Asperti, Andrea ^a   Roversi, Luca ^b  

^a Dipartmento di Scienze dell Informazione   (Italy)

^b Dipartimento di Informatica   (Italy)

Author keywords

Languages; Theory

Indexed keywords

EID: 85007617019     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/504077.504081     Document Type: Article

References (13)

1. Asperti, A. 1998. Light affine logic. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'98). IEEE Computer Society Press, Los Alamitos, Calif
2. Asperti, A., and Guerrini, S. 1998. The Optimal Implementation of Functional Programming Languages.
3. Danos, V., and Joinet, J.-B. 1999. Linear logic & elementary time. In Proceedings of the 1st International workshop on Implicit Computational Complexity (ICC'99) (Santa Barbara, Calif.)
4. Girard, J.-Y. 1995. Proof nets: The parallel syntax for proof-theory. In Logic and Algebra. New York
5. Girard, J.-Y. 1998. Light linear logic. Inf. Comput. 143, 175-204
6. Girard, J.-Y., Lafont, Y., and Taylor, P. 1989. Proofs and Types. Cambridge University Press, Cambridge, England
7. Girard, J.-Y., Scedrov, A., and Scott, P. J. 1998. Light linear logic. Inf. Comput. 143, 175-204. LEIVANT, D. 1994. A foundational delineation of poly-time. Inf. Comput. 110,391-420
8. Leivant, D., and Marion, J.-Y. 1993. Lambda calculus characterizations of poly-time. Funda. Inf. 19, 167-184
9. Mitchell, J. 1988. Polymorphic type inference and containment. Inf. Comput. 76, 211-249
10. Roversi, L. 1998. A polymorphic language which is typable and poly-step. In Proceedings of the Asian Computing Science Conference (ASIAN'98) (Manila, The Philippines). Lecture Notes in Computer Science, vol. 1538, Springer Verlag, New York, pp. 43-60
11. Roversi, L. 1999. A P-Time Completeness proof for light logics. In Proceedings of the 9th Annual Conference of the EACSL (CSL'99) (Madrid, Spain), Lecture Notes in Computer Science, vol. 1683. Springer-Verlag, New York, pp. 469-483
12. Roversi, L. 2000. Light affine logic as a programming language: a first contribution. Inte. J. Found. Comput. Sci. 11, 1 (Mar.), 113-152
13. Tortora, L. 2000a. Additives of linear logic and normalization-Part I: A (restricted) Church-Rosser property. Theor. Comput. Sci., to appear.