Distributed control flow with classical modal logic

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 51-69

  Murphy VII, Tom ^a   Crary, Karl ^a   Harper, Robert ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; DISTRIBUTED COMPUTER SYSTEMS; FLOW CONTROL; RELIABILITY; RESOURCE ALLOCATION; THEOREM PROVING;

CLASSICAL THEOREMS; FOUNDATIONAL CALCULUS; HIGHER-LEVEL CONSTRUCTS; PORTABLE CODE;

FORMAL LOGIC;

EID: 26944461162     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_6     Document Type: Conference Paper

References (15)

1. Andreas Abel. A third-order representation of the λμ-Calculus. In S.J. Ambler, R.L. Croie, and A. Momigliano, editors, Electronic Notes in Theoretical Computer Science, volume 58. Elsevier, 2001.
2. Jean-Yves Girard. Towards a geometry of interaction. Contemporary Mathematics, 92:69-108.
3. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50(1):1-102, January 1987.
4. Timothy G. Griffin. The formulae-as-types notion of control. In Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL'90, San Francisco, CA, USA, 17-19 Jan 1990, pages 47-57. ACM Press, New York, 1990.
5. Limin Jia and David Walker. Modal proofs as distributed programs. 13th European Symposium on Programming, pages 219-223, March 2004.
6. Jonathan Moody. Modal logic as a basis for distributed computation. Technical Report CMU-CS-03-194, Carnegie Mellon University, Oct 2003.
7. Tom Murphy, VII, Karl Crary, and Robert Harper. Distribed control flow with classical modal logic (technical report). Technical Report CMU-CS-04-177, Carnegie Mellon University, Dec 2004.
8. Tom Murphy, VII, Karl Crary, Robert Harper, and Frank Pfenning. A symmetric modal lambda calculus for distributed computing. In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 8004). IEEE Press, July 2004.
9. Chetan Murthy. Classical proofs as programs: How, what and why. Technical Report TR91-1215, Cornell University, 1991.
10. Michel Parigot. λμ-Calculus: An algorithmic interpretation of classical natural deduction. In Andrei Voronkov, editor, Logic Programming and Automated Reasoning, International Conference LPAR'92, St. Petersburg, Russia, July 15-20, 1992, Proceedings, volume 624 of Lecture Notes in Computer Science. Springer, 1992.
11. Frank Pfenning and Carsten Schürmann. System description: Twelf - a metalogical framework for deductive systems. In Harald Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction, pages 202-206, Trento, Italy, July 1999. Springer-Verlag. LNAI 1632.
12. John H. Reppy. Concurrent Programming in ML. Cambridge University Press, Cambridge, England, 1999.
13. Carsten Schürmann and Frank Pfenning. A coverage checking algorithm for LF. In D. Basin and B. Wolff, editors, Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003), pages 120-135, Rome, Italy, September 2003. Springer-Verlag LNCS 2758.
14. Alex Simpson. The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis, University of Edinburgh, 1994.
15. Philip Wadler. Call-by-value is dual to call-by-name. In Proceedings of the 8th International Conference on Functional Programming (ICFP). ACM Press, August 2003.