RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication
Artículo científico (JournalArticle)
A Modular Order-sorted Equational Generalization Algorithm
Generalization, also called anti-unification, is the dual of unification. Given terms t and t
,
a generalizer is a term t of which t and t are substitution instances. The dual of
a most general unifier (mgu) is that of least general generalizer (lgg). In this work, we
extend the known untyped generalization algorithm to, first, an order-sorted typed setting
with sorts, subsorts, and subtype polymorphism; second, we extend it to work modulo
equational theories, where function symbols can obey any combination of associativity,
commutativity, and identity axioms (including the empty set of such axioms); and third, to
the combination of both, which results in a modular, order-sorted equational generalization
algorithm. Unlike the untyped case, there is in general no single lgg in our framework, due
to order-sortedness or to the equational axioms. Instead, there is a finite, minimal and
complete set of lggs, so that any other generalizer has at least one of them as an instance.
Our generalization algorithms are expressed by means of inference systems for which we
give proofs of correctness. This opens up new applications to partial evaluation, program
synthesis, and theorem proving for typed equational reasoning systems and typed rulebased
languages such as ASF+SDF, Elan, OBJ, Cafe-OBJ, and Maude.
© 2014 Elsevier Inc. All rights reserved.
1., M. Alpuente, S. Escobar, and J. Espert have been partially supported by the EU (FEDER) and the Spanish MEC/MICINN under grant TIN 2010-21062-C02-02, and by Generalitat Valenciana PROMETEO2011/052. J. Meseguer has been supported by NSF Grants CNS 09-04749, and CCF 09-05584.