The complexity of equivariant unification
From MaRDI portal
Recommendations
Cited in
(16)- Nominal unification with atom-variables
- Checking overlaps of nominal rewriting rules
- Nominal rewriting
- Encoding abstract syntax without fresh names
- Nominal syntax with atom substitutions
- Implementing nominal unification
- Unifying nominal unification
- Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
- Constraint solving in non-permutative nominal abstract syntax
- Nominal unification with atom and context variables
- Rewriting with generalized nominal unification
- Equivariant unification
- Avoiding equivariance in Alpha-Prolog
- Equivariant unification
- Closed nominal rewriting and efficiently computable nominal algebra equality
- Nominal equational narrowing: rewriting for unification in languages with binders
This page was built for publication: The complexity of equivariant unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466474)