Here I would like to present benchmarks associated with my past
post comparing different methods of
summing the first n numbers. In each case, we benchmarked sum(200),
that is, ∑200i=1i.
A set of curated examples to show ATS' capacities for functional and imperative programming, wherein we sum the numbers 1..n many times:
This post was inspired by a curious
question on
Twitter: is curry or uncurry more common in Haskell code?
As you may know, I have been working on polyglot for some time now. It is now the second-most popular ATS project on github0 and it has reached a state of relative maturity.
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.
prev | next