62 search results - page 7 / 13 » Lightweight Family Polymorphism |
SDM
2003
SIAM
13 years 10 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 ...
ENTCS
2000
13 years 8 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...
AISC
1992
Springer
14 years 20 days 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 ...
CSMR
2004
IEEE
14 years 9 days 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
14 years 2 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...