As a follow-up to my post on computing the Levenshtein distance in ATS, I figured I'd write up some of the actual benchmark results, as well as some of the subtleties involved in benchmarking various ecosystems.
Initially, I had written
hackage-fetch to see if there was
any use of
coelgot
anywhere on Hackage. At the time, there was not, but this has changed due
to my gmpint package. As of
writing, it is not surprisingly the only use of co-(Elgot algebra)s on the entirety of Hackage.
I've talked about polyglot ATS/Haskell builds previously, but I wanted to show off the results of all this work without so much didactic focus.
Some examples and non-examples of monads.
Three examples of recursion schemes drawn from mathematics, showing the use of linked lists as control structures.
prev | next