Add to ORKGIt is well known that it is undecidable in general whether a given program meets its speci cation. In contrast, it can be checked easily by a machine whether a formal proof is correct, and from a constructive proof one can automatically extract a corresponding program, which by its very construction is correct as well. This { at least in principle
The objective of this paper is to provide a theoretical foundation for program extraction from proof...
I Proofs may have computational content. I Programs extracted from proofs cannot go wrong. I Proofs ...
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a ...
In this paper we describe our protocol for the interaction between a theory and the programs extract...
It is well known that mathematical proofs often contain (abstract) algorithms, but although these al...
AbstractMathematical proofs often implicity contain constructions of objects with certain properties...
AbstractWe present a new method to extract from a classical proof of ∀x(I[x]→∃y(O[y]∧S[x,y])) a prog...
In this paper we describe a new protocol that we call the Curry-Howard protocol between a theory and...
Since the work of Brouwer, Kolmogorov, Goedel, Kleene and many others we know that constructive proo...
In this paper we describe our system for automatically extracting "correct" programs from proofs usi...
1 Introduction Several approaches can be used for certifying software. A first one, perhaps the most...
AbstractIt is well-known that a constructive proof of a Π20 formula F written as a λ-term via Curry-...
Abstract. In this paper we describe a new protocol that we call the Curry-Howard protocol between a ...
The topic of this thesis is the extraction of efficient and readable programs from formal constructi...
This paper presents how to automatically prove that an "optimized " program is correct wit...
The objective of this paper is to provide a theoretical foundation for program extraction from proof...
I Proofs may have computational content. I Programs extracted from proofs cannot go wrong. I Proofs ...
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a ...
In this paper we describe our protocol for the interaction between a theory and the programs extract...
It is well known that mathematical proofs often contain (abstract) algorithms, but although these al...
AbstractMathematical proofs often implicity contain constructions of objects with certain properties...
AbstractWe present a new method to extract from a classical proof of ∀x(I[x]→∃y(O[y]∧S[x,y])) a prog...
In this paper we describe a new protocol that we call the Curry-Howard protocol between a theory and...
Since the work of Brouwer, Kolmogorov, Goedel, Kleene and many others we know that constructive proo...
In this paper we describe our system for automatically extracting "correct" programs from proofs usi...
1 Introduction Several approaches can be used for certifying software. A first one, perhaps the most...
AbstractIt is well-known that a constructive proof of a Π20 formula F written as a λ-term via Curry-...
Abstract. In this paper we describe a new protocol that we call the Curry-Howard protocol between a ...
The topic of this thesis is the extraction of efficient and readable programs from formal constructi...
This paper presents how to automatically prove that an "optimized " program is correct wit...
The objective of this paper is to provide a theoretical foundation for program extraction from proof...
I Proofs may have computational content. I Programs extracted from proofs cannot go wrong. I Proofs ...
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a ...