Sciweavers

80 search results - page 2 / 16
» Program Extraction from Normalization Proofs
Sort
View
PPDP
2009
Springer
13 years 10 months ago
Context-based proofs of termination for typed delimited-control operators
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...
Malgorzata Biernacka, Dariusz Biernacki
EUROCAST
2005
Springer
97views Hardware» more  EUROCAST 2005»
13 years 10 months ago
Extracting Computer Algebra Programs from Statements
In this paper, an approach to synthesize correct programs from specifications is presented. The idea is to extract code from definitions appearing in statements which have been me...
Jesús Aransay, Clemens Ballarin, Julio Rubi...
TPHOL
2003
IEEE
13 years 10 months ago
Program Extraction from Large Proof Developments
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
Luís Cruz-Filipe, Bas Spitters
LCC
1994
200views Algorithms» more  LCC 1994»
13 years 9 months ago
Program Extraction from Classical Proofs
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 ...
Ulrich Berger, Helmut Schwichtenberg
ENTCS
2006
153views more  ENTCS 2006»
13 years 5 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu