Rewriting with a nondeterministic choice operator
type: Item
instance of: scholarly article
title: Rewriting with a nondeterministic choice operator
zbMATH Open document ID: 0633.68013
DOI: 10.1016/0304-3975(86)90005-8
author: Stéphane Kaplan
published in: Theoretical Computer Science
publication date: 1988-01-01T00:00:00Z
review text: See the review of the preliminary version [Programming, Proc. Eur. Symp., Saarbrücken/FRG 1986, Lect. Notes Comput. Sci. 213, 351-374 (1986; Zbl 0605.68017)].
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 4030958
zbMATH Keywords: confluence
zbMATH Keywords: equational rewriting
zbMATH Keywords: bounded nondeterministic choice operator
zbMATH Keywords: algebraic specifications
zbMATH Keywords: term rewriting systems
zbMATH Keywords: toy concurrent language
describes a project that uses: REVE
MaRDI profile type: Publication
full work available at URL: 0304-3975(86)90005-8
OpenAlex ID: W2008571565
cites work: Initial Algebra Semantics and Continuous Algebras
cites work: Ten years of Hoare's logic: A survey. II: Nondeterminism
cites work: Q3696500
cites work: Algebra of communicating processes with abstraction
cites work: Q5186720
cites work: Q3894958
cites work: Q3664417
cites work: Q3216137
cites work: Q3912057
cites work: Q3721811
cites work: Q3696526
cites work: Q3696498
cites work: Q3336735
cites work: Q3962973
cites work: Q3880309
cites work: Q3947096
cites work: Q3028369
cites work: Communicating sequential processes
cites work: Automatic proofs by induction in theories without constructors
cites work: Q3742702
cites work: Q3779721
cites work: Q3338225
cites work: REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies
cites work: Q5581665
cites work: A calculus of communicating systems
cites work: Q3888505
cites work: Q3696524
cites work: Complete Sets of Reductions for Some Equational Theories
cites work: Q3670575
cites work: Q3696496
Recommended article: Q3742702
Recommended article: Q4447251
Recommended article: Nondeterministic algebraic specifications and nonconfluent term rewriting
Recommended article: Q3490967
Recommended article: Q4222981
Recommended article: A higher-order implementation of rewriting
Recommended article: Q2957694
Recommended article: Term orderings for non-reachability of (conditional) rewriting
Recommended article: Rewrite strategies in the rewriting calculus
description: scientific article; zbMATH DE number 4030958