Michael Norrish Mechanising lambda-calculus using a classical first order theory of terms with permutations. [Citation Graph (0, 0)][DBLP] Higher-Order and Symbolic Computation, 2006, v:19, n:2-3, pp:169-195 [Journal]

Makoto Hamana An initial algebra approach to term rewriting systems with variable binders. [Citation Graph (0, 0)][DBLP] Higher-Order and Symbolic Computation, 2006, v:19, n:2-3, pp:231-262 [Journal]

Miki Tanaka, John Power Pseudo-distributive laws and axiomatics for variable binding. [Citation Graph (0, 0)][DBLP] Higher-Order and Symbolic Computation, 2006, v:19, n:2-3, pp:305-337 [Journal]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP