Implementing Haskell overloading

Implementing Haskell overloading (1993)

by Lennart Augustsson

Venue:	In Functional Programming Languages and Computer Architecture
Citations:	44 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Implementing Haskell overloading	SVM HeaderParse 0.1
AUTHOR NAME	Lennart Augustsson	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Sciences; Chalmers University of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	S-412 96 Goteborg, Sweden	SVM HeaderParse 0.1
ABSTRACT	Haskell overloading poses new challenges for compiler writers. Until recently there have been no implementations of it which have had acceptable performance; users have been adviced to avoid it by using explicit type signatures. This is unfortunate since it does not promote the reusability of software components that overloading really offers. In this paper we describe a number of ways to improve the speed of Haskell overloading. None of the techniques described here is particularly exciting or complicated, but taken together they may give an order of magnitude speedup for some programs using overloading. The techniques fall into two categories: speeding up overloading, and avoiding overloading altogether. For the second kind we borrow some techniques from partial evaluation. There does not seem to be a single implementation technique which is a panacea; but a number of different ones have to be put together to get decent performance. 1 Introduction Haskell, [Hud92], introduces a new ...	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	In Functional Programming Languages and Computer Architecture	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	65--73	INFERENCE
CITATIONS	10 found	ParsCit 1.0