Rewriting with a nondeterministic choice operator
DOI10.1016/0304-3975(86)90005-8zbMATH Open0633.68013OpenAlexW2008571565MaRDI QIDQ1096383FDOQ1096383
Authors: Stéphane Kaplan
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
Recommendations
- scientific article; zbMATH DE number 3978366
- scientific article; zbMATH DE number 2043547
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- Publication:3490967
- scientific article; zbMATH DE number 1231656
- A higher-order implementation of rewriting
- scientific article
- Term orderings for non-reachability of (conditional) rewriting
- Rewrite strategies in the rewriting calculus
confluenceterm rewriting systemsalgebraic specificationsbounded nondeterministic choice operatorequational rewritingtoy concurrent language
General topics in the theory of software (68N01) Abstract data types; algebraic specification (68Q65)
Cites Work
- Initial Algebra Semantics and Continuous Algebras
- Algebra of communicating processes with abstraction
- A calculus of communicating systems
- Communicating sequential processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete Sets of Reductions for Some Equational Theories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ten years of Hoare's logic: A survey. II: Nondeterminism
- Automatic proofs by induction in theories without constructors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Rewriting with a nondeterministic choice operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096383)