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 ...
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...
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 ...
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...
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...
Mads Torgersen, Christian Plesner Hansen, Erik Ern...