A Domain-theoretic Model for a Higher-order Process Calculus (1996)
| Venue: | Proceedings of the 17th International Colloquium on Automata Languages and Programming |
| Citations: | 10 - 2 self |
BibTeX
@INPROCEEDINGS{Jagadeesan96adomain-theoretic,
author = {Radhakrishnan Jagadeesan and Prakash Panangaden},
title = {A Domain-theoretic Model for a Higher-order Process Calculus},
booktitle = {Proceedings of the 17th International Colloquium on Automata Languages and Programming},
year = {1996},
pages = {181--194},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we study a higher-order process calculus, a restriction of one due to Boudol, and develop an abstract, model for it. By abstract we mean that the model is constructed domain-theoretically and reflects a certain conceptual viewpoint about observability. It is not constructed from the syntax of the calculus or from computation sequences. We describe a new powerdomain construction that can be given additional algebraic structure that allows one to model concurrent composition, in the same sense that Plotkin's powerdomain can have a continuous binary operation defined on it to model choice. We show that the model constructed this way is adequate with respect to the operational semantics. The model that we develop and our analysis of it is closely related to the work of Abramsky and Ong on the lazy lambda calculus. 1 Introduction A fundamental problem in the semantics of parallel programming languages is integrating concurrency with abstraction. Kahn's pioneering work on stat...
Citations
| 997 | The Lambda Calculus, its Syntax and Semantics - Barendregt - 1984 |
| 933 | A calculus of mobile processes - Milner, Parrow, et al. - 1992 |
| 664 | The Semantics of a Simple Language for Parallel Programming - Kahn - 1974 |
| 426 | The chemical abstract machine - Berry, Boudol - 1990 |
| 374 | Algebraic theory of processes - Hennessy - 1988 |
| 56 | Towards a lambda calculus for concurrent and communicating systems - Boudol - 1989 |
| 53 | A calculus of communicating systems with label passing - Engberg, Nielsen - 1986 |
| 35 | A fully abstract trace model for dataflow networks - Jonsson - 1989 |
| 23 | A Fully Abstract Semantics for Data Flow Nets - Kok - 1987 |
| 6 | Some syntactic and categorical constructions of lambda calculus models. Papport de Recherche 80, Institute National de Recherche en Informatique et en Automatique (INRIA - Berry - 1981 |
| 1 | Full abstraction in the lazy lambda calculus. Submitted to Information and Computation - Abramsky, Ong - 1988 |
| 1 | The typed lambda-calculus with first-class processes - Neilson |
