The significant intellectual cost of programming is for problem solving and explaining and not for coding. Yet, programming systems offer mechanical assistance exclusively with the coding process. Here we describe an implemented program development system, called PRL ("pearl"), that provides automated assistance with the hard part. The program and its explanation are seen as formal objects in a constructive logic of the data domains. These formal explanations can be executed at various stages of completion. The most incomplete explanations resemble applicative programs, the most complete are formal proofs
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
this paper is to investigate the impact on the design of a programming language of tight integration...
International audienceSoftware development usually involves a collection of properties, programs and...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
When we learn mathematics, we learn more than definitions and theorems. We learn techniques of proo...
The PRL ("pearl") system is an environment providing computer assistance in the construction of for...
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a ...
Since the work of Brouwer, Kolmogorov, Goedel, Kleene and many others we know that constructive proo...
One point made here is that formal constructive mathematics can be interpreted as a "high-level" pro...
Today highly nontrivial mathematics is routinely being encoded in the computer, ensuring a reliabil-...
International audienceWe will present our ongoing work on a new proof assistant and deduction system...
International audienceWe will present our ongoing work on a new proof assistant and deduction system...
Whereas early researchers in computability theory described effective computability in terms of such...
Existing attempts towards including formal methods in in-troductory programming courses focus on int...
Proof assistants are now widely used in the field of pro-gramming languages research to reason forma...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
this paper is to investigate the impact on the design of a programming language of tight integration...
International audienceSoftware development usually involves a collection of properties, programs and...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
When we learn mathematics, we learn more than definitions and theorems. We learn techniques of proo...
The PRL ("pearl") system is an environment providing computer assistance in the construction of for...
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a ...
Since the work of Brouwer, Kolmogorov, Goedel, Kleene and many others we know that constructive proo...
One point made here is that formal constructive mathematics can be interpreted as a "high-level" pro...
Today highly nontrivial mathematics is routinely being encoded in the computer, ensuring a reliabil-...
International audienceWe will present our ongoing work on a new proof assistant and deduction system...
International audienceWe will present our ongoing work on a new proof assistant and deduction system...
Whereas early researchers in computability theory described effective computability in terms of such...
Existing attempts towards including formal methods in in-troductory programming courses focus on int...
Proof assistants are now widely used in the field of pro-gramming languages research to reason forma...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
this paper is to investigate the impact on the design of a programming language of tight integration...
International audienceSoftware development usually involves a collection of properties, programs and...