The following pages link to Implementing nominal unification (Q2867897):
Displaying 9 items.
- A polynomial nominal unification algorithm (Q944382) (← links)
- Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms (Q964000) (← links)
- Unification of hypergraph \(\lambda\)-terms (Q1698762) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols (Q1744440) (← links)
- A formalisation of nominal C-matching through unification with protected variables (Q2333665) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols (Q2424886) (← links)
- Nominal Matching and Alpha-Equivalence (Q3511452) (← links)
- Meta-variables as infinite lists in nominal terms unification and rewriting (Q4913996) (← links)
- Nominal Unification from a Higher-Order Perspective (Q5892169) (← links)
