Composing processes
- 1 January 1996
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 344-357
- https://doi.org/10.1145/237721.237802
Abstract
We present a theory of types for concurrency based on a simple notion of typed algebras, and discuss its applications. The basic idea is to determine a partial algebra of processes by a partial algebra of types, thus controlling process composability, just as types in a typed applicative structure [25] determine composability of elements of the underlying applicative structure. A class of typed algebras with a simple operator for process composition are introduced, which are shown to encompass...Keywords
This publication has 0 references indexed in Scilit: