We just updated our famous ray tracer language comparison with four progressively-optimized Haskell implementations of the ray tracer.
The first implementation is idiomatic Haskell: entirely lazy.
The other three implementations use eager evaluation extensively in an attempt to achieve competitive performance.
Balanced search trees: weight-balanced trees - The F# Journal just published an article: *"This article continues our series about balanced search trees by covering weight balanced trees. This data st...
8 hours ago