Computing more specific versions of conditional rewriting systems

DOI10.1007/978-3-642-38197-3_10MaRDI QIDQ2848903zbMATH OpenOpenAlexFDO

Authors Naoki Nishida, Germán Vidal

Publication date 13 September 2013

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38197-3_10

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Recent Trends in Algebraic Development Techniques
• scientific article; zbMATH DE number 4092749
• scientific article; zbMATH DE number 4090852
• Determinization of conditional term rewriting systems
• Computationally Equivalent Elimination of Conditions

Cited in

(5)

• Inverse Unfold Problem and Its Heuristic Solving
• Narrowing trees for syntactically deterministic conditional term rewriting systems
• A Finite Representation of the Narrowing Space
• Completion after program inversion of injective functions
• Determinization of inverted grammar programs via context-free expressions

Describes a project that uses

Uses Software

• InvX

This page was built for publication: Computing more specific versions of conditional rewriting systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848903)