Nominal Matching and Alpha-Equivalence
From MaRDI portal
Recommendations
Cites work
- A new approach to abstract syntax with variable binding
- Capture-Avoiding Substitution as a Nominal Algebra
- FreshML: programming with binders made simple
- Implementing nominal unification
- Nominal equational logic
- Nominal logic, a first order theory of names and binding
- Nominal rewriting
- Nominal unification
- OCaml + XDuce
- On theories with a combinatorial definition of 'equivalence'
- Unification theory
Cited in
(10)- Nominal syntax with atom substitutions: matching, unification, rewriting
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
- Nominal syntax with atom substitutions
- Algorithms for extended alpha-equivalence and complexity
- The First-Order Nominal Link
- Unity in nominal equational reasoning: the algebra of equality on nominal sets
- Nominal AC-matching
- Closed nominal rewriting and efficiently computable nominal algebra equality
- A polynomial nominal unification algorithm
- Matching and alpha-equivalence check for nominal terms
This page was built for publication: Nominal Matching and Alpha-Equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511452)