[erlang-questions] Erlang for youngsters
Sat Jun 21 02:58:39 CEST 2014
It's not hard... but can be extremely expensive if it builds a call stack
On Thursday, June 19, 2014 8:32:59 PM UTC-5, Richard A. O'Keefe wrote:
> > Evgeny M writes:
> >> Recursion is hard in any language without pattern matching.
> I don't believe that. Decades ago I was using languages like Algol,
> Lisp, Pop-2, in all of which pattern matching was entirely absent
> yet recursion was easy.
> I'm reminded of Susan's classroom. I think it's in "The Thief of Time."
> The quote goes something like this:
> she hadn't told the children algebra was hard,
> so they never found out.
> erlang-questions mailing list
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the erlang-questions