An efficient nominal unification algorithm
From MaRDI portal
Recommendations
Cited in
(32)- A practically efficient and almost linear unification algorithm
- Nominal unification with atom-variables
- Completeness in PVS of a nominal unification algorithm
- Nominal unification
- Nominal unification with letrec and environment-variables
- An efficient labelled nested multiset unification algorithm
- Nominal equational problems
- A formalisation of nominal C-matching through unification with protected variables
- Nominal unification of higher order expressions with recursive let
- Nominal syntax with atom substitutions
- Implementing nominal unification
- Unifying nominal unification
- The First-Order Nominal Link
- Unity in nominal equational reasoning: the algebra of equality on nominal sets
- αCheck: A mechanized metatheory model checker
- Efficient general AGH-unification
- Meta-variables as infinite lists in nominal terms unification and rewriting
- Nominal unification with atom and context variables
- Unification modulo \(\alpha\)-equivalence in a mathematical assistant system
- Formalising nominal C-unification generalised with protected variables
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let
- A certified functional nominal C-unification algorithm
- Rewriting with generalized nominal unification
- On nominal syntax and permutation fixed points
- Computer Science Logic
- Automata, Languages and Programming
- Nominal AC-matching
- Unranked Nominal Unification
- Strong nominal semantics for fixed-point constraints
- Closed nominal rewriting and efficiently computable nominal algebra equality
- A practical unification algorithm
- A polynomial nominal unification algorithm
This page was built for publication: An efficient nominal unification algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389146)
