We define a general notion of (syntactic) unification, whose special cases are matching, unification, semi-unification, and weak-unification. We settle all the implications between the various cases of unification leading to a classification and a decidability result. We show that some distinctions holding for finite terms collapse for infinite terms. We give some positive results on the existence of most general weak-unifiers.
Generalizations of Unifications
BERARDUCCI, ALESSANDRO;
1993-01-01
Abstract
We define a general notion of (syntactic) unification, whose special cases are matching, unification, semi-unification, and weak-unification. We settle all the implications between the various cases of unification leading to a classification and a decidability result. We show that some distinctions holding for finite terms collapse for infinite terms. We give some positive results on the existence of most general weak-unifiers.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
