Programmable rewriting strategies in Haskell

--- White Paper ---

Author

Ralf Lämmel

Abstract

Programmable rewriting strategies provide a valuable tool for implementing traversal functionality in grammar-driven (or schema-driven) tools. The working Haskell programmer has access to programmable rewriting strategies via two similar options: (i) the Strafunski bundle for generic functional programming and language processing, and (ii) the "Scrap your boilerplate" approach to generic functional programming. Basic rewrite steps are encoded as monomorphic functions on datatypes. Rewriting strategies are polymorphic functions composed from appropriate basic strategy combinators.

We will briefly review programmable rewriting strategies in Haskell.
We will address the following questions:

• What are the merits of Haskellish strategies?
• What is the relation between strategic programming and generic programming?
• What are the challenges for future work on functional strategies?

Bibtex entry

@inproceedings{Laemmel04-WRS,
 author = "Ralf L{\"a}mmel",
 title = "{Programmable rewriting strategies in Haskell}",
 year = 2004,
 notes = "Invited paper;
          Proceedings of WRS 2004;
          13 pages; 
          To appear in ENTCS"
}

View paper

• [.ps]
• [.pdf]
• [.tex]
• [.html] (generated)