A Haskell Hosted DSL for Writing Transformation Systems

Authors:
Andy Gill
Affiliations:
Information Technology and Telecommunication Center, Department of Electrical Engineering and Computer Science, The University of Kansas, Lawrence KS 66045
Venue:
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Year:
2009

Citing 19
Cited 3

Monad transformers and modular interpreters

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type classes in Haskell

ACM Transactions on Programming Languages and Systems (TOPLAS)
Building program optimizers with rewriting strategies

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Domain specific embedded compilers

Proceedings of the 2nd conference on Domain-specific languages
Generalising monads to arrows

Science of Computer Programming - Special issue on mathematics of program construction
Template meta-programming for Haskell

Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Modern Compiler Implementation in Java

Modern Compiler Implementation in Java
Scrap your boilerplate: a practical design pattern for generic programming

Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Typed Combinators for Generic Traversal

PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Metacomputation-Based Compiler Architecture

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Monadic parsing in Haskell

Journal of Functional Programming
Associated type synonyms

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Introducing the Haskell equational reasoning assistant

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Program Transformation with Scoped Dynamic Rewrite Rules

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Constructing language processors with algebra combinators

GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Why it's nice to be quoted: quasiquoting for haskell

Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Language and program design for functional dependencies

Proceedings of the first ACM SIGPLAN symposium on Haskell
Rewriting Strategies in Java

Electronic Notes in Theoretical Computer Science (ENTCS)
The worker/wrapper transformation

Journal of Functional Programming

The HERMIT in the machine: a plugin for the interactive transformation of GHC core language programs

Proceedings of the 2012 Haskell Symposium
Optimizing SYB is easy!

Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
The HERMIT in the stream: fusing stream fusion's concatMap

Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

KURE is a Haskell hosted Domain Specific Language (DSL) for writing transformation systems based on rewrite strategies. When writing transformation systems, a significant amount of engineering effort goes into setting up plumbing to make sure that specific rewrite rules can fire. Systems like Stratego and Strafunski provide most of this plumbing as infrastructure, allowing the DSL user to focus on the rewrite rules. KURE is a strongly typed strategy control language in the tradition of Stratego and Strafunski. It is intended for writing reasonably efficient rewrite systems, makes use of type families to provide a delimited generic mechanism for tree rewriting, and provides support for efficient identity rewrite detection.