Abstractions for Transformations

Eelco Visser

20 years ago I presented the paper “Building program optimizers with rewriting strategies” at ICFP 1998. The paper described the design of a language for program transformation based term rewriting with rewriting strategies that can be defined using a set of combinators. The language was later named Stratego.

Currently we are considering designing a next generation transformation language. After the seminar at 13:30 we have a first session to discuss requirements for such a language. You are welcome to join.

In this talk, I summarize the key ideas of the design and implementation of Stratego, and I discuss the requirements that never made it from the wish list into the language.

---

Previous: Hendrik van Antwerpen | Scopes as Types
Next: Peter Mosses | Language specification using funcons