378 search results - page 28 / 76 » Proof interpretations with truth |
166
Voted
ICFP
1997
ACM
15 years 6 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
105
Voted
TIP
2011
14 years 8 months ago
2011
—Recently, in a previous work, we proposed a way to bound how well any given image can be denoised. The bound was computed directly from the noise-free image that was assumed to ...
109
click to vote
SLP
1993
15 years 3 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
111
Voted
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
119
Voted
CSL
2010
Springer
15 years 2 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...