The F# Journal just published an article about benchmarking:
"Hash tables are inherently imperative concrete implementations of the abstract data structures known as dictionaries and sets. Hash tables have been ubiquitous in imperative programming since their rise to fame in the Perl programming language in the 1990s. In contrast, purely functional dictionaries are notoriously slow. Consequently, much effort has been focused on improving the performance of these collections. This article looks at the automated performance test suite we wrote for the F# Set and Map collections..."
The F# Journal today!
Xavier Leroy's "standard lecture on threads" - Xavier Leroy’s standard lecture on threads post from the caml-list in 2002 seems to have disappeared from the INRIA archives so I am reproducing it here fo...
1 week ago