## The TAMPR Program Transformation System: Design and Applications (1997)

Venue: | Modern Software Tools for Scientific Computing, Birkhauser |

Citations: | 7 - 0 self |

### BibTeX

@INPROCEEDINGS{Boyle97thetampr,

author = {James Boyle and Terence J. Harmer and Victor L. Winter},

title = {The TAMPR Program Transformation System: Design and Applications},

booktitle = {Modern Software Tools for Scientific Computing, Birkhauser},

year = {1997},

pages = {.}

}

### Years of Citing Articles

### OpenURL

### Abstract

TAMPR is a fully automatic, rewrite-rule based program transformation system. From its initial implementation in 1970, TAMPR has evolved into a powerful tool for generating correct and efficient programs from specifications. The TAMPR approach to program transformation is distinguished by ffl A restricted repertoire of constructs for expressing transformations; ffl A declarative semantics for transformations; ffl Application of transformations to exhaustion; ffl An emphasis on sequences of canonical forms; ffl Completely automatic operation; and ffl The ability to effortlessly "replay" the application of transformations. We describe some of the applications of the TAMPR system, to document the power and practicality of its approach. We then discuss the TAMPR approach to program transformation. This approach manifests itself in TAMPR's high-level language for expressing transformations; we discuss some aspects of both the design of this language and the philosophy of transformatio...

### Citations

354 |
Three models for the description of language
- Chomsky
- 1956
(Show Context)
Citation Context ...roach to Program Transformation The idea and basic notation for TAMPR transformations came from Chomsky's transformational grammar, developed in the late 1950s for use in describing natural languages =-=[8]-=-. However, Chomsky's approach to transformational grammar was theoretical rather than practical. To make automated program transformation possible, TAMPR extended Chomsky's idea in three important way... |

31 |
Abstract Programming and program transformations { An approach to reusing programs
- Boyle
- 1989
(Show Context)
Citation Context ...ion, a promise that has remained unfulfilled for a quarter century. How close is it to being realized? We provide evidence that the TAMPR (Transformation Assisted Multiple Program Realization) System =-=[1, 5, 2]-=-, is beginning to fulfill major portions of the promise of program specification and transformation. The TAMPR program transformation system is distinguished by being fully automatic in operation. Man... |

15 |
A transformational component for programming languages grammar
- Boyle
- 1970
(Show Context)
Citation Context ...ion, a promise that has remained unfulfilled for a quarter century. How close is it to being realized? We provide evidence that the TAMPR (Transformation Assisted Multiple Program Realization) System =-=[1, 5, 2]-=-, is beginning to fulfill major portions of the promise of program specification and transformation. The TAMPR program transformation system is distinguished by being fully automatic in operation. Man... |

12 | The Automated Transformation of Abstract Specifications of Numerical Algorithms into Efficient
- Fitzpatrick, Harmer, et al.
- 1997
(Show Context)
Citation Context ...gorithm, and that for sequential computers (Sun) is again faster than the handwritten version. Deriving an efficient implementation of a parallel eigenvalue solver (POT) is a fourth TAMPR application =-=[4, 10, 11]-=-. For this derivation, we expressed the specification in the ML language. The derivation targets SIMD parallel machines, in particular, the AMT DAP-510 SIMD array processor. DAP programs are efficient... |

7 |
A Practical Functional Program for the CRAY
- Boyle, Harmer
- 1992
(Show Context)
Citation Context ...derive both sequential and parallel implementations from the same specification [2]. A third TAMPR application is the derivation of a program to solve hyperbolic partial differential equations (PDEs) =-=[7, 6]-=-. Hyperbolic PDEs arise in fluid flow problems involving shock, such as supersonic flow, traffic flow, and the breaking of waves on the beach. We started from a higher-order, pure-functional specifica... |

6 |
Deriving Sequential and Parallel Programs from Pure LISP Specifications by Program Transformation
- Boyle, Dritz, et al.
- 1987
(Show Context)
Citation Context ...ion, a promise that has remained unfulfilled for a quarter century. How close is it to being realized? We provide evidence that the TAMPR (Transformation Assisted Multiple Program Realization) System =-=[1, 5, 2]-=-, is beginning to fulfill major portions of the promise of program specification and transformation. The TAMPR program transformation system is distinguished by being fully automatic in operation. Man... |

6 |
Functional Specifications for Mathematical Computations, Constructing Programs from Specifications
- Boyle, Harmer
- 1991
(Show Context)
Citation Context ...derive both sequential and parallel implementations from the same specification [2]. A third TAMPR application is the derivation of a program to solve hyperbolic partial differential equations (PDEs) =-=[7, 6]-=-. Hyperbolic PDEs arise in fluid flow problems involving shock, such as supersonic flow, traffic flow, and the breaking of waves on the beach. We started from a higher-order, pure-functional specifica... |

5 |
Automatic, Self-adaptive Control of Unfold Transformations
- Boyle
- 1994
(Show Context)
Citation Context ...mated Transformation In this section we discuss an answer to the question: How can transformations be applied automatically? This discussion is necessarily very brief; further details can be found in =-=[3]-=-. The simplest approach to automating the application of program transformations is to let the program being transformed guide the application of the transformations. In this approach, the transformat... |

5 | The Construction of Numerical Mathematical Software for the AMT DAP by Program Transformation
- Boyle, Clint, et al.
- 1992
(Show Context)
Citation Context ...gorithm, and that for sequential computers (Sun) is again faster than the handwritten version. Deriving an efficient implementation of a parallel eigenvalue solver (POT) is a fourth TAMPR application =-=[4, 10, 11]-=-. For this derivation, we expressed the specification in the ML language. The derivation targets SIMD parallel machines, in particular, the AMT DAP-510 SIMD array processor. DAP programs are efficient... |

2 |
Efficient Implementations of General Sparse Matrices on Parallel Computers
- Fitzpatrick, Harmer, et al.
- 1994
(Show Context)
Citation Context ...gorithm, and that for sequential computers (Sun) is again faster than the handwritten version. Deriving an efficient implementation of a parallel eigenvalue solver (POT) is a fourth TAMPR application =-=[4, 10, 11]-=-. For this derivation, we expressed the specification in the ML language. The derivation targets SIMD parallel machines, in particular, the AMT DAP-510 SIMD array processor. DAP programs are efficient... |

2 |
Proving Refinement Transformations Using Extended Denotational Semantics
- Winter, Boyle
- 1996
(Show Context)
Citation Context ...f small transformations can be thought of as "factoring" the proof of correctness of a program into a large number of small, essential, and reusable steps. We discuss our proof methodology f=-=urther in [12]-=-. 11 6 Conclusion We have described the TAMPR program transformation system, some of its applications, and how efficient code can be generated from object-oriented specifications for such applications... |