PragTob
User defined function, recursion and passing self along
Hey everyone!
This is a multi-layered question and I’ll try my best to try and phrase it cleanly.
As an abstract use case I want to have a function that is adjustable in its behaviour by a caller by passing in an optional function (think Map.merge/3). This function is used to determine what my function does - but it’s not all, it is wrapped and calls a Protocol function on a specific return value. This protocol function might want to call the previous method, hence it requires me to pass along the initially user supplied function… I’d much prefer to be able to create an anonymous function that already is the “wrapped” version of the user supplied function but can’t seem to do it because of recursion…
in code:
# in the module MyModule
def original_method(argument, user_function) do
val = user_function.(argument)
case val do
@continue_symbol ->
MyProtocol.continue(argument, user_function)
_anything ->
val
end
end
# MyProtocol
def continue(argument, fun) do
resolver = fn(argument) -> original_method(argument, fun) end
Stdlib.function(argument, resolver)
end
I’d love the whole of original_method to be an anonymous function by itself (built from my code + the user supplied function), but it seems impossible as it would have to pass itself along to the function it calls on the protocol.
It just feels strange overall. I can’t have it as a nice already wrapped anonymous function and even in the protocol I seem to always have to build my own resolver function calling back to original_method.
Does anyone know of a better way to do this? The concrete code can be found here and the two methods are basically DeepMerge.Integration.do_deep_merge (still working on naming…) and the implementations for DeepMerge.Resolver.resolve. The use case is basically that normally the protocols for each data type know how to resolve the deep_merge, but the user has a shot at changing that behaviour should she choose to (e.g. don’t merge lists).
Thanks a lot for reading this far and helping out, any feedback appreciated
!
Tobi
Marked As Solved
tomekowal
This is a known problem in functional languages. How to make a recursive anonymous function?
Even something as simple as factorial is hard to write:
fac = fn(0) -> 1
(n) -> fac.(n-1) * n end
** (CompileError) iex:2: undefined function fac/1
There are topics abou it on Erlang mailing list and there is this in particular:
http://erlang.org/pipermail/erlang-questions/2003-January/006639.html
and it shows a trick to get around that limitation:
fac = fn(0, _f) -> 1
(n, f) -> f.(n-1) * n end
factorial = fn(n) -> fac.(n, fac) end
factorial.(5)
The good news is this workaround is easy. The bad news is that you would have to teach it to every single user of your library (or just use named functions).
Also Liked
OvermindDL1
That style is called the Y-Combinator. There are many kinds of combinators, should look them up. 
gregvaughn
Here’s a great resource to learn about combinators in general, if Ruby as a sample language works for you: Kestrels, Quirky Birds, and Hopeless Egocentricity
JEG2
Yeah, I’m totally explaining and not defending this design choice. 
peerreynders
OvermindDL1
No need for lisp, just normal functional stuff. ![]()
I usually just point people to the wikipedia article, short, to the point for each combinator: Fixed-point combinator - Wikipedia
For Elixir there are libraries that simplify the combinators as well, such as quark, where the Y-Combinator is named fix for being a fixed-point combinator, but it shows a lot of other non-fixed point combinators as well (that same author makes a lot of awesome libraries like that, especially for functional design, click their name on the lower-right of that page too, especially as a lot of their libs are designed to be used together). ![]()







