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

Authors:
Ricardo Massa F. Lima;Rafael Dueire Lins;André L. M. Santos
Affiliations:
Universidade de Pernambuco;Universidade Federal de, Pernambuco;Centro de Informática, Universidade Federal de, Pernambuco
Venue:
Proceedings of the 2004 ACM symposium on Applied computing
Year:
2004

Citing 8
Cited 1

The categorical abstract machine

Proc. of a conference on Functional programming languages and computer architecture
Implementing SASL using categorical multi-combinators

Software—Practice & Experience
The spineless tagless G-machine

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
GM-C: a graph multi-combinator machine

Microprocessing and Microprogramming
A gentle introduction to Haskell

ACM SIGPLAN Notices - Haskell special issue
The categorical multi-combinator machine: CMCM

The Computer Journal - Special issue on database programming paradigms
A LISP garbage-collector for virtual-memory computer systems

Communications of the ACM
Categorical multi-combinators

Proceedings of the Functional Programming Languages and Computer Architecture

Editorial message: special track on the programming languages

Proceedings of the 2004 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

μ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.