Experimenting with "free transformers" in Haskell
BSD-3-CLAUSE License
UPDATE: I've worked this into a library in a private project, that abstracts over Free
and CPS'd F
for efficiency. If you'd be interested in using this, let me know and I can release a package.
An example Haskell implementation of the
"free transformers" approach to
building modular programs by composing layers of Free
interpreters.
This was adapted from a combination of:
In this example, the code does not (yet) go so far as to abstract over the
"computational context" (i.e. sequential/Free
vs parallel/FreeAp
) --
everything is currently sequential.
If you have any tips/ideas/fixes, please let me know!