I have a very simple problem which just extracts some numbers from files adds it. Well the number of files to be searched currently are around 1600. I implemented this extraction in nearly every language I've used before and got some suprising result
This is a website which describes benchmarks that each entail operations on bit streams. These benchmarks have all been implemented in Erlang, O'Caml and Haskell.
Errors such as taking head or tail of the empty list in Haskell are equivalent to the dereferencing of the null pointer. We can eliminate head-of-empty-list errors without modification to the Haskell type system. The same technique applies to OCaml and ev