Program Transformation By Proof in Constructive Framework (1991)
| Venue: | In Informatika '91, Theoretical Computer Science and Methods of Compilation and Program Construction |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Galmiche91programtransformation,
author = {D. Galmiche and Crin Inria Lorraine},
title = {Program Transformation By Proof in Constructive Framework},
booktitle = {In Informatika '91, Theoretical Computer Science and Methods of Compilation and Program Construction},
year = {1991}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper aims at presenting the notion of program transformation by proof in type theory and programming with proofs framework. In such framework, programs obtained from proofs are not always efficient and the relationships between programs and good proofs have to be studied. Automatic synthesis and verification of programs have been tackled in the constructive type theory and we are interested by the transformational approach, with some degree of automation, in such a framework. We present some techniques of proof and program transformation using proof synthesis information. A strategy of generalization by abstraction of terms is presented, with a view to deriving by constructive proofs new program versions, and we analyze the connections with data modifications and induction choices. 1 Introduction The derivation of correct and efficient programs from formal specifications can be considered in different ways. An important one consists in using the transformation technique which is...
