3552 search results - page 151 / 711 » Proof theory in the abstract |
153
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...
172
click to vote
MEMOCODE
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Theory propagation in Satisfiability Modulo Theories is crucial for the solver's performance. It is important, however, to pay particular care to the amount of deduc...
175
click to vote
BIRTHDAY
2007
Springer
16 years 18 days ago
2007
Springer
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...
142
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...
156
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...