Nominal C-Unification

09/15/2017
by   Mauricio Ayala-Rincón, et al.
0

Nominal unification is an extension of first-order unification that takes into account the α-equivalence relation generated by binding operators, following the nominal approach. We propose a sound and complete procedure for nominal unification with commutative operators, or nominal C-unification for short, which has been formalised in Coq. The procedure transforms nominal C-unification problems into simpler (finite families) of fixpoint problems, whose solutions can be generated by algebraic techniques on combinatorics of permutations.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset