[erlang-questions] Erlang for youngsters

[Richard A. O'Keefe]

> 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.