On solving nominal disunification constraints
From MaRDI portal
Recommendations
Cites work
- Asymmetric unification and disunification
- Combination techniques and decision problems for disunification
- Equational problems and disunification
- Equivariant unification
- Fixed-point constraints for nominal equational unification
- Higher order disunification: some decidable cases
- scientific article; zbMATH DE number 5872263 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- Matching and alpha-equivalence check for nominal terms
- Narrowing based procedures for equational disunification
- Nominal (universal) algebra: equational logic with names and binding
- Nominal Algebra and the HSP Theorem
- Nominal C-unification
- Nominal narrowing
- Nominal rewriting
- Nominal sets. Names and symmetry in computer science
- Nominal unification
- On solving equations and disequations
- On solving nominal fixpoint equations
Cited in
(6)- Nominal equational problems
- Constraint solving in non-permutative nominal abstract syntax
- Fixed-point constraints for nominal equational unification
- Generalized partial computation using disunification to solve constraints
- Strong nominal semantics for fixed-point constraints
- A nominal approach to equational problems in languages with binders
This page was built for publication: On solving nominal disunification constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219072)