> eager evaluation is a big improvement Does it have any support for laziness? E.g. could one define the list of all fibonacci numbers similarly to Haskell's

> eager evaluation is a big improvement Does it have any support for laziness? E.g. could one define the list of all fibonacci numbers similarly to Haskell's fib = let f a b = a : f b (a+b) in f 0 1