Light Linear Logic

Information and Computation

Volumn 143, Issue 2, 1998, Pages 175-204

  Girard, Jean Yves ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000130547     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2700     Document Type: Article

References (11)

1. Asperti, A. (1997), Special light linear logic, manuscript. [http://hypatia.dcs.qmw.ac.uk/authors/A/ AspertiA/SLLL.ps.gz]
2. Girard, J.-Y. (1987), Linear logic, Theoretical Computer Science 50, 1-102.
3. Girard, J.-Y. (1996), Proof-nets: The parallel syntax for proof-theory, in "Logic and Algebra" (Ursini and Agliano, Eds.), Dekker, New York.
4. Girard, J.-Y., Scedrov, A., and Scott, P. J. (1992), Bounded linear logic: A modular approach to polynomial time computability, Theoret. Comput. Sci. 97, 1-66.
5. Grishin, V. N. (1982), Predicate and set-theoretic calculi based on logics without contractions, Math. USSR Izv. 18, 41-59.
6. Hillebrand, G. G., Kanellakis, P. C., and Mairson, H. G. (1993), Database query languages embedded in the typed lambda calculus, in "Proc. 8th Annual IEEE Symposium on Logic in Computer Science, Montreal," pp. 332-343.
7. Kanovich, M., and Lafont, Y. (1997), On elementary linear logic, in preparation.
8. Kanovich, M., Okada, M., and Scedrov, A. (1997), Phase semantics for light linear logic, in "Electronic Notes in Computer Science, Proceedings of the Thirteenth Conference on the Mathematical Foundations of Programming Semantics, Pittsburgh, Pennsylvania." [http:// www.elsevier.nl/mcs/tcs/pc/Menu.html]
9. Lafont, Y. (1995), From proof-nets to interaction nets, in "Advances in Linear Logic" (Girard, Lafont, and Regnier, Eds.), Cambridge Univ. Press, Cambridge, UK.
10. Leivant, D. (1994), A foundational delineation of poly-time, Inform. and Comput. 110, 391-420. [Special issue of selected papers from LICS'91, edited by G. Kahn]
11. Leivant, D., and Marion, J. Y. (1993), Lambda calculus characterizations of poly-time, Fund. Inform. 19, 167-184. [Special Issue: Lambda Calculus and Type Theory, edited by J. Tiuryn]