429 search results - page 47 / 86 » Parameter-free polymorphic types |
CSL
2004
Springer
15 years 5 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
We propose union types for statically typed class-based objectoriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be con...
114
click to vote
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
SAS
2005
Springer
15 years 5 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
107
click to vote
TLCA
1993
Springer
15 years 3 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...