Mobile Calculi based on Domains


An Abstract Machine for a Higher-Order Distributed Process Calculus

F. Germain and M. Lacoste and J.-B. Stefani

Abstract

This paper presents the formal specification of an abstract machine for the M-calculus, a new distributed process calculus. The M-calculus can be understood as an extension of the join-calculus that realizes an original combination of the following features: programmable localities, higher-order functions and processes, process mobility, and dynamic binding. Our abstract machine covers these different features and presents a modular structure that clearly separates the sequential (functional) evaluation mechanism from the execution core, and the latter from basic marshalling, location and routing mechanisms.

@InProceedings\{germain.lacoste.stefani:abstract-machine-m-calculus,
  author = \{F. Germain and M. Lacoste and J.-B. Stefani},
  title = \{An Abstract Machine for a Higher-Order Distributed Process Calculus},
  booktitle = \{EATCS Workshop on Foundations of Wide Area Network Computing (FWAN'02)},
  year = \{2002}, 
  volume = \{66.3}, 
  publisher = \{Elsevier}, 
  url = \{http://mikado.di.fc.ul.pt/repository/germain.lacoste.stefani_abstract-machine-m-calculus.pdf}
}


About this site. Last modified: Wed Sep 20 22:08:13 CEST 2017