Fixed-point constraints for nominal equational unification
From MaRDI portal
Publication:4993333
Recommendations
Cites work
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols
- A new approach to abstract syntax with variable binding
- A polynomial nominal unification algorithm
- Capture-avoiding substitution as a nominal algebra
- Equivariant unification
- Nominal logic, a first order theory of names and binding
- Nominal rewriting
- Nominal sets. Names and symmetry in computer science
- Nominal unification
- Nominal unification of higher order expressions with recursive let
- Unifying nominal unification
Cited in
(12)- On solving nominal disunification constraints
- Meta-variables as infinite lists in nominal terms unification and rewriting
- A formalisation of nominal C-matching through unification with protected variables
- scientific article; zbMATH DE number 7023675 (Why is no real title available?)
- Unranked Nominal Unification
- On nominal syntax and permutation fixed points
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
- Formalising nominal C-unification generalised with protected variables
- Narrowing based procedures for equational disunification
- On solving nominal fixpoint equations
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let
- A certified functional nominal C-unification algorithm
This page was built for publication: Fixed-point constraints for nominal equational unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993333)
