Pages that link to "Item:Q944382"
From MaRDI portal
The following pages link to A polynomial nominal unification algorithm (Q944382):
Displaying 22 items.
- Unity in nominal equational reasoning: the algebra of equality on nominal sets (Q420858) (← links)
- Equivariant unification (Q616849) (← links)
- Matching and alpha-equivalence check for nominal terms (Q980937) (← links)
- Nominal unification with atom-variables (Q1640638) (← links)
- On solving nominal fixpoint equations (Q1687556) (← links)
- Unification of hypergraph \(\lambda\)-terms (Q1698762) (← links)
- Nominal unification (Q1882909) (← links)
- Nominal unification with letrec and environment-variables (Q2119105) (← links)
- Nominal syntax with atom substitutions (Q2662669) (← links)
- Implementing nominal unification (Q2867897) (← links)
- Unifying Nominal Unification (Q2958381) (← links)
- The First-Order Nominal Link (Q3003496) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- Meta-variables as infinite lists in nominal terms unification and rewriting (Q4913996) (← links)
- Fixed-Point Constraints for Nominal Equational Unification (Q4993333) (← links)
- Nominal unification with atom and context variables (Q4993360) (← links)
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
- A Certified Functional Nominal C-Unification Algorithm (Q5097631) (← links)
- Rewriting with generalized nominal unification (Q5139280) (← links)
- (Q5216313) (← links)
- Automata, Languages and Programming (Q5466474) (← links)
- Term Rewriting and Applications (Q5703876) (← links)