Tag Archives: Lazy Evaluation

I’ve been spending a bit of time this weekend playing with Haskell, and I came across an interesting problem while writing a few functions that, overtly, would seem quite simple. Notably, Haskell is a lazy language, storing promises of later evaluation in what are called thunks. Having some reasonable amount of experience in Clojure, lazy [...]