Elimination of conditions

DOI10.1006/jsco.1999.0288zbMath0943.68098OpenAlexW1983900683MaRDI QIDQ1974693

Patrick Viry

Publication date: 8 May 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e548eb61f86609b26fc3d2f4144204f399bcf9b5

zbMATH Keywords

conditional rewrite systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (7)

Unnamed Item ⋮ Transformations of Conditional Rewrite Systems Revisited ⋮ On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings ⋮ Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems ⋮ Reachability in Conditional Term Rewriting Systems ⋮ Completion after Program Inversion of Injective Functions ⋮ Transformation for Refining Unraveled Conditional Term Rewriting Systems

Cites Work

• A rationale for conditional equational programming
• Conditional rewrite rules: Confluence and termination
• Conditional rewriting logic as a unified model of concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Elimination of conditions