Name:
Anonymous
2011-07-21 11:06
Would SICP become more elegant if it was done with Haskell instead of Scheme?
Name:
Anonymous
2011-07-21 11:12
SICP is already infinitely elegant.
Name:
Anonymous
2011-07-21 14:27
>>2
There are different sizes of infinity.
Name:
Anonymous
2011-07-21 14:42
>>3
There are infinite infinities? Than, how can Hask
cannot construct the infinite type: a = Inf a
Name:
Anonymous
2011-07-21 15:38
>>1
SICP is about understanding processes. Haskell's laziness is about obscuring processes.
Name:
Anonymous
2011-07-21 16:00
>>6
For things you encounter in SICP you won't even notice the language is lazy.