Comparing algorithms (L+) and (C)

Turner's algorithm (C) can be thought of as a sub-algorithm of (L+). Try it on the term f(g(yxz))(hyx) and see that the abstracts only differ in the names used for the combinators that are introduced by the abstraction process.

[x]

Try some examples yourself to see how these two algorithms compare. The abstracts cease to be "isomorphic" when (L+) makes use of a combinator that does not occur in this list: I, n, ny, yn, yy, nny, nyn and nyy.