by Peter Madden, Alan Bundy, Alan Smaill
http://dream.dai.ed.ac.uk/publications/98-00/604.ps
Add To MetaCart
Abstract:
The research described in this paper involved developing transformation techniques which increase the efficiency of the noriginal program, the source, by transforming its synthesis proof into one, the target, which yields a computationally more efficient algorithm. We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming inductive proofs. We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability and generality. 1
Citations
|
529
|
A transformation system for developing recursive programs
– Burstall, Darlington
- 1977
|
|
491
|
A Computational Logic
– Boyer, Moore
|
|
387
|
A Computational Logic Handbook
– Boyer, Mooer
- 1988
|
|
356
|
The formulas-as-types notion of construction
– Howard
- 1980
|
|
213
|
Constructive mathematics and computer programming
– Martin-Löf
- 1979
|
|
161
|
Rippling: A heuristic for guiding inductive proofs
– Bundy, Stevens, et al.
- 1993
|
|
152
|
R.Feys: Combinatory logic
– Curry
- 1958
|
|
130
|
On the evaluation of R systems
– ROBERTSON, HANCOCK-BEAULIEU
- 1992
|
|
105
|
A deductive approach to program synthesis
– Manna, Waldinger
- 1980
|
|
93
|
Experiments with proof plans for induction
– Bundy, Harmelen, et al.
- 1991
|
|
72
|
memo’ functions and machine learning
– Michie
- 1968
|
|
40
|
Automatic Methods for Program Transformation
– Chin
- 1990
|
|
33
|
An experimental program transformation and synthesis system
– Darlington
- 1981
|
|
27
|
Eliminating Redundant Recursive Calls
– Cohen
- 1983
|
|
26
|
A rational reconstruction and extension of recursion analysis
– Bundy, Harmelen, et al.
- 1989
|
|
14
|
A Functional Programming Environment Supporting Execution, Partial Evaluation and Transformation
– Darlington, Harrison, et al.
- 1989
|
|
13
|
A rational reconstruction of Boyer & Moore’s technique for constructing induction formulas
– Stevens
- 1988
|
|
11
|
A semantic approach to automatic program improvement
– Darlington
- 1972
|
|
9
|
Time Complexity of Programs in Type Theory
– Bjerner
- 1989
|
|
9
|
A Transformation System for Logic Programs which Preserves Equivalence
– Tamaki, Sato
- 1983
|
|
8
|
Extracting circuits from Constructive Proofs
– Basin
- 1991
|
|
6
|
A powerful strategy for deriving programs by transformation
– Pettorossi
- 1984
|
|
5
|
Automated Program Transformation Through Proof Transformation
– Madden
- 1991
|
|
3
|
The specialization and transformation of constructive existence proofs
– Madden
- 1989
|
|
2
|
The Use of Theorem Proving Techniques in Expert Systems for Configuration
– Lowe
- 1991
|
|
1
|
A NuPRL synthesis of several sorting algorithms: Towards an automatic program transformation system
– Madden
- 1987
|
|
1
|
Formal methods for automated program improvement
– Madden
- 1994
|
|
1
|
Linear to logarithmic optimization via proof transformation. Research paper MPI-I-94-240, Max-Planck-Institute fur Informatik
– Madden
- 1994
|
|
1
|
A transformation system for logic programs that preserves equivalence
– Tamaki, Sato
- 1984
|
|
1
|
Logical and recursive complexity
– Wainer
- 1990
|
