© 1989 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
An Optimising Compiler for a Modern Functional Language

1 Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA, 2 Yale University, Department of Computer Science, New Haven, CT 06520, USA, 3 Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA
One of the factor hindering the use of functional languages has been their relatively poor performance in comparison to more traditional languages such as C and Pascal. During the last decade tremendous progress has been made in building implementations of functional languages but the approaches adopted have employed specialist hardware and/or compiler optimisations that have been developed specifically for functional languages. Building specialist hardware may be the best long-term solution but in the short run it is possible to increase the use and acceptance of functional languages by exploiting the performance of commercially available machines. The goal of the project described in this paper has been to design an optimising compiler that produces fast code for functional languages on conventional sequential and parallel machines.
Received November 1988.
* Current address: Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA.
Current address: Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA.
¶ Yale University, Department of Computer Science, New Haven, CT 06520, USA