Least and greatest fixed points in linear logic

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

Volumn 4790 LNAI, Issue , 2007, Pages 92-106

  Baelde, David ^a   Miller, Dale ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; LINEAR PROGRAMMING; PROBLEM SOLVING; THEOREM PROVING;

INTUITIONISTIC LOGIC; LINEAR LOGIC;

LOGIC PROGRAMMING;

EID: 38149040853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75560-9_9     Document Type: Conference Paper

References (27)

1. Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. of Logic and Computation 2(3), 297-347 (1992)
2. Andreoli, J.M., Pareschi, R.: Linear objects: Logical processes with built-in inheritance. New Generation Computing 9(3-4), 445-473 (1991)
3. Apt, K.R., van Emden, M.H.: Contributions to the theory of logic programming. J. of the ACM 29(3), 841-862 (1982)
4. Baelde, D., Gacek, A., Miller, D., Nadathur, G., Tiu, A.: The Bedwyr system for model checking over syntactic expressions. In: Pfenning, F. (ed.) 21th Conference on Automated Deduction. LNCS (LNAI), vol. 4603, pp. 391-397. Springer, Heidelberg (2007)
5. Baelde, D., Miller, D.: Least and greatest fixed points in linear logic: extended version. Technical report, available from the first author's web page (April 2007)
6. 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)
7. Gentzen, G.: Investigations into logical deductions. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam, pp. 68-131 (1969)
8. Girard, J.-Y.: Linear logic. Theoretical Computer Science 50, 1-102 (1987)
9. Girard, J.-Y: A fixpoint theorem in linear logic. An email posting to the mailing list linear@cs.stanford.edu. (February 1992)
10. Girard, J.-Y.: On the unity of logic. Annals of Pure and Applied Logic 59, 201-217 (1993)
11. Girard, J.-Y.: Light linear logic. Information and Computation 143 (1998)
12. Girard, J.-Y.: Locus solum. Mathematical Structures in Computer Science 11(3), 301-506 (2001)
13. Hodas, J., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Information and Computation 110(2), 327-365 (1994)
14. Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science 318(1-2), 163-180 (2004)
15. Liang, C., Miller, D.: Focusing and polarization in intuitionistic logic. In: Duparc, J., Henzinger, TA. (eds.) CSL 2007. LNCS, vol. 4646, pp. 451-465. Springer, Heidelberg (2007)
16. Miller, D.: Forum: A multiple-conclusion specification logic. Theoretical Computer Science 165(1), 201-232 (1996)
17. McDowell, R., Miller, D.: Cut-elimination for a logic with definitions and induction. Theoretical Computer Science 232, 91-119 (2000)
18. Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51, 125-157 (1991)
19. Miller, D., Saurin, A.: A game semantics for proof search: Preliminary results. In: Proceedings of the Mathematical Foundations of Programming Semantics (MFPS) (2005)
20. Miller, D., Saurin, A.: From proofs to focused proofs: a modular proof of focalization in linear logic. In: Duparc, J., Henzinger, TA. (eds.) CSL 2007. LNCS, vol. 4646, pp. 405-419. Springer, Heidelberg (2007)
21. Momigliano, A., Tiu, A.: Induction and co-induction in sequent calculus. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 293-308. Springer, Heidelberg (2004)
22. Pimentel, E., Miller, D.: On the specification of sequent systems. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 352-366. Springer, Heidelberg (2005)
23. Schroeder-Heister, P.: Rules of definitional reflection. In: Vardi, M. (ed.) Eighth Annual Symposium on Logic in Computer Science, pp. 222-232. IEEE Computer Society Press, Los Alamitos (1993)
24. Stirling, C.: Games for bisimulation and model checking. Notes for Mathfit Workshop on Finite Model Theory, University of Wales, Swansea (July 1996)
25. Tiu, A.: A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University (May 2004)
26. Tiu, A.: Model checking for π-calculus using proof search. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 36-50. Springer, Heidelberg (2005)
27. Tiu, A., Nadathur, G., Miller, D.: Mixing finite success and finite failure in an automated prover. In: Proceedings of ESHOL 2005: Empirically Successful Automated Reasoning in Higher-Order Logics, pp. 79-98 (December 2005)