Nishida, NaokiVidal, Germán2016-10-272016-10-272013-09-18978-3-319-14124-40302-9743https://riunet.upv.es/handle/10251/72829The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-14125-1_4Narrowing basically extends rewriting by allowing free variables in terms and by replacing matching with unification. As a consequence, the search space of narrowing becomes usually infinite, as in logic programming. In this paper, we introduce the use of some operators that allow one to always produce a finite data structure that still represents all the narrowing derivations. Furthermore, we extract from this data structure a novel, compact equational representation of the (possibly infinite) answers computed by narrowing for a given initial term. Both the finite data structure and the equational representation of the computed answers might be useful in a number of areas, like program comprehension, static analysis, program transformation, etc.17Reserva de todos los derechosLENGUAJES Y SISTEMAS INFORMATICOSCapítulo de libro10.1007/978-3-319-14125-1_4Abierto