Abstract
Our intent in this paper is to present a denotational model that supports both data and concurrency description. Data can be pure (concurrency free data such as literals) or processes. Concurrency is supported through processes that may communicate data and thus possibly processes through channels. Processes are thus said:higher order communicating processes. Functions are considered as processes that take their parameters, access some store, communicate on some channels and return some result. The model can be viewed as an extension of the VPLA language (Value-Passing Language with Assignment) proposed initially by Hennessy, thus an extended CCS without Τ's version for handling input, output, communication, assignment and return of results. Furthermore a semantics for a useful set of combinators is defined. A significant subgoal is to investigate the algebraic properties of the model.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work is supported in part by Esprit project LACOS.
Preview
Unable to display preview. Download preview PDF.
References
D. BjØrner and C.B. Jones. Formal Specification and Software Development. Prentice-Hall, 1982.
D. Bolignano and M. Debabi. On the Foundations of the RAISE Specification Language. Technical Report RAD/DMA/92013, Bull-ORDA, May 1992.
T. Bolognesi and E. Brinksma. The Formal Description Technique LOTOS. North Holland, 1989.
M. Debabi and D. Bolignano. Comparative Concurrency and Denotational Semantics. Technical Report RAD/DMA/92002, Bull-ORDA, February 1992.
H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer Verlag, 1985.
A. Giacalone, P. Mishra, and S. Prasad. Facile: a symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121–160, April 1989.
RAISE Language Group. The RAISE Specification Language. Prentice-Hall, 1992.
C.A. Gunter and D.S. Scott. Semantic domains. Handbook of Theoretical Computer Sscience, 31(3):560–599, July 1990.
M. Hennessy. Acceptance trees. Journal of the ACM, 32:896–928, October 1985.
M. Hennessy. Algebraic Theory of Process. MIT Press, 1988.
M. Hennessy and A. Ingólfsdóttir. Communicating Processes with Value-Passing and Assignments. Technical Report, University of Sussex-Draft, June 1991.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
R.E. Milne. Concurrency Models and Axioms. Technical Report, RAISE/CRI/-DOC/4/V1, CRI, 1988.
R.E. Milne. Semantic Foundations of RSL. Technical Report RAISE/CRI-/DOC/4/V1, CRI, 1990.
A.J.R.G. Milner. A calculus of communicating systems. In Lecture Notes in Computer Science 92, pages 281–305, Springer-Verlag, 1980.
A.J.R.G. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. De Nicola and M. Hennessy. Ccs without Τ's. In Lectures Notes in Computer Science 250, pages 294–305, Springer-Verlag, 1987.
M. Tofte R. Milner and R. Harper. The definition of standard ML. MIT Press, 1990.
J.H. Reppy. Cml: a higher-order concurrent language. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language design and Implementation, pages 294–305, SIGPLAN Notices 26(6), 1991.
D.A. Schmidt. Denotational Semantics. Allyn and Bacon,inc, 1986.
M.B. Smyth and G.D. Plotkin. The category-theoretic solution of recursive domain equations. SIAM Journal of Computing, 11(4):761–783, November 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bolignano, D., Debabi, M. (1992). Higher order communicating processes with Value-Passing, Assignment and return of results. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_85
Download citation
DOI: https://doi.org/10.1007/3-540-56279-6_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56279-5
Online ISBN: 978-3-540-47501-9
eBook Packages: Springer Book Archive