CfP: (NEW!) Workshop Haskell and Rewriting Techniques HART 2013

Rewriting is the science of replacing equals by equals
and thus a very powerful method for dealing with equations.
There are strong connections between Haskell programming and rewriting.
Therefore, we announce a new workshop,

International Workshop on Haskell And Rewriting Techniques (HART 2013)
          http://www.imn.htwk-leipzig.de/HART2013/

to be held on June 27, in conjunction with RDP 2013, in Eindhoven.
(RDP contains RTA, the main rewriting conference.)

We plan a half day of discussions, in an informal setting,
on how Haskell and rewriting techniques and theories
can cross-fertilize each other.

Topics of interest are, for example,

equational reasoning and other rewriting techniques
    for program verification and analysis;
lambda calculi and type systems for functional programs
    and higher order rewriting systems;
rewriting of type expressions in the type checker;
rewriting of programs by refactoring tools, optimizers, code generators;
execution of programs as a form of graph rewriting;
template Haskell, introducing a rewriting-like macro language
    into the compilation process.

This list of topics is non-exclusive. If you have a contribution that
connects Haskell and rewriting, then submit. When in doubt, contact a
member of the PC.