I wish to also point out that no Perl book replaces a solid grounding in
computer science. Tail-end recursion removal is certainly a technique
covered in the CS literature quite extensively. Any undergraduate book
on algorithms covers it. Sophisticated techniques and new approaches may
well be in journal articles; I personally haven't done a search of the
ACM and IEEE CS literature for this topic. If pushed I can pull down 3
different textbooks on the subject of algorithms and see what they have
to say. Remember, MJD and Damian mostly don't invent new techniques.
Rather, they adapt them to the particular strengths of Perl.
Ken Williams wrote:
On Aug 30, 2006, at 3:09 PM, Andy Armstrong wrote:
Oh and I can't believe you've only skimmed HOP - it's a superb book
that should be mandatory reading if this is an area you're interested
in.
I don't think the point of the book was to stop people from exploring
whatever approaches they might be interested in.
-Ken
