15 May 2009 Jasper1984   » (Observer)

Higher order functions, what does the data do for you? (Thinking out loud)

A while ago, i thought about how higher order functions in a language require garbage collection.(All be it without loops, afaics.)

Now, i understand how to use recursion pretty well. Recursion provides one with a stack, so the implementor does not have to keep track of that data himself.

So, this brings up the question, can i understand the data higher order functions keep for you the same way i under stack, and does this suggest other ways of coding that are better?

Maybe i haven't read enough books though :), maybe it is obvious to some people.

Latest blog entries     Older blog entries

New Advogato Features

New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.

Keep up with the latest Advogato features by reading the Advogato status blog.

If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!