(Enter summary)
Abstract: In previous work we presented a foundational calculus
for spatially distributed computing based on intuitionistic
modal logic. Through the modalities # and # we
were able to capture two key invariants: the mobility of
portable code and the locality of fixed resources. (Update)
Cited by: More
Manifest Security for Distributed Information - Crary, Harper, Pfenning (2006)
(Correct)
Mechanizing Language Definitions - Harper, Licata (2006)
(Correct)
Active bibliography (related documents): More All
0.7: Distributed Control Flow with Classical Modal Logic - Murphy VII, Crary, Harper (2005)
(Correct)
0.7: Distributed Control Flow - With Classical Modal
(Correct)
0.3: A Symmetric Modal Lambda Calculus for Distributed Computing - Tom Murphy Vii (2004)
(Correct)
Similar documents based on text: More All
0.3: Automated Techniques for Provably Safe Mobile Code - Colby, Crary, Harper, Lee.. (2000)
(Correct)
0.3: Towards a Functional Library for Fault-Tolerant Grid.. - Chang, DeLap, Liszka, .. (2002)
(Correct)
0.3: A Type System for Higher-Order Modules - Dreyer, Crary, Harper (2003)
(Correct)
Related documents from co-citation: More All
4: Mathematical Structures in Computer Science (context) - Pfenning, Davies et al. - 2001
4: Information flow inference for free
- Pottier, Conchon - 2000
4: TALx86: A realistic typed assembly language
- Morrisett, Crary et al. - 1999
BibTeX entry: (Update)
Murphy VII, Tom, Crary, Karl, & Harper, Robert. (2005). Distributed control flow with classical modal logic. Computer Science Logic. http://citeseer.ist.psu.edu/article/vii05distributed.html More
@misc{ vii05distributed,
author = "M. VII and T. Crary and K. Harper",
title = "Distributed control flow with classical modal logic",
text = "Murphy VII, Tom, Crary, Karl, & Harper, Robert. (2005). Distributed control
flow with classical modal logic. Computer Science Logic.",
year = "2005",
url = "citeseer.ist.psu.edu/article/vii05distributed.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard - 1987
136
System description: Twelf -- a meta-logical framework for de..
- Pfenning, Schurmann - 1999
134
Calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
110
The formulae-as-types notion of control
- Gri - 1990
84
Mathematical Structures in Computer Science (context) - Pfenning, Davies et al. - 2001
68
Towards a geometry of interaction (context) - Girard
63
Concurrent Programming in ML (context) - Reppy - 1999
24
Modal proofs as distributed programs (context) - Jia, Walker - 2004
23
Modal logic as a basis for distributed computation (context) - Moody - 2003
22
The Proof Theory and Semantics of Intuitionistic Modal Logic (context) - Simpson - 1994
18
A constructive logic for services and information flow in co.. (context) - Borghuis, Feijs - 2000
18
A coverage checking algorithm for LF
- Schurmann, Pfenning - 2003
16
A symmetric modal lambda calculus for distributed computing
- Murphy, Karl et al. - 2004
9
A third-order representation of the #-Calculus
- Abel - 2001
9
Classical proofs as programs: How (context) - Murthy - 1991
5
Call-by-value is dual to call-by-name (context) - Wadler - 2003
Documents on the same site (http://www-2.cs.cmu.edu/~rwh/papers.htm): More
A Type System for Higher-Order Modules - Dreyer, Crary, Harper (2001)
(Correct)
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003)
(Correct)
Adaptive Functional Programming - Acar, Blelloch, Harper (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC