A back-end for GHC based on categorical multi-combinators
Ricardo Lima, Rafael Dueire Lins, André L. M. Santos · 2004
μTCMC is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of μTCMC. This paper presents the implementation of a Haskell compiler, using the front-end of the Glasgow Haskell Compiler (GHC) and a new back-end based on the μTCMC abstract machine. A number of code optimisations are introduced to μTCMC. The performance of our implementation is benchmarked against the Glasgow Haskell Compiler, one of the most efficient Haskell compilers available.