4211 search results - page 161 / 843 » Types as Abstract Interpretations |
118
click to vote
CSL
2004
Springer
15 years 9 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...
153
Voted
ICFP
2005
ACM
16 years 3 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...
231
Voted
POPL
2005
ACM
16 years 4 months ago
2005
ACM
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
125
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
142
click to vote
POPL
1997
ACM
15 years 8 months ago
1997
ACM
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...