Type Reconstruction for Type Classes

Type Reconstruction for Type Classes (1995)

by Tobias Nipkow , Christian Prehofer

Citations:

24 - 8 self

User correction supplied by mph

Datum	Value	Source
TITLE	Type Reconstruction for Type Classes	user correction - Legacy Corrections
AUTHOR NAME	Tobias Nipkow	user correction
AUTHOR AFFIL	4 Address: Institut fur Informatik, Technische Universitat Munchen, 80290 Munchen,	user correction
AUTHOR NAME	Christian Prehofer	user correction
AUTHOR AFFIL	4 Address: Institut fur Informatik, Technische Universitat Munchen, 80290 Munchen,	user correction
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 syntactic unification with constraint solving. The existence of principal types follows from an analysis of this unification algorithm.	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	16 found	ParsCit 1.0