This is the second post in a series on the Y combinator. Part 1
In the last post on the Y combinator, we established that some functional languages (such as Erlang) make it hard to have recursive, anonymous functions. Namely, there is no name that is bound to the "current" anonymous function. Furthermore, we established that we could work around this problem by passing the anonymous function to itself. When we concluded, we had derived this much:
Foo = fun(AlsoFoo, N) ->
case N of
1 -> 1;
_ -> N * AlsoFoo(AlsoFoo, N - 1)
end
end,
Fact = fun(X) -> Foo(Foo, X) end
This post will focus on extracting the Y combinator from the above code. We will follow a sequence of transformations, each with a specific intent. In the end, we will hopefully have some beautiful code.
Reducing the Number of Arguments
This factorial algorithm started with a function that took a single parameter. This function called itself with successively smaller values, until it reached a base case. However, we muddied the waters by passing the function around as well. We would like to return to having a one-parameter function. We can accomplish this by creating another level of closure:
Foo = fun(AlsoFoo) ->
fun(N) ->
case N of
1 -> 1;
_ -> N * (AlsoFoo(AlsoFoo))(N - 1)
end
end
end,
Fact = fun(X) -> (Foo(Foo))(X) end
Now it is clear that our recursive function is really only calling itself with one parameter.
Simplifying the Recursive Function Call
The place where we make the recursive call is rather ugly. We have to build the function upon which we will recurse before we can actually call it. It would be better if the recursive function was explicitly named. We can do that, too:
Foo = fun(AlsoFoo) ->
fun(N) ->
case N of
1 -> 1;
_ ->
AlsoFooAlsoFoo = fun(Z) -> (AlsoFoo(AlsoFoo))(Z) end,
N * AlsoFooAlsoFoo(N - 1)
end
end
end,
Fact = fun(X) -> (Foo(Foo))(X) end
We can simplify the body further by moving AlsoFooAlsoFoo to a higher scope.
Foo = fun(AlsoFoo) ->
AlsoFooAlsoFoo = fun(Z) -> (AlsoFoo(AlsoFoo))(Z) end,
fun(N) ->
case N of
1 -> 1;
_ -> N * AlsoFooAlsoFoo(N - 1)
end
end
end,
Fact = fun(X) -> (Foo(Foo))(X) end
As an aside, you might find this step overly complicated. You may ask, why did we not simply define AlsoFooAlsoFoo = AlsoFoo(AlsoFoo). I hope to get into the details in a later post, but for now, just realize that would change the evaluation order in a bad way. Or, try it yourself and find out why it doesn't work.
Extracting the Anonymous Function
Right now, the body of our algorithm is embedded deeply within some necessary plumbing. We would like to extract our algorithm from the center of this. This is quite easy:
Foo = fun(AlsoFoo) ->
AlsoFooAlsoFoo = fun(Z) -> (AlsoFoo(AlsoFoo))(Z) end,
FactRec = fun(Self) ->
fun(N) ->
case N of
1 -> 1;
_ -> N * Self(N - 1)
end
end
end,
FactRec(AlsoFooAlsoFoo)
end,
Fact = fun(X) -> (Foo(Foo))(X) end
Now we can pull it outside the body of Foo.
FactRec = fun(Self) ->
fun(N) ->
case N of
1 -> 1;
_ -> N * Self(N - 1)
end
end
end,
Foo = fun(AlsoFoo) ->
AlsoFooAlsoFoo = fun(Z) -> (AlsoFoo(AlsoFoo))(Z) end,
FactRec(AlsoFooAlsoFoo)
end,
Fact = fun(X) -> (Foo(Foo))(X) end
Simplifying Fact
We're getting close, but the definition of Fact still leaves something to be desired. However, in order to make it simpler, we have to first make it messier. Start by moving Foo inside the definition for Fact:
FactRec = fun(Self) ->
fun(N) ->
case N of
1 -> 1;
_ -> N * Self(N - 1)
end
end
end,
Fact = fun(X) ->
Foo = fun(AlsoFoo) ->
AlsoFooAlsoFoo = fun(Z) -> (AlsoFoo(AlsoFoo))(Z) end,
FactRec(AlsoFooAlsoFoo)
end,
(Foo(Foo))(X)
end
Our goal is to build a general-purpose function Y that takes a function F
and produces a self-recursive version of that function. Right now, the innermost part of Foo makes an explicit reference to FactRec. We want to eliminate that explicit reference:
FactRec = fun(Self) ->
fun(N) ->
case N of
1 -> 1;
_ -> N * Self(N - 1)
end
end
end,
Fact = fun(X) ->
Y = fun(Proc) ->
Foo = fun(AlsoFoo) ->
AlsoFooAlsoFoo = fun(Z) -> (AlsoFoo(AlsoFoo))(Z) end,
Proc(AlsoFooAlsoFoo)
end,
Foo(Foo)
end,
(Y(FactRec))(X)
end
Now that we've done this, Y no longer has any bound variables, so we can pull it out of Fact completely:
FactRec = fun(Self) ->
fun(N) ->
case N of
1 -> 1;
_ -> N * Self(N - 1)
end
end
end,
Y = fun(Proc) ->
Foo = fun(AlsoFoo) ->
AlsoFooAlsoFoo = fun(Z) -> (AlsoFoo(AlsoFoo))(Z) end,
Proc(AlsoFooAlsoFoo)
end,
Foo(Foo)
end,
Fact = fun(X) ->
(Y(FactRec))(X)
end
Of course, if we want, we can simplify some of these definitions. Y can become a normal Erlang module function (rather than a function value). Fact itself can be curried - we can eliminate the noise of the explicit parameter. Also, FactRec doesn't need to be named anymore - it can become the anonymous function that we originally intended:
y(F) ->
G = fun(AlsoG) ->
F(fun(Z) -> (AlsoG(AlsoG))(Z) end)
end,
G(G).
Fact = y(fun(Self) ->
fun(N) ->
case N of
1 -> 1;
_ -> N * Self(N - 1)
end
end
end)
Unfortunately, the y function only supports functions that take a single parameter. Some languages have a "splat" operator that can be used to represent "all the parameters;" unfortunately, Erlang does not. Instead, it can be useful to define a family of y functions that deal with functions taking more than one parameter:
y2(F) ->
G = fun(AlsoG) ->
F(fun(Y, Z) -> (AlsoG(AlsoG))(Y, Z) end)
end,
G(G).
Conclusion
We have shown the difficulty in defining recursive, anonymous functions in Erlang. We showed a simple solution to this problem, and then generalized the plumbing to make it easier to use. While this is not necessary in all functional languages, I hope that this is useful to anybody working in a strict language, such as Erlang.
I am planning more posts on this topic. One post will explain the strange step I took in Simplifying the Recursive Function Call. Others will explain just what a fixed point is, what the fixed point combinators are, and how the Y combinator satisfies the definition of a fixed point combinator.
