Some examples and non-examples of monads.
Three examples of recursion schemes drawn from mathematics, showing the use of linked lists as control structures.
I recently wrote a small source code counter and as part of the process I naturally ran some benchmarks to compare to the many tools that already exist. The results were somewhat erratic, but I was quite disappointed with Rust.
The task is to write a program that computes Fibonacci numbers such that it is obvious the program is correct. It's a sort of "Fibonacci readable" benchmark, and I contend to there exists no solution written in an imperative style that is satisfactory.
I figured I'd present some benchmarks I did because I think it gives some nice examples of the wrong tool for the job. Most of these are from answers on StackOverflow.prev | next