[plt-scheme] Lazy evaluation and tail calls

2009/2/9 Matthias Felleisen <matthias at ccs.neu.edu>

>
> On Feb 8, 2009, at 7:53 PM, James Coglan wrote:
>
>  I've since moved onto implementing continuations, and I had enough
> trouble getting my head around the applicative order version that I think
> trying to implement continuations for normal order would make my head
> explode...
>
>
> James, just for the record from a semanticist: the terms 'applicative
> order' and 'normal order' make NO SENSE whatsoever in the world of PLs.
> Period. -- Matthias
>


Could you elaborate? These are terms I picked up learning Scheme from SICP
but have also seen any number of confusing descriptions of various calling
semantics.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20090209/b1ddc17f/attachment.html>