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

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 Compiler, one of the most efficient Haskell compilers available.

• Type: Conference
• Year: 2004
• Where: SAC
• Authors: Ricardo Massa Ferreira Lima, Rafael Dueire Lins, André L. M. Santos
• Keywords: Applied Computing, Efficient Haskell Compilers, Glasgow Haskell Compiler, Haskell Compilers, SAC 2004