Rewriting with a nondeterministic choice operator

Stéphane Kaplan
1988 Theoretical Computer Science  
The privileged field of classical algebra and term-rewriting systems is that of strictly deterministic systems: the conjhence property is generally assumed to hold, which implies determinism for the result of the computations, even if there exist several different computation paths. In this paper, we introduce a bounded nondeterministic choice operator "u" into algebraic specifications and related term-rewriting systems. The operator "u", which constructs sets of values, satisfies AC
more » ... e-commutative) properties, which allows to apply results about equational rewriting. Attention is then mainly restricted to so-called regular systems, where nondeterministic choice is constraint-free. Several examples are considered, including a toy concurrent language, for which nontrivial properties may be automatically proved.
doi:10.1016/0304-3975(86)90005-8 fatcat:vbzjnh7lnvfulni4xwag7g7tu4