Conditional rewrite rules
From MaRDI portal
Publication:1065790
DOI10.1016/0304-3975(84)90087-2zbMath0577.03013OpenAlexW2018227989MaRDI QIDQ1065790
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90087-2
Abstract data types; algebraic specification (68Q65) Equational classes, universal algebra in model theory (03C05)
Related Items
A constructor-based approach for positive/negative-conditional equational specifications, Extended term rewriting systems, Proof by consistency in conditional equational theories, Confluence of the disjoint union of conditional term rewriting systems, Constrained equational deduction, Completeness results for basic narrowing, The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors, Priority rewriting: Semantics, confluence, and conditionals, Conditional rewrite rule systems with built-in arithmetic and induction, Confluence of terminating conditional rewrite systems revisited, Rewrite method for theorem proving in first order theory with equality, Simplifying conditional term rewriting systems: Unification, termination and confluence, Conditional rewrite rules: Confluence and termination, Dependency pairs for proving termination properties of conditional term rewriting systems, Incremental constraint satisfaction for equational logic programming, Rewriting systems over similarity and generalized pseudometric spaces and their properties, Conditional semi-Thue systems for presenting monoids, Some general results about proof normalization, Levels of undecidability in rewriting, Local confluence of conditional and generalized term rewriting systems, On completeness of narrowing strategies, Conditional equational theories and complete sets of transformations, Rewrite, rewrite, rewrite, rewrite, rewrite, \dots, Specification and proof in membership equational logic, Logicality of conditional rewrite systems, On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems, Proving semantical equivalence of data specifications, Strict coherence of conditional rewriting modulo axioms, On the confluence of lambda-calculus with conditional rewriting, Normal forms and normal theories in conditional rewriting, Conditional narrowing modulo a set of equations, Term-rewriting systems with rule priorities, A completion procedure for conditional equations, A strong restriction of the inductive completion procedure, Operational termination of conditional term rewriting systems, Automata-driven automated induction, Contextual rewriting as a sound and complete proof method for conditional LOG-specifications, Proving termination of (conditional) rewrite systems. A semantic approach
Cites Work
