Haskell is an advanced purely-functional programming language. Pure functional programming is programming with equations, often defined by pattern-matching. 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 (or generally, pure functional) programming and rewriting. The purpose of the HART workshop is to foster those connections.

Aims and Scope

We plan a half day of discussions, in an informal setting, on how Haskell (and friends) 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 rewrite 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 (terms with sharing);
• Template Haskell, generally 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. Also, the workshop is deliberately open for discussion of rewriting-related aspects of languages like Agda, Clean, Idris, ...

When in doubt, please contact a member of the program committee.

Invited Speaker

We are proud to feature an invited talk by Oleg Kiselyov!