[plt-scheme] Getting started with Scheme: How can I improve my code for generating prime numbers?

On Aug  2, Matthias Felleisen wrote:
> 
> Better still, as Eli demonstrated, PLT Scheme comes with the right
> kind of 'syntactic sugar' so that you can program imperatively as if
> you were in a plain imperative language like core Python or C. (*)
> So Eli's program isn't real Scheme at all.

A big +1 to everything Matthias said[*], and in addition note that I
was careful to write:

  "a direct translation of your code to >>PLT<< Scheme"

([*] Including the philosophical question of whether purely functional
programming exists.)

-- 
          ((lambda (x) (x x)) (lambda (x) (x x)))          Eli Barzilay:
                    http://barzilay.org/                   Maze is Life!