REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies

DOI10.1016/0167-6423(87)90004-9zbMath0635.68017MaRDI QIDQ1097686

Hélène Kirchner, Claude Kirchner

Publication date: 1987

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(87)90004-9

zbMATH Keywords

term rewriting systems; strategies; completion procedure; built-in theories; REVEUR-3

Mathematics Subject Classification ID

68Q65: Abstract data types; algebraic specification

68N01: General topics in the theory of software

Related Items

Equational completion in order-sorted algebras, Rewriting with a nondeterministic choice operator, Unification in combinations of collapse-free regular theories, Computations in APS, Automatic proofs by induction in theories without constructors