Abstract
An applicative language is introduced for representing concurrent programs and communicating systems in the form of mutually recursive systems of non-deterministic equations for functions and streams. Fully abstract mathematical semantics is defined by associating particular fixed points with such systems. These fixed points are chosen using a combination of several complete partial orderings. Operational semantics is described in the form of term rewriting rules, consistent with the mathematical semantics. It represents data driven reduction semantics for usual expressions and data driven data flow semantics in the case of recursive stream equations. So the language allows to treat the basic semantic notions of nondeterminism, parallelism, communication, and concurrency for multiprogramming in a completely formal, applicative framework. In particular it provides a semantic theory for networks of loosely-coupled, nondeterministic, communicating, stream-processing functions.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | North-Holland Publ Co |
| Pages | 125-148 |
| Number of pages | 24 |
| ISBN (Print) | 0444866191 |
| State | Published - 1983 |