62 search results - page 7 / 13 » Lightweight Family Polymorphism |
111
click to vote
SDM
2003
SIAM
15 years 1 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
71
Voted
ENTCS
2000
14 years 11 months ago
2000
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
113
click to vote
AISC
1992
Springer
15 years 3 months ago
1992
Springer
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
110
click to vote
CSMR
2004
IEEE
15 years 3 months ago
2004
IEEE
Understanding the run-time behavior of object-oriented legacy systems is a complex task due to factors such as late binding and polymorphism. Current approaches extract and use in...
SAC
2004
ACM
15 years 5 months ago
2004
ACM
This paper describes wildcards, a new language construct designed to increase the flexibility of object-oriented type systems with parameterized classes. Based on the notion of v...