From proofs to focused proofs: A modular proof of focalization in linear logic

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

Volumn 4646 LNCS, Issue , 2007, Pages 405-419

  Miller, Dale ^a   Saurin, Alexis ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; GRAPH THEORY; LINEAR PROGRAMMING; SEMANTICS; THEOREM PROVING;

FOCALIZATION GRAPHS; LINEAR LOGIC; MODULAR STRUCTURE; PROOF TRANSFORMATION;

LOGIC PROGRAMMING;

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

References (20)

1. Abramsky, S., Melliès, P-A.: Concurrent games and full completeness. In: LICS 1999, pp. 431-442. IEEE Computer Society Press, Los Alamitos (1999)
2. Andreoli, J.-M., Pareschi, R.: Linear objects: Logical processes with built-in inheritance. In: Proceeding of ICLP 1990, Jerusalem (1990)
3. Andreoli, J.-M.: Proposal for a Synthesis of Logic and Object-Oriented Programming Paradigms. PhD thesis, University of Paris VI (1990)
4. Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. of Logic and Computation 2(3), 297-347 (1992)
5. Baelde, D., Miller, D.: Least and greatest fixed points in LL (Submitted April 2007)
6. Curien, P.-L., Herbelin, H.: The duality of computation. In: ICFP '00. Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, New York, NY, USA, pp. 233-243. ACM Press, New York (2000)
7. Danos, V., Joinet, J.-B., Schellinx, H.: The structure of exponentials: Uncovering the dynamics of linear logic proofs. In: Mundici, D., Gottlob, G., Leitsch, A. (eds.) KGC 1993. LNCS, vol. 713, pp. 159-171. Springer, Heidelberg (1993)
8. Danos, V., Joinet, J.-B., Schellinx, H.: LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of classical implication. In: Girard, Lafont, Regnier (eds.) Workshop on Linear Logic. London Mathematical Society Lecture Notes 222, pp. 211-224. Cambridge University Press, Cambridge (1995)
9. Danos, V., Joinet, J.-B., Schellinx, H.: A new deconstructive logic: Linear logic. Journal of Symbolic Logic 62(3), 755-807 (1997)
10. Dyckhoff, R., Lengrand, S.: LJQ: a strongly focused calculus for intuitionistic logic. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 173-185. Springer, Heidelberg (2006)
11. Girard, J.-Y.: Linear logic. Theoretical Computer Science 50, 1-102 (1987)
12. Girard, J.-Y.: Light linear logic. Information and Computation 143 (1998)
13. Girard, J.-Y.: Locus solum. MSCS 11(3), 301-506 (2001)
14. Herbelin, H.: Séquents qu'on calcule: de l'interprétation du calcul des séquents comme calcul de lambda-termes et comme calcul de stratégies gagnantes. PhD thesis, Université Paris 7 (1995)
15. Jagadeesan, R., Nadathur, G., Saraswat, V.: Testing concurrent systems: An interpretation of intuitionistic logic. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, Springer, Heidelberg (2005)
16. Lafont, Y.: Soft linear logic and polynomial time. TCS 318(1-2), 163-180 (2004)
17. Laurent, O.: Etude de la polarisation en logique. Thèse de doctorat, Université AixMarseille II (March 2002)
18. Laurent, O.: A proof of the focalization property of LL. Unpublished Note (May 2004)
19. Liang, C., Miller, D.: Focusing and polarization in intuitionistic logic. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 451-465. Springer, Heidelberg (2007)
20. Miller, D.: Forum: A multiple-conclusion specification logic. Theoretical Computer Science 165(1), 201-232 (1996)