80 search results - page 4 / 16 » Program Extraction from Normalization Proofs |
105
click to vote
TLCA
2009
Springer
15 years 7 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
106
click to vote
KBSE
1997
IEEE
15 years 5 months ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
108
click to vote
CIE
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
107
click to vote
SLP
1993
15 years 2 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
135
click to vote
LOPSTR
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...