13383 search results - page 34 / 2677 » Abstractions from proofs |
LCC
1994
14 years 2 months ago
1994
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...
LICS
2003
IEEE
14 years 3 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
FAC
2008
13 years 10 months ago
2008
A development of the Mondex system was undertaken using Event-B and its associated proof tools. mental approach was used whereby the refinement between the abstract specification o...
CSL
2010
Springer
13 years 11 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...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...