scientific article
From MaRDI portal
Publication:3785921
zbMath0643.68031MaRDI QIDQ3785921
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algebraic specificationsterm rewriting systemssufficient completenessanti-unificationalgebra of termsconvertibility
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items
On sufficient-completeness and related properties of term rewriting systems, Negation with logical variables in conditional rewriting, Sufficient-completeness, ground-reducibility and their complexity, Equational problems and disunification, Sufficient completeness verification for conditional and constrained TRS, Specification and proof in membership equational logic, Using induction and rewriting to verify and complete parameterized specifications, Proving weak properties of rewriting, Reachability analysis over term rewriting systems, Matching - a special case of unification?, Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness, Automatic proofs by induction in theories without constructors
