Equational completion in order-sorted algebras
type: Item
instance of: scholarly article
title: Equational completion in order-sorted algebras
zbMATH Open document ID: 0698.68028
DOI: 10.1016/0304-3975(90)90034-F
author: Isabelle Gnaedig
author: Claude Kirchner
author: Hélène Kirchner
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
review text: See the review in Zbl 0647.68036.
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 03D03
Mathematics Subject Classification ID: 08B05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 4145315
zbMATH Keywords: completion procedures
zbMATH Keywords: equational term rewriting systems
zbMATH Keywords: order-sorted algebras
zbMATH Keywords: order-sorted equational logic
describes a project that uses: Miranda
describes a project that uses: REVE
MaRDI profile type: Publication
cites work: Q3809306
cites work: Rewrite systems on a lattice of types
cites work: Orderings for term-rewriting systems
cites work: Termination of rewriting
cites work: Proving termination with multiset orderings
cites work: Q3210187
cites work: Order-sorted completion: The many-sorted way
cites work: Q3792234
cites work: Q3334056
cites work: Q3817573
cites work: Q3719824
cites work: Q3962973
cites work: Q3030249
cites work: Programming with Equations
cites work: Q3674088
cites work: A complete proof of correctness of the Knuth-Bendix completion algorithm
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Proofs by induction in equational theories with constructors
cites work: Q3673071
cites work: Q3992573
cites work: Completion of a Set of Rules Modulo a Set of Equations
cites work: On multiset orderings
cites work: Q3336736
cites work: REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies
cites work: Q3795207
cites work: Q3675552
cites work: Q5581665
cites work: New decision algorithms for finitely presented commutative semigroups
cites work: Q3687683
cites work: On theories with a combinatorial definition of 'equivalence'
cites work: Investigations in many-sorted quantor logic
cites work: Complete Sets of Reductions for Some Equational Theories
cites work: Q3786020
cites work: Q3819991
cites work: Q3721784
cites work: Semantics of order-sorted specifications
Recommended article: Q3792234
Recommended article: Q4038726
Recommended article: Q3737481
Recommended article: Order-sorted Equational Unification Revisited
Recommended article: Q3509209
Recommended article: Q5389312
Recommended article: Q5536238
Recommended article: Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras
Recommended article: Equational formulas and pattern operations in initial order-sorted algebras
Recommended article: Q3028333
description: scientific article; zbMATH DE number 4145315