See this document in CiteSeerX!

The M-calculus: A Higher-Order Distributed Process Calculus (2003)  (Make Corrections)  (7 citations)
Alan Schmitt, Jean-Bernard Stefani



  Home/Search   Context   Related

 
View or download:
mikado.di.fc.ul.pt...themcalculus.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mikado.di.fc.ul.pt/o...papers.php (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper presents a new distributed process calculus, called the M-calculus, that can be understood as a higher-order version of the Distributed Join calculus with programmable localities. The calculus retains the implementable character of the Distributed Join calculus while overcoming several important limitations: insu#cient control over communication and mobility, absence of dynamic binding, and limited locality semantics. The calculus is equipped with a polymorphic type system that... (Update)

Cited by:   More
A Symmetric Modal Lambda Calculus for Distributed - Computing Tom Murphy   (Correct)
A Symmetric Modal Lambda Calculus for Distributed.. - Murphy VII.. (2004)   (Correct)

Similar documents (at the sentence level):
35.8%:   The M-calculus: A Higher-Order Distributed Process Calculus - Schmitt, Stefani (2003)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Ist-2001-33234 - Peer-To-Peer Implementation And   (Correct)
0.5:   A Calculus of Higher-Order Distributed Components - Stefani (2003)   (Correct)
0.4:   Requirements for a Global Computing Programming Model - Stefani (2003)   (Correct)

Similar documents based on text:   More   All
0.3:   The M-calculus: a higher-order distributed process calculus - Schmitt, al. (2003)   (Correct)
0.3:   A Calculus of Kells - Stefani (2003)   (Correct)
0.3:   The Marvel Programming Model: a higher-order distributed.. - Schmitt, Stefani (2001)   (Correct)

Related documents from co-citation:   More   All
14:   A spatial logic for concurrency - Caires, Cardelli - 2001
7:   A constructive logic for services and information flow in computer networks (context) - Borghuis, Feijs - 2000
7:   the meaning of the logical constants and the justification of the logical laws (context) - Martin-Lof - 1983

BibTeX entry:   (Update)

Alan Schmitt and Jean-Bernard Stefani. The Mcalculus: 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. http://citeseer.ist.psu.edu/schmitt03mcalculus.html   More

@misc{ schmitt03mcalculus,
  author = "A. Schmitt and J. Stefani",
  title = "The Mcalculus: A higher-order distributed process calculus",
  text = "Alan Schmitt and Jean-Bernard Stefani. The Mcalculus: 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.",
  year = "2003",
  url = "citeseer.ist.psu.edu/schmitt03mcalculus.html" }
Citations (may not include all citations):
410   Mobile ambients - Cardelli, Gordon - 1998
291   A calculus of mobile agents - Fournet, Gonthier et al. - 1996
144   Controlling interference in ambients - Levi, Sangiorgi - 2000
126   Types for mobile ambients - Cardelli - 1999
117   Klaim: a Kernel Language for Agents Interaction and Mobility - De Nicola, Ferrari et al. - 1998
115   An asynchronous model of locality (context) - Amadio - 1997
69   Boxed ambients - Bugliesi, Castagna et al. - 2001
58   Bisimulation congruences in safe ambients - Merro, Hennessy - 2002
57   Type inference for records in a natural extension of ML (context) - Remy - 1993
57   Subtyping and locality in distributed higher-order processes - Yoshida, Hennessy - 1999
49   Theoretical Computer Science (context) - De Nicola, Ferrari et al. - 2000
41   Using Ambients to Control Resources - Teller, Zimmer et al. - 2002
36   Assigning types to processes - Yoshida, Hennessy - 2000
35   calculus: A Higher Order Distributed Process Calculus (context) - Schmitt, Stefani - 2002
31   Towards a calculus of secure mobile computations - Vitek, Castagna - 1998
24   A Distributed Abstract Machine for Safe Ambients (context) - Sangiorgi, Valente - 2076
16   An asynchronous distributed implementation of mobile ambient.. - Fournet, Levy et al. - 2000
16   Safe Dynamic Binding in the Join Calculus - Schmitt - 2002
12   DiTyCO: An Experiment in Code Mobility from the Realm of Pro.. - Lopes, Silva et al. - 1999
9   Nomadic Pict: Language and Infrastructure (context) - Wojciechowski, Sewell - 2000
8   Some results on the join-calculus - Levy - 1997
8   Atomic failure in wide-area computation (context) - Duggan - 2000
8   Ecole Polytechnique (context) - Fournet, PhD - 1998
6   An abstract machine for a higher-order distributed process c.. (context) - Germain, Lacoste et al. - 2002
4   Secure composition of untrusted code: Box (context) - Sewell, Vitek - 2000
4   Conception et Implmentation de Calculs d'Agents Mobiles (context) - Schmitt - 2002

Documents on the same site (http://mikado.di.fc.ul.pt/output/papers.php):   More
Global Computing in a Dynamic Network of Tuple Spaces - De Nicola, Gorla, Pugliese (2005)   (Correct)
Process Calculi and the Verification of Security Protocols - Boreale, Gorla (2002)   (Correct)
Session Types for Inter-Process Communication - Gay, Vasconcelos, Ravara (2003)   (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