Abstract
This chapter describes the transformation language TrafoLa-H of the PROSPECTRA system. It supports the definition of tree transformations as well as of transformation strategies. TrafoLaH is mainly a functional language. Tree transformations are specified by first-order functions, whereas strategies may be defined by functions of higher order.
The first sections of this chapter define the constructs of TrafoLa-H by a simple denotational semantics, and illustrate them by many examples. The description is focused on the particularly powerful patterns of TrafoLa-H. The most advanced pattern operator allows to match and extract specific subtrees at arbitrary depth.
Then the type system of the language is described. It is derived from a conventional Hindley-Milner type system, but is more complex due to the operations of tree extraction and insertion. The chapter is concluded by a summary of the concrete syntax and the predefined system functions.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Heckmann, R., Sander, G. (1993). TrafoLa-H reference manual. In: Hoffmann, B., Krieg-Brückner, B. (eds) Program Development by Specification and Transformation. Lecture Notes in Computer Science, vol 680. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56733-X_154
Download citation
DOI: https://doi.org/10.1007/3-540-56733-X_154
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56733-2
Online ISBN: 978-3-540-47639-9
eBook Packages: Springer Book Archive