In nominal syntax, variable binding is specified using atomabstraction constructors, and alpha-equivalence is formalised using freshness constraints and atom swappings, which implement variable renamings. Composition of swappings gives rise to atom permutations. Algorithms to check equivalence, match and unify nominal terms have been extended to deal with terms where some operators are associative and/or commutative. In the case of nominal C-unification, problems are transformed into finite and complete families of fixpoint equations of the form π.X ≈ ? X, where π is a permutation. To generate nominal C-unifiers, a technique to obtain a sound and complete set of solutions for these equations is needed. In this work we show how complete sets of solutions for nominal fixpoint problems are built and discuss efficient techniques to generate solutions based on algebraic properties of permutations.
Afterwards, in REF , Ayala-Rincón et al. proposed a sound and complete combinatorial procedure to generate the set of solutions of nominal fixed point problems.
On Solving Nominal Fixpoint Equations
FroCoS
Computer Science