Type Classes With More Higher-Order Polymorphism

Type Classes With More Higher-Order Polymorphism (2002)

by Matthias Neubauer , Peter Thiemann

Venue:	In ACM SIGPLAN International Conference on Functional Programming
Citations:	4 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Type Classes With More Higher-Order Polymorphism	user correction - Legacy Corrections
AUTHOR NAME	Matthias Neubauer	user correction - Legacy Corrections
AUTHOR AFFIL	Universit at Freiburg	user correction - Legacy Corrections
AUTHOR NAME	Peter Thiemann	user correction - Legacy Corrections
AUTHOR AFFIL	Universit at Freiburg	user correction - Legacy Corrections
ABSTRACT	We propose an extension of Haskell's type class system with lambda abstractions in the type language. Type inference for our extension relies on a novel constrained unification procedure called guided higher-order unification. This unification procedure is more general than Haskell's kind-preserving unification but less powerful than full higher-order unification.	user correction - Legacy Corrections
YEAR	2002	INFERENCE
VENUE	In ACM SIGPLAN International Conference on Functional Programming	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	179--190	INFERENCE
CITATIONS	18 found	ParsCit 1.0