The aim of WPTE is to bring together 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.
09:00-10:00: (invited talk) Staging for Synthesis and Analysis by Nada Amin
Session 2 (10:30-12:00)
10:30-11:00: An Interactive Proof Mode for Dafny Based on Back Translation of Verification Obligations by Ștefan Ciobâcă, K. Rustan M. Leino, Ștefan-Alexandru Mercas and Roxana-Mihaela Timon
11:00-11:30: Improvement Theory for Probabilistic Call-by-Need by David Sabel and Manfred Schmidt-Schauß
11:30-12:00: A Cyclic Proof System for Trace Formula Implication with Least and Greatest Fixpoints by Takumi Sato and Koji Nakazawa
Session 3 (14:30-15:30)
14:30-15:30: (invited talk) Fully Abstract Normal Form Bisimulation for Call-by-Value PCF by Nikos Tzevelekos
Session 4 (16:00-17:30)
16:00-16:30: On Comparing Python Programs Based on Differences in Rewrite Sequences to Support Grading Programming Exercises by Misaki Kojima and Naoki Nishida
16:30-17:00: Tactic-driven code fusion by Katarzyna Marek and Clément Pit Claudel
17:00-17:30:
business meeting
Topics of Interest
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.
Rewriting-based transformations for bidirectional programming and reversible computation.
