An algebraic correctness criterion for intuitionistic proof-nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1234, Issue , 1997, Pages 130-140

  de Groote, Philippe ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947928089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (9)

1. V. Danos. Une application de la iogique linéaire à l’étude des processus de normalisation et principalement du lambda calcul. These de doctorat, Uni-versité de Paris VII, 1990.
2. V. Danos and L. Regnier. The structure of multiplicatives. Archive for Mathematical Logic, 28:181-203, 1989.
3. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
4. J.-Y. Girard. Quantifiers in linear logic II. Technical Report 19, Equipe de Logique Mathématique, Université de Paris VII, 1991.
5. F. Lamarche. Proof nets for intuitionistic linear logic 1: Essential nets. Technical report, Imperial College, April 1994.
6. F. Lamarche. Games semantics for full propositional linear logic. In Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE Press, 1995.
7. F. Lamarche and C. Retoré. Proof nets for the lambek calculus. In M. Abrusci, C. Casadio, and G. Sandri, editors, Third Roma Workshop: Proofs and Linguistic Categories, Rapporto di Ricerca del Dipartimento de Filosofia. Università di Bologna, 1996.
8. J. Lambek. The mathematics of sentence structure. Amer. Math. Monthly, 65:154-170, 1958.
9. D. Roorda. Resource Logics: proof-theoretical investigations. PhD thesis, University of Amsterdam, 1991.