The following pages link to Term Rewriting and Applications (Q5703876):
Displaying 8 items.
- Equivariant unification (Q616849) (← links)
- A polynomial nominal unification algorithm (Q944382) (← links)
- Matching and alpha-equivalence check for nominal terms (Q980937) (← links)
- Encoding abstract syntax without fresh names (Q2392477) (← links)
- On the role of names in reasoning about \(\lambda\)-tree syntax specifications (Q2804945) (← links)
- Implementing nominal unification (Q2867897) (← links)
- Automata, Languages and Programming (Q5466474) (← links)
- Typed Lambda Calculi and Applications (Q5704024) (← links)