14 Oct
2007
14 Oct
'07
8:46 p.m.
ok wrote:
If one wants a lazy dynamically typed programming language that lets you construct "infinite lists" by using the basic language mechanisms in a simple and direct way, there's always Recanati's Lambdix, which is a lazy Lisp. I don't know whether that ever saw serious use, but it does show that the thing can be done.
There is also the "Lazy Scheme" language level in recent releases of DrScheme. http://www.ccs.neu.edu/scheme/pubs/fdpe05-bc.pdf It is syntactic sugar over promises, so its primary use would be in education. It would make a lovely segue between Scheme and Haskell. --PR