(Enter summary)
Abstract: We study the type inference problem for a system with
type classes as in the functional programming language
Haskell. Type classes are an extension of ML-style
polymorphism with overloading. We generalize Milner's
work on polymorphism byintroducing a separate context
constraining the type variables in a typing judgement.
This leads to simple type inference systems and
algorithms which closely resemble those for ML. In particular
we present a new unification algorithm which
is an extension of... (Update)
Context of citations to this paper: More
...classes can inherit operations from existing superclasses. We do not consider superclasses here because they can be expanded to sets of classes [5, 39]. 3. PRELIMINARIES A ranked alphabet is a finite set of symbols with associated arities. Let further be a set of variables....
.... to the members of a particular class (or classes) A number of works have tried to explain type inference for Haskell from first principles [28, 29]. Subsequently, further extensions have been investigated. In his thesis [13] Jones has investigated qualified types. Qualified...
Cited by: More
The Semantics of Spectrum - Radu Grosu And (1994)
(Correct)
The Logical Framework of - Radu Grosu Franz
(Correct)
Isabelle/Isar - a versatile environment for human-readable formal .. - Wenzel (2002)
(Correct)
Similar documents (at the sentence level):
75.9%: Type Checking Type Classes - Nipkow, Prehofer (1993)
(Correct)
31.7%: Type Reconstruction for Type Classes - Nipkow, Prehofer (1993)
(Correct)
Active bibliography (related documents): More All
0.1: Exploring the Design Space for Type-based Implicit Parameterization - Jones (1999)
(Correct)
0.1: Type Classes with Functional Dependencies - Jones (2000)
(Correct)
0.0: ML typing, explicit polymorphism and qualified types - Jones (1994)
(Correct)
Similar documents based on text: More All
0.3: Type classes in Haskell - Hall, Hammond, Jones, Wadler (1996)
(Correct)
0.3: Interpreter Verification for a Functional Language - Broy, Hinkel, Nipkow.. (1994)
(Correct)
0.3: Higher-Order Equational Logic - Prehofer (1997)
(Correct)
Related documents from co-citation: More All
16: How to make adhoc polymorphism less ad-hoc
- Wadler, Blott - 1989
15: Principal type schemes for functional programs (context) - Damas, Milner - 1982
14: A theory of type polymorphism in programming (context) - Milner - 1978
BibTeX entry: (Update)
Tobias Nipkow and Christian Prehofer. Type checking type classes. POPL, pages 409--418, 1993. http://citeseer.ist.psu.edu/nipkow93type.html More
@inproceedings{ nipkow93type,
author = "Tobias Nipkow and Christian Prehofer",
title = "Type Checking Type Classes",
booktitle = "Conference Record of the Twentieth Annual {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages",
address = "Charleston, South Carolina",
pages = "409--418",
year = "1993",
url = "citeseer.ist.psu.edu/nipkow93type.html" }
Citations (may not include all citations):
343
Principal type schemes for functional programs (context) - Damas, Milner - 1982
95
Hope: an experimental applicative language
- Burstall, MacQueen et al. - 1980
39
A simple applicative language: Mini-ML (context) - Cl'ement, Despeyroux et al. - 1986
32
Parametric type classes (context) - Chen, Hudak et al. - 1992
14
An approach to overloading with polymorphism (context) - Blott - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www4.in.tum.de/publ/papers/): More
The Amsterdam Manifesto on OCL - Cook, Kleppe, Mitchell, Rumpe.. (1999)
(Correct)
Structured Specifications and Implementation of.. - Walicki, Broy (1995)
(Correct)
Modeling Dynamic Component Interfaces - Huber, Rausch, Rumpe (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