117 search results - page 2 / 24 » Program Extraction from Classical Proofs |
APAL
2005
13 years 7 months ago
2005
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. We show how to extract existential witnesses from classical proofs using Krivine’s classical realizability—where classical proofs are interpreted as λ-terms with the...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
ENTCS
2006
13 years 7 months ago
2006
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
EUROCAST
2005
Springer
14 years 1 months ago
2005
Springer
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...