3738 search results - page 305 / 748 » Parametrized Logic Programming |
134
click to vote
APLAS
2008
ACM
15 years 6 months ago
2008
ACM
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
142
click to vote
FLOPS
2008
Springer
15 years 5 months ago
2008
Springer
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
123
click to vote
ENTCS
2007
15 years 4 months ago
2007
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
156
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
141
click to vote
JMLR
2012
13 years 6 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...