46 search results - page 2 / 10 » Synthesizing Proofs from Programs in the Calculus of Inducti... |
KBSE
1997
IEEE
13 years 10 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...
CSL
2007
Springer
14 years 6 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
TAPSOFT
1987
Springer
13 years 9 months ago
1987
Springer
The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin...
ENTCS
2006
13 years 6 months ago
2006
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
AAAI
1990
13 years 7 months ago
1990
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the g...