with Classical Modal Logic Tom Murphy VII, Karl Crary, and Robert Harper...  Home/Search
Context
Related
| cmu.edu/~crary/papers/2005/c5.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~crary/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In previous work we presented a foundational calculus for spatially distributed computing based on intuitionistic modal logic. With the modalities # and # we were able to capture two key invariants: the mobility of portable code and the locality of fixed resources. This work investigates issues in distributed control flow through a similar propositions-as-types interpretation of classical modal logic. The resulting programming language is enhanced with the notion of a network-wide... (Update)
Active bibliography (related documents): More All
1.2: Distributed Control Flow - With Classical Modal (Correct)
0.7: Distributed Control Flow with Classical Modal Logic - Murphy VII, Crary, Harper (2005) (Correct)
0.2: A Symmetric Modal Lambda Calculus for Distributed Computing - Tom Murphy Vii (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ modal-distributed,
author = "With Classical Modal",
title = "Distributed Control Flow",
url = "citeseer.ist.psu.edu/752284.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
136 System description: Twelf -- a metalogical framework for ded.. - Pfenning, Schurmann - 1999
134 Calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
110 The formulae-as-types notion of control - Gri - 1990
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 coverage checking algorithm for LF - Schurmann, Pfenning - 2003
16 A symmetric modal lambda calculus for distributed computing - Murphy, Karl et al. - 2004
9 Classical proofs as programs: How (context) - Murthy - 1991
9 A third-order representation of the #-Calculus - Abel - 2001
5 Call-by-value is dual to call-by-name (context) - Wadler
2 Distribed control flow with classical modal logic (context) - Murphy, Karl et al. - 2004
Documents on the same site (http://www.cs.cmu.edu/~crary/papers/): More
From System F to Typed Assembly Language - Morrisett, Walker, Crary, Glew (1998) (Correct)
From System F to Typed Assembly Language - Morrisett, Walker, Crary, Glew (1998) (Correct)
Principles and a Preliminary Design for ML2000 - Group (1999) (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