797 search results - page 43 / 160 » Eliminating Proofs from Programs |
129
click to vote
ICFP
2005
ACM
16 years 21 days ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
109
click to vote
FUIN
2006
15 years 22 days ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
125
Voted
POPL
1999
ACM
15 years 5 months ago
1999
ACM
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, ...
111
click to vote
STOC
1999
ACM
15 years 5 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
105
Voted
MICS
2010
14 years 11 months ago
2010
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...