A functional language for the specification of complex tree transformations

Abstract

emaih heckmann % sbsvax.uucp@ germany,csnet A B S T R A C TTransformations of trees and rewriting of terms can be found in various settings e.g. transformations of abstract syntax trees in compiler construction and program synthesis.A language is proposed combining features of a general purpose functional language with special means to specify tree transformations. Atomic transformations are considered first order functions and described by pattern matching. The pattern specification language allows for partitioning trees by arbitrary vertical and horizontal cuts. This goes beyond what is possible in similar languages [2,13,14]. High order functions and functional combinators are used to express strategies for the controlled application of transformations.

Program transformations using temporal logic side conditions

“…OPTRAN is also based on rewriting, but it offers far more sophisticated pattern matching facilities [Lipps et al 1988]. TrafoLa is another system able to specify sophisticated syntactic program patterns [Heckmann 1988]. The Glasgow Haskell compiler allows the programmer to add pragmas to code which allow extra rewrites to be performed on the program during the compilation process [Jones et al 2001].…”

Algebraic specification and functionals for transformational program and meta program development

“…PCTE), will ensure portability of the system as well as of the newly developed Ada software. A brief overview of the system can be found in [1]; see also [9][10][11].…”

“…In this case, an abstract type schema to define Abstract Syntax is predefined, and translation to an internal applicative tree manipulation language is automatic. Work on a more powerful language with higher order matching and functionals is going on [11]. Various development strategies such as foldunfold, variable abstraction, finite differencing, rewriting, narrowing and unification with a set of equations interpreted as rewrite rules, etc.…”