A Symmetric Modal Lambda Calculus for Distributed Computing

Authors:
Tom Murphy VII;Karl Crary;Robert Harper;Frank Pfenning
Affiliations:
Carnegie Mellon;Carnegie Mellon;Carnegie Mellon;Carnegie Mellon
Venue:
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Year:
2004

Citing 0
Cited 27

Acute: high-level programming language design for distributed computation

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A modal type system for multi-level generating extensions with persistent code

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Distributed meta-programming

Proceedings of the 5th international conference on Generative programming and component engineering
Hybridizing a Logical Framework

Electronic Notes in Theoretical Computer Science (ENTCS)
Type-safe higher-order channels in ML-like languages

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Acute: High-level programming language design for distributed computation

Journal of Functional Programming
Mechanizing metatheory in a logical framework

Journal of Functional Programming
Contextual modal type theory

ACM Transactions on Computational Logic (TOCL)
Multimodal Separation Logic for Reasoning About Operational Semantics

Electronic Notes in Theoretical Computer Science (ENTCS)
The Logic of Proofs as a Foundation for Certifying Mobile Computation

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Type-safe higher-order channels with channel locality1

Journal of Functional Programming
Language design for distributed objects

Proceedings of the 1st International Workshop on Distributed Objects for the 21st Century
Type-specialized staged programming with process separation

Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
The RPC calculus

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Distributed programming with distributed authorization

Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
Type-safe distributed programming with ML5

TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
AuraConf: a unified approach to authorization and confidentiality

Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Label-free proof systems for intuitionistic modal logic IS5

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Strong normalization and confluence for reflexive combinatory logic

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Intuitionistic hybrid logic: Introduction and survey

Information and Computation
Sequent calculi and decidability for intuitionistic hybrid logic

Information and Computation
Constructive linear-time temporal logic: Proof systems and Kripke semantics

Information and Computation
Logical mobility and locality types

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Distributed control flow with classical modal logic

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A modal language for the safety of mobile values

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Distributed deductive databases, declaratively: the L10 logic programming language

Proceedings of the 2011 ACM SIGPLAN X10 Workshop
Type-specialized staged programming with process separation

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a foundational language for spatially distributed programming, called Lambda 5, that addresses both mobility of code and locality of resources. In order to construct our system, we appeal to the powerful propositions-as-types interpretation of logic. Specifically, we take thepossible worlds of the intuitionistic modal logic IS5 to be nodes on a network, and the connectives 驴 and 驴 to reflect mobility and locality, respectively. We formulate a novel system of natural deduction for IS5, decomposing the introduction and elimination rules for 驴 and 驴, thereby allowing the corresponding programs to be more direct. We then give an operational semantics to our calculus that is type-safe, logically faithful, and computationally realistic.