[morphir]

"This is where Scheme really won. Because of its extremely algorithmic---almost mathematical---nature, Scheme can be easily manipulated in a sort of algebraic style. One can follow a series of rewrite rules (just about blindly) to transform a program into another form with some desirable property. This was exactly what I needed."

Can anyone explain this with an example? I have been pondering what he meant with this for a long time.

[plinkplonk]

" 'One can follow a series of rewrite rules (just about blindly) to transform a program into another form with some desirable property. This was exactly what I needed.'

Can anyone explain this with an example? I have been pondering what he meant with this for a long time. "

see the cps-transform rewrite rules in "Essentials of Programming Languages". The first edition has the densest and most extensive explanation. The third edition has the clearest, but a relatively attenuated exposition.

[morphir]

if this proves to be true, I'm most grateful for your tips. Maybe you could be even more specific providing a page number/chapter?

http://books.google.com/books?id=GtPoyremy4EC&printsec=f...