Programmable Rewriting Strategies in Haskell | Zendy

Ralf Lämmel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Programmable Rewriting Strategies in Haskell

Author(s) -

Ralf Lämmel

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.11.021

Subject(s) - haskell , rewriting , programming language , functional programming , computer science , combinatory logic , generic programming , functional reactive programming , programmer , functional logic programming , programming paradigm , inductive programming

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research