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: AA trees - The F# Journal just published an article: *"This is the second article in a series about balanced search trees. This article takes a look at a purely fun...
1 day ago