Denotational semantics for unguarded recursion: the demonic case
January 1990
Research Paper
| Related Files |
|---|
View PDF Version
(eur-few-cs-90-05.pdf, 0.1MB) |
We show that the technique to prove equivalence of operational and denotational cpo based semantics using retractions, as introduced in de Bruin & Vink [1989] for a sequential backtracking language, can be applied to parallel languages as well. We prove equivalence for a uniform language in which procedure calls need not be guarded. The unguardedness is taken care of by giving a semantics in which the nondeterminism is demonic.
Keywords
Automatically Extracted Terms
- definition
- ~ ~
- semantic
- ~ ~ ~
- x ~ y
- stream
- lemma
- point
- operator
- mapping
- procedure
- section
- proof
- equivalence
- transformation
- statement
- denotational semantics
- denotational
- action
- version
