Hopac claims that its Jobs are much more lightweight that F# Asyncs. There are many benchmarks on Hopac github repository, but I wanted to make a simple and straightforward benchmark and what could be simpler that parallel Fibonacci algorithm? :) (actually there's a more comprehensive  benchmark in the Hopac repository itself, see Fibonacci.fs)Sequential Fibonacci function is usually defined asSo write a parallel version in Hopac where each step is performed in a Job and all these Jobs are (potentially) ru[...]