Rewriting with a nondeterministic choice operator
- 31 December 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 56 (1) , 37-57
- https://doi.org/10.1016/0304-3975(86)90005-8
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Specification and implementation of concurrently accessed data structures: An abstract data type approachPublished by Springer Nature ,2006
- On the Herbrand Kleene universe for nondeterministic computationsPublished by Springer Nature ,2006
- Simplifying conditional term rewriting systems : Unification, termination and confluenceJournal of Symbolic Computation, 1987
- Reveur-3: the implementation of a general completion procedure parameterized by built-in theories and strategiesScience of Computer Programming, 1987
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- Ten years of Hoare's logic: A survey— part II: NondeterminismTheoretical Computer Science, 1983
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1981
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Communicating sequential processesCommunications of the ACM, 1978