
Nominal C-Unification
2018; Springer Science+Business Media; Linguagem: Inglês
10.1007/978-3-319-94460-9_14
ISSN1611-3349
AutoresMaurício Ayala-Rincón, Washington Luís Ribeiro de Carvalho Segundo, Maribel Fernández, Daniele Nantes-Sobrinho,
Tópico(s)Formal Methods in Verification
ResumoNominal unification is an extension of first-order unification that takes into account the $$\alpha $$ -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 fixed point constraints, whose solutions can be generated by algebraic techniques on combinatorics of permutations.
Referência(s)