• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Modal Types for Mobile Code (2008)

Cached

  • Download as a PDF

Download Links

  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [tom7.org]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Tom Murphy, VII
Citations:13 - 0 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Murphy08modaltypes,
    author = {Tom Murphy and VII},
    title = {Modal Types for Mobile Code},
    year = {2008}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

In this dissertation I argue that modal type systems provide an elegant and practical means for controlling local resources in spatially distributed computer programs. A distributed program is one that executes in multiple physical or logical places. It usually does so because those places have local resources that can only be used in those locations. Such resources can include processing power, proximity to data, hardware, or the physical presence of a user. Programmers that write distributed applications therefore need to be able to reason about the places in which their programs will execute. This work provides an elegant and practical way to think about such programs in the form of a type system derived from modal logic. Modal logic allows for reasoning about truth from multiple simultaneous perspectives. These perspectives, called "worlds," are identified with the locations in the distributed program. This enables the programming language to be simultaneously aware of the various hosts involved in a program, their

Citations

2970 Communication and Concurrency - Milner - 1989
1497 The Definition of Standard ML - Milner, Tofte, et al. - 1997
1225 A calculus of communicating systems - Milner - 1980
1016 Proof-carrying code - Necula - 1997
1009 Temporal and modal logic - Emerson - 1990
874 A theory of type polymorphism in programming - Milner - 1978
634 A framework for defining logics - Harper, Honsell, et al. - 1999
595 Compiling with Continuations - Appel - 1992
575 BDI agents: From theory to practice - Rao, Georgeff - 1995
557 From system F to typed assembly language - Morrisett, Walker, et al. - 1999
429 Multipurpose Internet Mail Extensions (MIME) Part Two: Media Types - Freed, Borenstein - 1996
315 A calculus for access control in distributed systems - Abadi, Burrows, et al. - 1993
288 CORBA: Integrating Diverse Applications Within Distributed Heterogeneous Environments - Vinoski - 1997
278 The Oz Programming Model - Smolka - 1995
270 Λµ-calculus: an algorithmic interpretation of classical natural deduction - Parigot - 1992
269 Higher-order abstract syntax - Pfenning, Elliott - 1988
252 Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995
238 Pict: A programming language based on the pi-calculus - Pierce, Turner - 2000
221 Principal type schemes for functional programs - Damas, Milner - 1982
206 A formulae-as-types notion of control - Griffin - 1990
203 A Linear Logical Framework - CERVESATO, PFENNING - 2002
196 Purely Functional Data Structures - Okasaki - 1998
172 A Calculus of Mobile Processes, Part I - Milner, Parrow, et al. - 1989
165 A modal analysis of staged computation - Davies, Pfenning
148 Call-by-name, call-by-value and the lambda-calculus - Plotkin
146 Typed closure conversion - Minamide, Morrisett, et al. - 1996
143 TALx86: A realistic typed assembly language - MORRISETT, CRARY, et al. - 1999
143 R.: A Judgmental Reconstruction of Modal Logic - Pfenning, Davies
121 A spatial logic for concurrency (Part I - Caires, Cardelli - 2001
121 Concurrent Programming in ML - Reppy - 1999
119 Views: A way for pattern matching to cohabit with data abstraction - Wadler - 1987
118 the Free Encyclopedia - Wikipedia
111 Principles of programming with complex objects and collection types - Buneman, Naqvi, et al. - 1995
94 Higher-order functions for parsing - Hutton - 1992
92 IP Network Address Translator (NAT) Terminology and Considerations", RFC 2663 - Srisuresh, Holdrege - 1999
88 The proof theory and semantics of intuitionistic modal logic - Simpson - 1994
87 JJ: Ajax: A New Approach to Web Applications - Garrett
83 G.: The reflexive CHAM and the Join-calculus - Fournet, Gonthier - 1996
81 A metalanguage for programming with bound names modulo renaming - Pitts, Gabbay - 2000
80 A type-theoretic interpretation of Standard ML. Proof, language, and interaction: Essays in honor of robin milner - Harper, Stone - 2000
77 A temporal-logic approach to binding-time analysis - Davies - 1996
75 Logic in access control - Abadi - 2003
75 Extending Java for high-level web service construction - Christensen, Møller, et al.
75 Toward a foundational typed assembly language - Crary - 2003
64 X.: Secure web applications via automatic partitioning - Chong, Liu, et al. - 2007
64 Location-independent communication for mobile agents: a two-level architecture - Sewell, Wojciechowski, et al. - 1999
60 Adaptive and reliable parallel computing on networks of workstations - Blumofe, Lisiecki - 1997
60 Towards a mechanized metatheory of Standard ML - Lee, Crary, et al.
50 A Spatial Logic for Concurrency (Part II - Caires, Cardelli - 2002
50 Protecting browser state from web privacy attacks - Jackson, Bortz, et al. - 2006
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University