A back-end for GHC based on categorical multi-combinators

Ricardo Massa F. Lima, Rafael Dueire Lins, André L. M. Santos
2004 Proceedings of the 2004 ACM symposium on Applied computing - SAC '04  
µΓCMC 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 µΓCMC. 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 µΓCMC abstract machine. A number of code optimisations are introduced to µΓCMC. The performance of our implementation is benchmarked against the Glasgow Haskell
more » ... er, one of the most efficient Haskell compilers available.
doi:10.1145/967900.968196 dblp:conf/sac/LimaLS04 fatcat:uqxulepp4ffxxbjznu2gxa5dyy