The totient function is defined for positive integers as:

I read a recent Functional Pearl by Hinze and this inspired me to write up an example of projective programming and its motivation in logic/model theory.

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, \( \sum_{i=1}^{200} i \).

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?