WPTE 2015 - Second International Workshop on Rewriting Techniques for Program Transformations and Evaluation

The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally-based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. The previous WPTE was held in Vienna 2014.
Topics of interest in the scope of this workshop include:
Correctness of program transformations, optimizations and translations.
Program transformations for proving termination, confluence and other properties.
Correctness of evaluation strategies.
Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations.
Cost-models for arguing about the optimizing power of transformations and the costs of evaluation.
Program transformations for verification and theorem proving purposes.
Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies.
Program transformations for applying rewriting techniques to programs in specific programming languages.
Program transformations for program inversions and program synthesis.
Program transformation and evaluation for Haskell and Rewriting New!.
The programming languages of interest include pure, deterministic, impure, nondeterministic, concurrent, parallel languages, and may employ programming paradigms such as functional, logical, typed, imperative, object-oriented, and higher-order.
Program transformation and evaluation for Haskell and Rewriting is a new topic of this workshop: 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; rewriting modulo commonly occurring axioms such as associativity, commutativity, and identity element.