|Maintainer||Niklas Broberg, email@example.com|
Functions for transforming abstract Haskell code extended with regular patterns into semantically equivalent normal abstract Haskell code. In other words, we transform away regular patterns.
Transform away occurences of regular patterns from an abstract Haskell module, preserving semantics.
Transform expressions by traversing subterms.
Of special interest are expressions that contain patterns as subterms,
case and lambda expressions, and also list comprehensions
do-expressions. All other expressions simply transform their
sub-expressions, if any.
Of special interest are of course also any xml expressions.