Nominal C-Unification

September 15, 2017 Β· Declared Dead Β· πŸ› International Workshop/Symposium on Logic-based Program Synthesis and Transformation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Mauricio Ayala-RincΓ³n, Washington de Carvalho-Segundo, Maribel FernΓ‘ndez, Daniele Nantes-Sobrinho arXiv ID 1709.05384 Category cs.PL: Programming Languages Cross-listed cs.LO Citations 18 Venue International Workshop/Symposium on Logic-based Program Synthesis and Transformation Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted