1818 search results - page 70 / 364 » Granularity-Adaptive Proof Presentation |
TYPES
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
ARITH
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval ...
TLCA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
PPDP
2009
Springer
14 years 1 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
CADE
2004
Springer
14 years 9 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...