Rewriting with a nondeterministic choice operator
From MaRDI portal
Publication:1096383
DOI10.1016/0304-3975(86)90005-8zbMath0633.68013OpenAlexW2008571565MaRDI QIDQ1096383
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90005-8
algebraic specificationsconfluenceterm rewriting systemsbounded nondeterministic choice operatorequational rewritingtoy concurrent language
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Ten years of Hoare's logic: A survey. II: Nondeterminism
- Algebra of communicating processes with abstraction
- REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies
- A calculus of communicating systems
- Automatic proofs by induction in theories without constructors
- Complete Sets of Reductions for Some Equational Theories
- Initial Algebra Semantics and Continuous Algebras
- Communicating sequential processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Rewriting with a nondeterministic choice operator
