tag:blogger.com,1999:blog-7602886877359920483.post6837796856418154974..comments2009-07-14T12:19:11.863-07:00Comments on Giles Bowkett: Grr!!Giles Bowkettnoreply@blogger.comBlogger2125tag:blogger.com,1999:blog-7602886877359920483.post-83489442275165004672007-01-22T20:09:00.000-08:002007-01-22T20:09:00.000-08:00I had a similar thought when reading a Haskell-eva...I had a similar thought when reading a Haskell-evangelizing blog post that talked about infinite data structures. In my case I thought "Hey, you can do that in Python", and wrote some code to prove it to myself (http://dpaste.com/hold/4485/). Haskell is really nifty, though; it's my "try to learn it" language for 2007.pbxhttps://www.blogger.com/profile/02503451926947358059noreply@blogger.comtag:blogger.com,1999:blog-7602886877359920483.post-39312041687604355302006-12-22T22:51:00.000-08:002006-12-22T22:51:00.000-08:00Okay, Clean and Haskell uses graph reduction techn...Okay, Clean and Haskell uses graph reduction techniques to implement lazy evaluation.<br /><br />Graph reduction allows for cheap memoisation, so, for example, when you multiply two infinite streams of power series coefficients you do not need to recalculate one of them on constant basis.<br /><br />Try to implement multiplication from this paper: http://citeseer.ist.psu.edu/karczmarczuk97generating.html<br /><br />If you succeed too early, try to implement square root. ;)Anonymousnoreply@blogger.com