A mathematical approach to nondeterminism in data types
From MaRDI portal
Publication:4711358
DOI10.1145/42192.42194zbMath0825.68330OpenAlexW2049498746MaRDI QIDQ4711358
Publication date: 25 June 1992
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/14812412/1988ACMTransProgLangSystHesselink.pdf
Related Items (9)
Conditional rewriting logic: Deduction, models and concurrency ⋮ Deadlock and fairness in morphisms of transition systems ⋮ Interpretations of recursion under unbounded nondeterminacy ⋮ Generated models and the ω-rule: The nondeterministic case ⋮ Typed homomorphic relations extended with subtypes ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ Alternating states for dual nondeterminism in imperative programming ⋮ A functorial semantics for multi-algebras and partial algebras, with applications to syntax. ⋮ A complete axiomatic semantics of spawning
This page was built for publication: A mathematical approach to nondeterminism in data types
