@conference {IIIA-2001-677,
title = {Context unification and Traversal Equations},
booktitle = {Lecture Notes in Computer Science},
volume = {2051},
year = {2001},
pages = {169-184},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
abstract = {Context unification was originally defined by H. Comon in ICALP{\textquoteright}92, as the problem of finding a unifier for a set of equations containing first-order variables and context variables. These context variables have arguments, and can be instantiated by contexts. In other words, they are second-order variables that are restricted to be instantiated by linear terms (a linear term is a lambda-expresion lambda x_1...lambda x_n.t where every x_i occurs exactly once in t). In this paper, we prove that, if the so called rank-bound conjecture is true, then the context unification problem is decidable. This is done reducing context unification to solvability of traversal equations (a kind of word unification modulo certain permutations) and then, reducing traversal equations to word equations with regular constraints.},
author = {Jordi Levy and Mateu Villaret}
}