An algebraic correctness criterion for intuitionistic multiplicative proof-nets

Theoretical Computer Science

Volumn 224, Issue 1-2, 1999, Pages 115-134

  De Groote, Philippe ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347032721     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00309-0     Document Type: Article

References (10)

1. V. Danos, Une application de la logique linéaire àl'étude des processus de normalisation et principalement du lambda calcul, Thèse de doctorat, Université de Paris VII, 1990.
2. V. Danos, L. Regnier, The structure of multiplicatives, Arch. Math. Logic 28 (1989) 181-203.
3. Ph. de Groote, Strong normalization in a non-deterministic typed lambda-calculus, Proc. 4th Internat. Symp. on Logical Foundations of Computer Science-Yaroslavl'97, Lecture Notes in Computer Science, vol. 1234, Springer, Berlin, 1997, pp. 130-140.
4. J.-Y. Girard, Linear logic, Theoret. Comput. Sci. 50 (1987) 1-102.
5. J.-Y. Girard, Quantifiers in linear logic II, Technical Report 19, Equipe de Logique Mathématique, Université de Paris VII, 1991.
6. F. Lamarche, Proof nets for intuitionistic linear logic 1: Essential nets, Technical Report, Imperial College, April 1994.
7. F. Lamarche, Games semantics for full prepositional linear logic, 9th Annual IEEE Symp. on Logic in Computer Science, IEEE Press, New York, 1995.
8. F. Lamarche, C. Retoré, Proof nets for the lambek calculus, in: M. Abrusci, C. Casadio, G. Sandri (Eds.), 3rd Roma Workshop: Proofs and Linguistic Categories, Rapporto di Ricerca del Dipartimento de Filosofia, Università di Bologna, 1996.
9. J. Lambek, The mathematics of sentence structure, Amer. Math. Mon. 65 (1958) 154-170.
10. D. Roorda, Resource Logics: proof-theoretical investigations, Ph.D. Thesis, University of Amsterdam, 1991.