Loading...
Please wait, while we are loading the content...
Similar Documents
Type Checking Type Classes (1993)
| Content Provider | CiteSeerX |
|---|---|
| Author | Nipkow, Tobias Prehofer, Christian |
| Description | 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 by introducing 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 syntactic unification with constraint solving. The existence of principal types follows from an analysis of this unification algorithm. |
| File Format | |
| Language | English |
| Publisher | ACM Press |
| Publisher Date | 1993-01-01 |
| Publisher Institution | IN PROC. 20TH ACM SYMP. PRINCIPLES OF PROGRAMMING LANGUAGES |
| Access Restriction | Open |
| Subject Keyword | Syntactic Unification Functional Programming Language Haskell Type Variable Typing Judgement Type Inference Problem Type Inference System Unification Algorithm Principal Type New Unification Algorithm Type Class Separate Context Ml-style Polymorphism |
| Content Type | Text |
| Resource Type | Article |
