(Enter summary)
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 ... (Update)
Cited by: More
Compiling Polymorphism Using Intensional Type - Analysis Robert Harper
(Correct)
Compiling with Non-Parametric Polymorphism - Preliminary Report Robert
(Correct)
Guarded Recursive Datatype Constructors - Xi, Chen, Chen (2003)
(Correct)
Active bibliography (related documents): More All
0.3: "Activation" of LINCKS - Adding an Active Aspect - Sjölin (1994)
(Correct)
0.3: A Characterization Framework for Software Deployment .. - Carzaniga.. (1998)
(Correct)
0.1: Fixing Some Space Leaks without a Garbage Collector - Sparud (1993)
(Correct)
Similar documents based on text: More All
0.1: Partial Evaluation in Aircraft Crew Planning - Augustsson (1997)
(Correct)
0.1: Semantics of pH: A parallel dialect of Haskell - Aditya, Arvind, Maessen (1995)
(Correct)
0.1: An exercise in dependent types: A well-typed interpreter - Augustsson, Carlsson (1999)
(Correct)
Related documents from co-citation: More All
14: How to make adhoc polymorphism less ad-hoc
- Wadler, Blott - 1989
11: The glasgow Haskell compiler: a technical overview
- Jones, Hall et al. - 1993
10: Principal type schemes for functional programs (context) - Damas, Milner - 1982
BibTeX entry: (Update)
Augustsson, L. 1993. Implementing Haskell overloading. In the Conference on Functional Programming Languages and Computer Architecture. ACM, New York, 65--73. http://citeseer.ist.psu.edu/augustsson93implementing.html More
@inproceedings{ augustsson93implementing,
author = "Lennart Augustsson",
title = "Implementing Haskell Overloading",
booktitle = "Functional Programming Languages and Computer Architecture",
pages = "65-73",
year = "1993",
url = "citeseer.ist.psu.edu/augustsson93implementing.html" }
Citations (may not include all citations):
190
How to make ad hoc polymorphism less ad hoc
- Wadler, Blott - 1989
183
Report on the Programming Language Haskell: A Non-Strict (context) - Hudak - 1992
121
Efficient Implementation of the Smalltalk-80 System
- Deutsch, Schiffman - 1984
81
an Optimizing Compiler for Object Oriented Programming Langu.. (context) - Chambers, Implementation et al. - 1993
69
Compiling Lazy Functional Languages (context) - Johnsson - 1987
64
The Chalmers Lazy-ML Compiler (context) - Augustsson, Johnsson - 1989
33
Reference Manual (context) - Stroustrup
31
Benchmarking implementations of lazy functional languages
- Hartel, Langendoen - 1993
28
Parametric overloading in polymorphic programming languages (context) - Kaes - 1988
26
Generating efficient code for lazy functional languages
- Smetsers, Nocker et al. - 1991
13
Programming Methodology Group (context) - Augustsson, Manual - 1993
3
Department of Computer Science (context) - Hall, Hammond et al. - 1992
1
A new approach to the implementation of type classes (context) - Jones
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.diku.dk/students/turtle/bibliography.html): More
Higher-Order Minimal Function Graphs - Jones, Rosendahl (1997)
(Correct)
A Guide for New Referees in Theoretical Computer Science - Ian Parberry (1989)
(Correct)
The FISh language definition - Jay (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC