[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Chicken-users] Unbounded stack growth

From: John Cowan
Subject: Re: [Chicken-users] Unbounded stack growth
Date: Wed, 11 Jul 2012 23:23:51 -0400
User-agent: Mutt/1.5.20 (2009-06-14)

Matthew Flatt scripsit:

> Amen. Just because a computation is naturally expressed as a recursion
> does not mean that you should write it that way.

Well.  Just because you can implement division by tree-walking doesn't
mean you should write *it* that way.

But thanks for a much-needed injection.

Not to perambulate                 John Cowan <address@hidden>
    the corridors        
during the hours of repose
    in the boots of ascension.       --Sign in Austrian ski-resort hotel

reply via email to

[Prev in Thread] Current Thread [Next in Thread]