A symmetric modal lambda calculus for distributed computing

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 286-295

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

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED PROGRAMMING; LAMBDA; POTENTIAL MOBILITY;

COMPUTER PROGRAMMING LANGUAGES; INTERNET; LOGIC PROGRAMMING; MODAL ANALYSIS; SEMANTICS; SYNCHRONIZATION;

COMPUTER SCIENCE;

EID: 4544313887     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Tijn Borghuis and Loe M. G. Feijs. A constructive logic for services and information flow in computer networks. The Computer Journal, 43(4):274-289, 2000.
2. Luís Caires and Luca Cardelli. A spatial logic for concurrency (part I). In Theoretical Aspects of Computer Software (TACS), pages 1-37. Springer-Verlag LNCS 2215, October 2001.
3. Luís Caires and Luca Cardelli. A spatial logic for concurrency (part II). In Proceedings of the 13th International Conference on Concurrency Theory (CONCUR), pages 209-225, Brno, Czech Republic, August 2002. Springer-Verlag LNCS 2421.
4. Luca Cardelli and Andrew D. Gordon. Anytime, anywhere. modal logics for mobile ambients. In Proceedings of the 27th Symposium on Principles of Programming Languages (POPL), pages 365-377. ACM Press, 2000.
5. Matthew Hennessy, Julian Rathke, and Nobuko Yoshida. SafeDPi: A language for controlling mobile code. Report 02/2003, Department of Computer Science, University of Sussex, October 2003.
6. Limin Jia and David Walker. Modal proofs as distributed programs. 13th European Symposium on Programming, pages 219-223, March 2004.
7. S. Kanger. Provability in Logic. Almquist and Wiksell, Stockholm, 1957.
8. Per Martin-Löf. On the meanings of the logical constants and the justifications of the logical laws. Nordic Journal of Philosophical Logic, 1(1):11-60, 1996.
9. Jonathan Moody. Modal logic as a basis for distributed computation. Technical Report CMU-CS-03-194, Carnegie Mellon University, Oct 2003.
10. Tom Murphy, VII, Karl Crary, Robert Harper, and Frank Pfenning. A symmetric modal lambda calculus for distributed computing. Technical Report CMU-CS-04-105, Carnegie Mellon University, Mar 2004.
11. Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84-141, 2000.
12. 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.
13. 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.
14. Frank Pfenning and Carsten Schürmann. System description: Twelf - a meta-logical 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.
15. A. N. Prior. Time and Modality. Oxford University Press, 1957.
16. Alan Schmitt and Jean-Bernard Stefani. The M-calculus: A higher-order distributed process calculus. In Conference Record of the 30th Symposium on Principles of programmming Languages, pages 50-61, New Orleans, Louisiana, January 2003. ACM Press.
17. 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.
18. Alex Simpson. The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis, University of Edinburgh, 1994.