A new deconstructive logic: Linear logic

Journal of Symbolic Logic

Volumn 62, Issue 3, 1997, Pages 755-807

  Danos, Vincent ^a   Joinet, Jean Baptiste ^b,c   Schellinx, Harold ^b,d  

^a CNRS   (France)

^b INSTITUT DE MATHÉMATIQUES DE JUSSIEU   (France)

^c UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^d UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031527233     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275572     Document Type: Article

References (45)

1. F. BARBANERA and S. BERARDI, A symmetric lambda calculus for 'classical' program extraction, Information and Computation, vol. 125 (1996), no. 2, pp. 103-117.
2. V. DANOS, La logique linéaire appliquée à l'étude de divers processus de normalisation (principalement du lambda-calcul). Thèse de Doctorat, Université de Paris 7, 1990.
3. V. DANOS, J.-B. JOINET, and H. SCHELLINX, The structure of exponentials: uncovering the dynamics of linear logic proofs. Computational logic and proof theory (G. Gottlob, A. Leitsch, and D. Mundici, editors). Lecture Notes in Computer Science, no. 713, Springer-Verlag, 1993, pp. 159-171.
4. _, LKQ and LKT: Sequent calculi for second order logic based upon dual linear decompositions of classical implication, Advances in linear logic (J.-Y. Girard, Y. Lafont, and L. Regnier, editors), Cambridge University Press, 1995, pp. 211-224.
5. _, On the linear decoration of intuitionistic derivations, Archive for Mathematical Logic, vol. 33 (1995), pp. 387-412.
6. A. G. DRAGALIN, Mathematical intuitionism, American Mathematical Society, 1988, Translation of the Russian original from 1979.
7. E. DUQUESNE and J. VAN DE WIELE, Modèle cohérent des réseaux de preuves, Archive for Mathematical Logic, vol. 33 (1994), pp. 131-158.
8. G. GENTZEN, Untersuchungen über das logische Schließen, Mathematische Zeitschrift, vol. 39 (1935), pp. 176-210, 405-431.
9. J.-Y. GIRARD, Linear logic, Theoretical Computer Science, vol. 50 (1987), pp. 1-102.
10. _, A new constructive logic: classical logic, Mathematical Structures in Computer Science, vol. 1 (1991), no. 3, pp. 255-296.
11. _, Quantifiers in linear logic, II, Nuovi problemi della logica e della filosafia della scienza (G. Corsi and G. Sambin, editors), vol. II, 1991, Proceedings of the conference with the same name, Viareggio, 8-13 gennaio 1990, CLUEB, Bologna (Italy).
12. _, On the unity of logic, Annals of Pure and Applied Logic, vol. 59 (1993), pp. 201-217.
13. T. GRIFFIN, A formulae-as-types notion of control, Principles of programming languages, IEEE Computer Society Press, 1990, pp. 47-58.
14. 14, 1992.
15. H. HERBELIN, Séquents qu'on calcule. De l'interprétation du calcul des séquents comme calcul de λtermes et comme calcul de stratégies gagnantes, Thèse de Doctorat, Université de Paris 7, 1995.
16. K. HÖRWEIN, Keeping inconsistencies local, manuscript, Technische Universität Wien, Austria, 1992.
17. W. A. HOWARD, The formulae-as-types notion of construction, To H. B. Curry: Essays on combinatory logic, lambda calculus and formalism (J. P. Seldin and J. R. Hindley, editors), Academic Press, 1980, pp. 479-490.
18. J.-B. JOINET, Etude de la normalisation du calcul des séquents classique à travers la logique linéaire, Thèse de Doctorat, Université de Paris 7, 1993.
19. J.-B. JOINET, H. SCHELLINX, and L. TORTORA DE FALCO, Strong normalization for free deduction and related jormalizations of classical second order logic, manuscript, 199?
20. tq, Theorem proving with analytic tableaux and related methods (Migliolo et al., editors), Lecture Notes in Artificial Intelligence, no. 1071, Springer-Verlag, 1996, pp. 226-243.
21. G. KREISEL, On the interpretation of non-finitist proofs, I, this JOURNAL, vol. 16 (1951), no. 4, pp. 241-267.
22. J. L. KRIVINE, Lambda-calcul, types et modèles, Masson, Paris, 1990.
23. _, Lambda-calculus, types and models, Ellis Horwood, London, 1993.
24. _, Classical logic, storage operators and second order lambda-calculus, Annals of Pure and Applied Logic, vol. 68 (1994), pp. 53-78.
25. _, A general storage theorem for integers in call-by-name λ-calculus, Theoretical Computer Science, vol. 129 (1994), pp. 79-94.
26. J.-L. KRIVINE and M. PARIGOT, Programming with proofs, Journal of Information Processing and Cybernetics EIK, vol. 26 (1990), no. 4, pp. 149-167.
27. D. LEIVANT, Reasoning about functional programs and complexity classes associated to type disciplines, FOCS 83, pp. 460-469, 1983.
28. C. MURTHY, An evaluation semantics for classical proofs, Logic in computer science, IEEE Computer Society Press, 1991, pp. 96-107.
29. _, A computational analysis of Girard's translation and LC, Logic in computer science, IEEE Computer Society Press, 1992, pp. 90-101.
30. K. NOUR, Mixed logic and storage operators, Prépublication de l'Université de Chambéry, 1995.
31. M. PARIGOT, Proofs of strong normalization for second order classical natural deduction, manuscript, to appear in this JOURNAL.
32. _, Free deduction: an analysis of computation in classical logic, Russian conference on logic programming (A. Voronkov, editor). Lecture Notes in Artificial Intelligence, no. 592, Springer-Verlag, 1991, pp. 361-380.
33. _, λμ-calculus: an algorithmic interpretation of classical natural deduction, Logic programming and automated reasoning (A. Voronkov, editor), Lecture Notes in Artificial Intelligence, no. 624, Springer-Verlag, 1992, pp. 190-201.
34. _, Recursive programming with proofs, Theoretical Computer Science, vol. 94 (1992), pp. 335-356.
35. _, Classical proofs as programs, Computational logic and proof theory (G. Gottlob, A. Leitsch, and D. Mundici, editors), Lecture Notes in Computer Science, no. 713, Springer-Verlag, 1993, pp. 263-277.
36. _, Strong normalisation for second order classical natural deduction, Logic in computer science, IEEE Computer Society Press, 1993, pp. 39-46.
37. G. PLOTKIN, Call-by-name, call-by-value and the lambda-calculus, Theoretical Computer Science, vol. 1 (1975), pp. 125-159.
38. D. PRAWITZ, Validity and normalizability of proofs in first and second order classical and intuitionistic logic, Atti del I congresso Italiano di logica, Bibliopolis, Napoli, 1981, pp. 11-36.
39. L. REGNIER, λ-calcule et réseaux, Thèse de Doctorat, Université de Paris 7, 1992.
40. H. SCHELLINX, The noble art of linear decorating, ILLC Dissertation Series 1994-1, Institute for Logic, Language and Computation, University of Amsterdam, 1994.
41. H. SCHWICHTENBERG, Proof theory: some applications of cut-elimination, Handbook of mathematical logic (J. Barwise, editor), North Holland, 1977.
42. T. TAMMET, Proof search strategies in linear logic, Journal of Automated Reasoning, vol. 12 (1994), pp. 273-304.
43. A. S. TROELSTRA, Lectures on linear logic, CSLI Lecture Notes 29, Center for the Study of Language and Information, Stanford, 1992.
44. A. S. TROELSTRA and D. VAN DALEN, Constructivism in mathematics: An introduction, vol. I, North-Holland, 1988.
45. J. VAUZEILLES, Cut elimination for the unified logic, Annals of Pure and Applied Logic, vol. 62 (1993), pp. 1-16.