scientific article; zbMATH DE number 3896335
From MaRDI portal
Publication:3675552
[For the entire collection see Zbl 0537.00025.] The paper presents a general completion algorithm for classes of equational theories which admit an equational term rewriting system. It can be used as a valuable tool for proving theorems in the initial algebra of an equational theory as well as for building up specifications by successive enrichments and for the verification of the correctness of some equational specification with respect to another one. The procedure was implemented in the system REVE.
Recommendations
Cited in
(11)- Inductive completion with retracts
- REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies
- Unification in combinations of collapse-free regular theories
- History and basic features of the critical-pair/completion procedure
- scientific article; zbMATH DE number 3871335 (Why is no real title available?)
- A Modular Equational Generalization Algorithm
- scientific article; zbMATH DE number 3943001 (Why is no real title available?)
- scientific article; zbMATH DE number 3945335 (Why is no real title available?)
- scientific article; zbMATH DE number 139988 (Why is no real title available?)
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- Equational completion in order-sorted algebras
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3675552)