Lifting Term Rewriting Derivations in Constructor Systems by Using Generators

Adrián Riesco
(Universidad Complutense de Madrid,)
Juan Rodríguez-Hortalá
(Lambdoop Solutions)

Narrowing is a procedure that was first studied in the context of equational E-unification and that has been used in a wide range of applications. The classic completeness result due to Hullot states that any term rewriting derivation starting from an instance of an expression can be "lifted" to a narrowing derivation, whenever the substitution employed is normalized. In this paper we adapt the generator- based extra-variables-elimination transformation used in functional-logic programming to overcome that limitation, so we are able to lift term rewriting derivations starting from arbitrary instances of expressions. The proposed technique is limited to left-linear constructor systems and to derivations reaching a ground expression. We also present a Maude-based implementation of the technique, using natural rewriting for the on-demand evaluation strategy.

In Santiago Escobar: Proceedings XIV Jornadas sobre Programación y Lenguajes (PROLE 2014), Cadiz, Spain, September 16-19, 2014, Electronic Proceedings in Theoretical Computer Science 173, pp. 87–99.
Published: 8th January 2015.

ArXived at: https://dx.doi.org/10.4204/EPTCS.173.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org