A concurrent logical framework: The propositional fragment

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

Volumn 3085, Issue , 2004, Pages 355-377

  Watkins, Kevin ^a   Cervesato, Iliano ^b   Pfenning, Frank ^a   Walker, David ^c  

^a Carnegie Mellon University   (United States)

^b ITT INDUSTRIES   (United States)

^c Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; PETRI NETS;

CONCURRENT COMPUTATION; INTUITIONISTIC LINEAR LOGIC; LOGICAL FRAMEWORKS; NATURAL REPRESENTATION; TYPE THEORY;

COUPLINGS;

EID: 35048854043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24849-1_23     Document Type: Article

References (40)

1. Robin Adams. A modular hierarchy of logical frameworks. In Proceedings of the International Workshop on Types for Proofs and Programs, Torino, Italy, April 2003. Springer-Verlag LNCS.
2. Jean-Marc Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):197-347, 1992.
3. Andrea Asperti. A logic for concurrency. Technical report, Department of Computer Science, University of Pisa, 1987.
4. Andrea Asperti, Gianluigi Ferrari, and Roberto Gorrieri. Implicative formulae in the 'proofs as computations' analogy. In Proceedings of the seventeenth Symposium on Principles of Programming Languages, San Francisco, pages 59-71. ACM Press, January 1990.
5. Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Department of Computer Science, University of Edinburgh, September 1996.
6. David Basin and Seán Matthews. Logical frameworks. In Dov Gabbay and Franz Guenthner, editors, Handbook of Philosophical Logic. Kluwer Academic Publishers, 2nd edition, 2001.
7. Yves Bekkers and Paul Tarau. Monadic constructs for logic programming. In J. Lloyd, editor, Proceedings of the International Logic Programming Symposium (ILPS'95), pages 51-65, Portland, Oregon, December 1995. MIT Press.
8. G. Bellin and P. J. Scott. On the π-calculus and linear logic. Theoretical Computer Science, 135:11-65, 1994.
9. P. N. Benton and Philip Wadler. Linear logic, monads, and the lambda calculus. In E. Clarke, editor, Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 420-431, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
10. Roberto Bruni and Ugo Montanari. Zero-safe nets: Comparing the collective and individual token approaches. Information and Computation, 156(1-2):46-89, 2000.
11. Iliano Cervesato. Petri nets and linear logic: a case study for logic programming. In M. Alpuente and M. I. Sessa, editors, Proceedings of the 1995 Joint Conference on Declarative Programming - GULP-PRODE'95, pages 313-318, Marina di Vietri, Italy, 1995.
12. Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Università di Torino, February 1996.
13. Iliano Cervesato. Typed MSR: Syntax and examples. In V.I. Gorodetski, V.A. Skormin, and L.J. Popyack, editors, Proceedings of the First International Workshop on Mathematical Methods, Models and Architectures for Computer Network Security - MMM'01, pages 159-177, St. Petersburg, Russia, 21-23 May 2001. Springer-Verlag LNCS 2052.
14. Iliano Cervesato and Frank Pfenning. A linear logical framework. Information & Computation, 179(1):19-75, November 2002.
15. Iliano Cervesato, Frank Pfenning, David Walker, and Kevin Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002.
16. Jawahar Lal Chirimar. Proof Theoretic Approach to Specification Languages. PhD thesis, University of Pennsylvania, May 1995.
17. N.G. de Bruijn. Algorithmic definition of lambda-typed lambda calculus. In G. Huet and G. Plotkin, editors, Logical Environment, pages 131-145. Cambridge University Press, 1993.
18. Amy Felty. Encoding dependent types in an intuitionistic logic. In Gérard Huet and Gordon D. Plotkin, editors, Logical Frameworks, pages 214-251. Cambridge University Press, 1991.
19. Robert H. Halstead. Multilisp: A language for parallel symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501-539, October 1985.
20. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
21. Joshua Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327-365, 1994.
22. A preliminary version appeared in the Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pages 32-42, Amsterdam, The Netherlands, July 1991.
23. Furio Honsell, Marino Miculan, and Ivan Scagnetto. Pi-calculus in (co)inductive type theories. Theoretical Computer Science, 253(2):239-285, 2001.
24. Samin Ishtiaq and David Pym. A relevant analysis of natural deduction. Journal of Logic and Computation, 8(6):809-838, 1998.
25. Naoki Kobayashi and Akinori Yonezawa. ACL - A concurrent linear logic programming paradigm. In D. Miller, editor, Proceedings of the 1993 International Logic Programming Symposium, pages 279-294, Vancouver, Canada, 1993. MIT Press.
26. Zhaohui Luo. PAL+: A lambda-free logical framework. Journal of Functional Programming, 13(2):317-338, 2003.
27. N. Martí-Oliet and J. Meseguer. From Petri nets to linear logic. Mathematical Structures in Computer Science, 1:66-101, 1991. Revised version of paper in LNCS 389.
28. N. Martí-Oliet and J. Meseguer. From Petri nets to linear logic through categories: A survey. Journal on Foundations of Computer Science, 2(4):297-399, December 1991.
29. Dale Miller. The π-calculus as a theory in linear logic: Preliminary results. In E. Lamma and P. Mello, editors, Proceedings of the Workshop on Extensions of Logic Programming, pages 242-265. Springer-Verlag LNCS 660, 1992.
30. Robin Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.
31. Eugenio Moggi. Computational lambda calculus and monads. In Proceedings of the Fourth Symposium on Logic in Computer Science, pages 14-23, Asilomar, California, June 1989. IEEE Computer Society Press.
32. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
33. Frank Pfenning. The practice of logical frameworks. In Hélène Kirchner, editor, Proceedings of the Colloquium on Trees in Algebra and Programming, pages 119-134, Linköping, Sweden, April 1996. Springer-Verlag LNCS 1059. Invited talk.
34. Frank Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84-141, March 2000.
35. Frank Pfenning. Intensionality, extensionality, and proof irrelevance in modal type theory. In J. Halpern, editor, Proceedings of the 16th Annual Symposium on Logic in Computer Science (LICS'01), pages 221-230, Boston, MA, June 2001. IEEE Computer Society Press.
36. Frank Pfenning. Logical frameworks. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, chapter 17, pages 1003-1147. Elsevier Science and MIT Press, 2001.
37. Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
38. Jason Reed. Proof irrelevance and strict definitions in a logical framework. Technical Report CMU-CS-02-153, Computer Science Department, Carnegie Mellon University, 2002.
39. John H. Reppy. Concurrent Programming in ML. Cambridge University Press, 1999.
40. Kevin Watkins, Iliano Cervesato, Frank Pfenning, and David Walker. A concurrent logical framework I: Judgments and properties. Technical Report CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University, 2002.