Computing More Specific Versions of Conditional Rewriting Systems

DOI10.1007/978-3-642-38197-3_10zbMath1394.68203OpenAlexW145901300MaRDI QIDQ2848903

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)

Related Items (4)

A Finite Representation of the Narrowing Space ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems ⋮ Determinization of inverted grammar programs via context-free expressions

Uses Software

• InvX

This page was built for publication: Computing More Specific Versions of Conditional Rewriting Systems