ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof theory
Journal of Symbolic Computation
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
On Specification Frameworks and Deductive Synthesis of Logic Programs
LOPSTR '94/META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic
Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs
LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
Classical Proofs as Programs: How, What, and Why
Constructivity in Computer Science, Summer Symposium
Proofs as Description of Computation
Proceedings of the 5th Conference on Automated Deduction
| Hi-index | 0.00 |
In this paper we propose a method for program synthesis from constructive proofs based on a particular proof strategy, we call dischargeable set construction. This proof-strategy allows to build proofs in which active patterns (sequences of application of rules with proper computational content) can be distinguished from correctness patterns (concerning correctness properties of the algorithm implicitly contained in the proof). The synthesis method associates with every active pattern of the proof a program schema (in an imperative language) translating only the computational content of the proof. One of the main features of our method is that it can be applied to a variety of theories formalizing ADT's and classes of ADT's. Here we will discuss the method and the computational content of some principles of particular interest in the context of some classes of ADT's.