Unifying nominal unification

DOI10.4230/LIPICS.RTA.2013.143MaRDI QIDQ2958381zbMATH OpenOpenAlexFDO

Authors Christophe Calvès

Publication date 1 February 2017

Full work available at URL https://hal.inria.fr/hal-00926833

zbMATH Keywords

alpha-equivalencenominalterm-graph rewritingunification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• An efficient nominal unification algorithm
• Nominal C-unification
• A polynomial nominal unification algorithm
• Automata, Languages and Programming

Cited in

(13)

• Nominal unification with atom-variables
• Nominal C-unification
• Completeness in PVS of a nominal unification algorithm
• Nominal unification of higher order expressions with recursive let
• Essential unifiers
• Nominal syntax with atom substitutions
• Implementing nominal unification
• Fixed-point constraints for nominal equational unification
• scientific article; zbMATH DE number 7453112 (Why is no real title available?)
• Nominal narrowing
• An efficient nominal unification algorithm
• Automata, Languages and Programming
• Foundations of Software Science and Computational Structures

This page was built for publication: Unifying nominal unification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958381)