Lifting Term Rewriting Derivations in Constructor Systems by Using Generators
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&qu...
Main Authors: | Adrián Riesco, Juan Rodríguez-Hortalá |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2015-01-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1501.02035v1 |
Similar Items
-
Partial Inversion of Constructor Term Rewriting Systems
by: Nishida, Naoki, et al.
Published: (2005) -
Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems
by: UCHIYAMA, Keita, et al.
Published: (2007) -
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
by: Uchiyama, Keita, et al.
Published: (2007) -
Term Graph Rewriting and Parallel Term Rewriting
by: Andrea Corradini, et al.
Published: (2011-02-01) -
Generation of Inverse Term Rewriting Systems for Pure Treeless Functions
by: Nishida, Naoki, et al.
Published: (2001)