scientific article
From MaRDI portal
Publication:3690200
zbMath0572.68015MaRDI QIDQ3690200
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algebraic specificationsinitial algebra semanticscompleteness of Data Type Specificationsterm rewriting methods
Related Items (15)
On sufficient-completeness and related properties of term rewriting systems ⋮ A proof system for conditional algebraic specifications ⋮ On sufficient completeness of conditional specifications ⋮ Design strategies for rewrite rules ⋮ Computing ground reducibility and inductively complete positions ⋮ Automatic inductive theorem proving using Prolog ⋮ Sufficient-completeness, ground-reducibility and their complexity ⋮ Sufficient completeness verification for conditional and constrained TRS ⋮ Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems ⋮ Specification and proof in membership equational logic ⋮ Using induction and rewriting to verify and complete parameterized specifications ⋮ Narrowing based procedures for equational disunification ⋮ Proving weak properties of rewriting ⋮ Reachability analysis over term rewriting systems ⋮ Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
This page was built for publication:
