<div dir="ltr">It's not hard... but can be extremely expensive if it builds a call stack (e.g. Java)...<br><br>On Thursday, June 19, 2014 8:32:59 PM UTC-5, Richard A. O'Keefe wrote:<blockquote class="gmail_quote" style="margin: 0;margin-left: 0.8ex;border-left: 1px #ccc solid;padding-left: 1ex;">> Evgeny M writes:
<br>>> Recursion is hard in any language without pattern matching.
<br>
<br>I don't believe that.  Decades ago I was using languages like Algol,
<br>Lisp, Pop-2, in all of which pattern matching was entirely absent
<br>yet recursion was easy.
<br>
<br>I'm reminded of Susan's classroom.  I think it's in "The Thief of Time."
<br>The quote goes something like this:
<br> she hadn't told the children algebra was hard,
<br> so they never found out.
<br>
<br>
<br>______________________________<wbr>_________________
<br>erlang-questions mailing list
<br><a href="javascript:" target="_blank" gdf-obfuscated-mailto="t8cSiS2C-V0J" onmousedown="this.href='javascript:';return true;" onclick="this.href='javascript:';return true;">erlang-q...@erlang.org</a>
<br><a href="http://erlang.org/mailman/listinfo/erlang-questions" target="_blank" onmousedown="this.href='http://www.google.com/url?q\75http%3A%2F%2Ferlang.org%2Fmailman%2Flistinfo%2Ferlang-questions\46sa\75D\46sntz\0751\46usg\75AFQjCNH15VBDH9qL9o1Zx3x6ZeLmwvUvTg';return true;" onclick="this.href='http://www.google.com/url?q\75http%3A%2F%2Ferlang.org%2Fmailman%2Flistinfo%2Ferlang-questions\46sa\75D\46sntz\0751\46usg\75AFQjCNH15VBDH9qL9o1Zx3x6ZeLmwvUvTg';return true;">http://erlang.org/mailman/<wbr>listinfo/erlang-questions</a>
<br></blockquote></div>