A true concurrency semantics for parallel programs
✍ Scribed by Tatjana Kapus; Bogomir Horvat; Marjeta Pučko
- Publisher
- Elsevier Science
- Year
- 1993
- Weight
- 348 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0165-6074
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We use a language L in which we have the propositional connectives A (and), V (or), and -i (not) as primitive. Alternatively we could take some as primitive and define others via the usual definitions, which work even in Kleene's three-valued logic. We also allow quantifiers V and 3, taking both as
Semantics of skeleton-based parallel programming languages comes usually as two distinct items: a functional semantics, modeling the function computed by the skeleton program, and a parallel semantics describing the ways used to exploit parallelism during the execution of the skeleton program. The f
Depth-®rst evaluation causes a gap between the result of the computation and the classical declarative semantics for logic programs. The paper presents a new semantics for logic programs closing that gap. Although not classical, this semantics, called biquantale semantics, is declarative, since it i