SKIL: A System for Programming with Proofs (1993) [2 citations — 2 self]
Abstract:
Introduction SKIL (Synthesizing Knowledge in Intuitionistic Logic) is an interactive theorem prover dedicated to program synthesis and implemented in Quintus-Prolog. The object-level logic is a second-order constructive logic denoted AF2 which includes induction through the data type deønitions [3]. Since the object-level is constructive, terms of -calculus are constructed during the proof search. These extracted terms are programs following the programming with proofs paradigm, having the two properties of correctness and termination [3]. That is, the system is in fact a program synthesis environment, since a speciøcation can be regarded as a proposition and its extracted term as a program which meets this speciøcation. 2 Programming in AF2 In this framework, the program construction is broken down in three main steps: 1) The ørst step consists in expressing data types in the outlined logic. For instance, to deø
Citations
| 240 | The use of explicit plans to guide inductive proofs – Bundy - 1988 |
| 35 | Recursive programming with proofs – Parigot - 1992 |
| 5 | ProPre, a programming language with proofs – Manoury, Parigot, et al. - 1992 |
| 2 | Automated proof and program development – Galmiche, Hermann - 1992 |

