Leonardo Cabrer

Learn More
Syntactic unification theory is concerned with the problem of finding a substitution that equalises a finite set of pairs of terms simultaneously. More precisely, given a set of function symbols L and a finite set of pairs of L-terms U = {(t1, s1), . . . , (tm, sm)}, called a unification problem, a unifier for U is a substitution σ defined on the set of(More)
  • 1