TAMPR (Transformation Assisted Multiple Program Realisation System) is one of the earliest TransformationSystems around. TAMPR supports program transformation by means of rewrite rules. A set of rewrite rules is used to transform the abstract syntax tree of a program to canonical form by exhaustive application. A number of such canonicalizations can be combined by sequential composition. This sequential composition provides a simple mechanism for control over the application of rules. The system has been applied to the derivation of a number of numerical software packages, including LINPACK.
Keywords for this software
References in zbMATH (referenced in 9 articles , 1 standard article )
Showing results 1 to 9 of 9.
- Tate, Ross; Stepp, Michael; Tatlock, Zachary; Lerner, Sorin: Equality saturation: a new approach to optimization (2011)
- Bagge, Anya Helene; Haveraaen, Magne: Axiom-based transformations: optimisation and testing (2009)
- Bravenboer, Martin; van Dam, Arthur; Olmos, Karina; Visser, Eelco: Program transformation with scoped dynamic rewrite rules (2006)
- Visser, Eelco: A survey of strategies in rule-based program transformation systems (2005)
- Winter, Victor L.: Strategy construction in the higher-order framework of TL. (2005)
- Bagge, Otto Skrove; Haveraaen, Magne: Domain-specific optimisation with user-defined rules in codeboost. (2003)
- Visser, Eelco: A survey of strategies in program transformation systems. (2001)
- Visser, Eelco: Scoped dynamic rewrite rules. (2001)
- Boyle, James M.; Harmer, Terence J.; Winter, Victor L.: The TAMPR program transformation system: Simplifying the development of numerical software (1997)