A similar implementation of a large subset of Haskell was done by Ben Lynn in a winning IOCCC entry as described at [1]. The graph reduction engine is the small

A similar implementation of a large subset of Haskell was done by Ben Lynn in a winning IOCCC entry as described at [1]. The graph reduction engine is the small C programs shown in [2]. A much larger and more production-ready implementation of Haskell into combinatory logic was made by Lennart Augustsson [3]. [1] https://crypto.stanford.edu/~blynn/compiler/ https://crypto.stanford.edu/~blynn/compiler/ [2] https://crypto.stanford.edu/~blynn/compiler/c.html https://crypto.stanford.edu/~blynn/compiler/c.html [3] https://github.com/augustss/MicroHs https://github.com/augustss/MicroHs