Paper Info
Title
Type Inference for Overloading without Restrictions, Declarations or Annotations
Abstract
. This article presents a type system based on the DamasMilnersystem[DM82], that supports overloading. Types of overloadedsymbols are constrained polymorphic types. The work is related to Haskelltype classes[Wad89,NP93,HHJW96], System O[OWW95] and other similartype systems[Kae88,Smi91,Jon94,DCO96]. Restrictions imposed inthese systems with respect to overloading are eliminated. User-definedglobal and local overloading is supported without restrictions. There isno need for...
Year
DOI
Venue
1999
10.1007/10705424_3
Fuji International Symposium on Functional and Logic Programming
Keywords
Field
DocType
type inference,type system,polymorphism
Programming language,Computer science,Language construct,Ad hoc polymorphism,sort,Algorithm,Type inference,Theoretical computer science,Haskell,Type variable,Ambiguity,Rule of inference
Conference
Volume
ISSN
ISBN
1722
0302-9743
3-540-66677-X
Citations 
PageRank 
References 
7
0.70
11
Authors
2
Name
Order
Citations
PageRank
Carlos Camarão1175.74
Lucília Figueiredo2154.33