Results 1 
5 of
5
Marking techniques for extraction
, 1995
"... Constructive logic can be used to consider program speci cations as logical formulas. The advantage of this approach is to generate programs which are certi ed with respect to some given speci cations. The programs created in such away are not e cient because they may contain large parts with no com ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Constructive logic can be used to consider program speci cations as logical formulas. The advantage of this approach is to generate programs which are certi ed with respect to some given speci cations. The programs created in such away are not e cient because they may contain large parts with no computational meaning. The elimination of these parts is an important issue. Many attempts to solve this problem have been already done. We call this extracting procedure. In this work we present anewway to understand the extraction problem. This is the marking technique. This new point of view enables us, thanks to a high abstraction level, to unify what was previously done on the subject. It enables also to extend to higher{order languages some pruning techniques developed by Berardi and Boerio, which were only used in rst and second order language.
The Specialization and Transformation of Constructive Existence Proofs
 PROCEEDINGS OF THE ELEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTI INTELLIGENCE
, 1989
"... The transformation of constructive program synthesis proofs is discussed and compared with the more traditional approaches to program transformation. An example system for adapting programs to special situations by transforming constructive synthesis proofs has been reconstructed and is compared wit ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The transformation of constructive program synthesis proofs is discussed and compared with the more traditional approaches to program transformation. An example system for adapting programs to special situations by transforming constructive synthesis proofs has been reconstructed and is compared with the original implementation [Goad 80]. A brief account of more general proof transformation applications is also presented. The overall moral is that constructiveexistence proofs contain more information over and above that required for simple execution and that this can be exploited by a proof transformation system.
The Use of Proof Plans for Transformation of Functional Programs by Changes of Data Type
, 1996
"... Program transformation concerns the derivation of an efficient program by applying correctnesspreserving manipulations to a source program. Transformation is a lengthy process, and it is important to keep user interaction to a manageable level by automating the transformation steps. In this thesis ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Program transformation concerns the derivation of an efficient program by applying correctnesspreserving manipulations to a source program. Transformation is a lengthy process, and it is important to keep user interaction to a manageable level by automating the transformation steps. In this thesis I present an automated technique for transforming a program by changing the data types in that program to ones which are more appropriate for the task. Programs are constructed by proving synthesis theorems in the proofsasprograms paradigm. Programs are transformed by modifying their synthesis theorems and relating the modified theorem to the original. Proof transformation allows more powerful transformations than program transformation because the proof of the modified theorem yields a program which meets the original specification, but may compute a different function to the original program. Synthesis proofs contain information which is not present in the corresponding program and can ...
The Specialization of Constructive Existence Proofs
, 1993
"... This paper contains a discussion, and reconstruction, of Goad's proof transformation system. Information contained in constructive existence proofs, which goes beyond that needed for simple execution, is exploited in the adaption of algorithms to special situations. Goad's system is reconstructed, ..."
Abstract
 Add to MetaCart
This paper contains a discussion, and reconstruction, of Goad's proof transformation system. Information contained in constructive existence proofs, which goes beyond that needed for simple execution, is exploited in the adaption of algorithms to special situations. Goad's system is reconstructed, and extended, in the Oyster proof refinement environment and subjected to test on a number of examples. Differences in methodology between Goad's system and the reconstruction are discussed. In particular, a more active role is given to the actual proof, as opposed to the extracted algorithm, in the transformation process.