267 search results - page 44 / 54 » Formal Parametric Polymorphism |
105
click to vote
JMLR
2012
13 years 2 months ago
2012
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
146
click to vote
TLDI
2010
ACM
15 years 8 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
SAS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
SAS
2010
Springer
14 years 10 months ago
2010
Springer
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
170
click to vote
POPL
2008
ACM
15 years 12 months ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...