Thursday, 18 May 2017

Random access lists

The F# Journal just published an article:

"Ordinary F# lists are singly-linked immutable lists that permit constant-time prepend and decapitate but counting the length and random access are linear time. This article looks at an alternative data structure, a form of random access list, that is based upon a tree rather than a list in order to provide logarithmic complexity for many operations..."

If you subscribe to the F# Journal then can read this article here otherwise subscribe to the The F# Journal today to read this article and many more!

Monday, 1 May 2017

F# vs OCaml performance: the Boyer benchmark

The F# Journal just published an article:

"The OCaml compiler contains a benchmark suite that includes several different heavily-symbolic benchmarks. Symbolic programs are the one use case that OCaml was designed for and has been optimised at for over two decades. This article ports OCaml's Boyer benchmark to F#, looks at optimisations and concludes that the parallelized F# solution is 3x faster than the original OCaml..."

If you subscribe to the F# Journal then can read this article here otherwise subscribe to the The F# Journal today to read this article and many more!