Implementing Haskell overloading
- 1 July 1993
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
Haskell overloading poses new challenges for compiler writers.Until recently there have been no implementations ofit which have had acceptable performance; users have beenadviced to avoid it by using explicit type signatures. Thisis unfortunate since it does not promote the reusability ofsoftware components that overloading really offers.In this paper we describe a number of ways to improvethe speed of Haskell overloading. None of the techniquesdescribed here is particularly exciting or ...Keywords
This publication has 6 references indexed in Scilit:
- Benchmarking implementations of lazy functional languagesPublished by Association for Computing Machinery (ACM) ,1993
- Report on the programming language HaskellACM SIGPLAN Notices, 1992
- How to make ad-hoc polymorphism less ad hocPublished by Association for Computing Machinery (ACM) ,1989
- The spineless tagless G-machinePublished by Association for Computing Machinery (ACM) ,1989
- The Chalmers Lazy-ML CompilerThe Computer Journal, 1989
- Efficient implementation of the smalltalk-80 systemPublished by Association for Computing Machinery (ACM) ,1984