Lacking support for generic traversal, functional programming languages suffer from a scalability problem when applied to largescale program transformation problems. As a solution, we introduce functional strategies: typeful generic functions that not only can be applied to terms of any type, but which also allow generic traversal into subterms. We show how strategies are modelled inside a functional language, and we present a combinator library including generic traversal combinators. We illustrate our technique of programming with functional strategies by an implementation of the extract method refactoring for Java.
CITATION STYLE
Lämmel, R., & Visser, J. (2002). Typed Combinators for Generic Traversal. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2257, pp. 137–154). Springer Verlag. https://doi.org/10.1007/3-540-45587-6_10
Mendeley helps you to discover research relevant for your work.