(eng) Constructive logic can be used to consider program specifications as logical formulas. The advantage of this approach is to generate programs which are certified with respect to some given specifications. The programs created in such a way are not efficient 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 a new way 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 lan...
This paper outlines the author’s experiences using the methodology of program extraction within a pr...
Ten methodologies for automatic program construction are presented, discussed and compared. Some of ...
The Coq proof assistant mechanically checks the consistency of the logical reasoning in a proof. It ...
Constructive logic can be used to consider program specifications as logical formulas. The advantage...
This work concerns the generation of programs which are certifiedto be correct by construction. Thes...
The Theory of Specifications is an extension of the Calculus of Constructions where the specificatio...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
Automatic understanding of the intended meaning of computer programs is a very hard problem, requiri...
Nous étudions ici la génération de programmes certifiés corrects par construction. Ces programmes so...
1 Introduction Several approaches can be used for certifying software. A first one, perhaps the most...
The present thesis compares two computational interpretations of non-constructive proofs: refined A-...
This paper describes the experience of researchers at the University of Naples, over many years, in ...
Program specialization is a program transformation methodology which improves program efficiency by ...
Program comprehension is an essential part of software maintenance. As software systems are becoming...
. We revisit the main techniques of program transformation which are used in partial evaluation, mix...
This paper outlines the author’s experiences using the methodology of program extraction within a pr...
Ten methodologies for automatic program construction are presented, discussed and compared. Some of ...
The Coq proof assistant mechanically checks the consistency of the logical reasoning in a proof. It ...
Constructive logic can be used to consider program specifications as logical formulas. The advantage...
This work concerns the generation of programs which are certifiedto be correct by construction. Thes...
The Theory of Specifications is an extension of the Calculus of Constructions where the specificatio...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
Automatic understanding of the intended meaning of computer programs is a very hard problem, requiri...
Nous étudions ici la génération de programmes certifiés corrects par construction. Ces programmes so...
1 Introduction Several approaches can be used for certifying software. A first one, perhaps the most...
The present thesis compares two computational interpretations of non-constructive proofs: refined A-...
This paper describes the experience of researchers at the University of Naples, over many years, in ...
Program specialization is a program transformation methodology which improves program efficiency by ...
Program comprehension is an essential part of software maintenance. As software systems are becoming...
. We revisit the main techniques of program transformation which are used in partial evaluation, mix...
This paper outlines the author’s experiences using the methodology of program extraction within a pr...
Ten methodologies for automatic program construction are presented, discussed and compared. Some of ...
The Coq proof assistant mechanically checks the consistency of the logical reasoning in a proof. It ...