You may have seen my post on co-(Elgot algebras),
in which I mentioned I had been using some exotic recursion schemes for my
gmpint package. I came across a similar example, this time for Mendler-style
recursion schemes. To my knowledge, it is the only published example of
a Mendler-style catamorphism.
Suppose we wish to convert a number to its base \( b \) representation. GMP uses arrays of limbs to represent large integers; we need to tease out its base \( 2 ^{64} \) representation.
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.
I am happy to announce that atspkg now has experimental support for
cross-compiling! I will give a short illustration of how this works using my own
project, polyglot.
Some examples and non-examples of monads.
prev | next