Computationally Equivalent Elimination of Conditions
From MaRDI portal
Publication:3527281
DOI10.1007/11805618_3zbMath1151.68438OpenAlexW1519733717MaRDI QIDQ3527281
Traian-Florin Şerbănuţă, Grigore Roşu
Publication date: 25 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/11166
Related Items (11)
Unnamed Item ⋮ Transformations of Conditional Rewrite Systems Revisited ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ 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 ⋮ Completion after Program Inversion of Injective Functions ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Applications and extensions of context-sensitive rewriting ⋮ Using well-founded relations for proving operational termination ⋮ Transformation for Refining Unraveled Conditional Term Rewriting Systems
Uses Software
This page was built for publication: Computationally Equivalent Elimination of Conditions
