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.
Topics of interest in the scope of this workshop include:
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.
This edition is affiliated with FSCD 2017.
Previous editions: WPTE 2014 (affiliated with RTA/TLCA 2014), WPTE 2015 (affiliated with RDP 2015), WPTE 2016 (affiliated with FSCD 2016)
- 09:00-09:30 Registration
- 09:30-11:00 Session 1 (chair: David Sabel)
09:30 Invited Talk The sufficiently smart compiler can prove theorems! Joachim Breitner Abstract
After decades of work on functional programming and on interactive theorem proving, a Haskell programmer who wants to include simple equational proofs in his code, e.g. that some Monad laws hold, is still most likely to simply do the proof by hand, as all the advanced powerful proving tools are inconvenient.
But one powerful tool capable of doing (some of) these proofs is hidden in plain sight: GHC, the Haskell compiler! Its optimization machinery, in particular the simplifier, can prove many simple equations all by himself, simply by compiling both sides and noting that the result is the same. Furthermore, and crucially to make this approach applicable to more complicated equations, the compiler can be instructed to do almost arbitrary symbolic term rewritings by using Rewrite Rules.
In this hands-on talk I will show how, with a very small amount of plumbing, I can conveniently embed the proof obligations for the monad laws for a non-trivial functor in the code, and have GHC prove them to me. I am looking forward to a discussion of the merits, limits and capabilities of this approach.
[Preproceedings]
10:30 Efficient implementation of evaluation strategies via token-guided graph rewriting Koko Muroya and Dan R. Ghica [Preproceedings] - 11:00-11:30 Coffee break
- 11:30-13:00 Session 2 (chair: Horatiu Cirstea)
11:30 Reduced dependency spaces for existential parameterised Boolean equation systems Yutaro Nagae and Masahiko Sakai [Preproceedings]
12:00 Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers Tomohiro Sasano, Naoki Nishida, Masahiko Sakai and Tomoya Ueyama [Preproceedings]
12:30 Space Improvements and Equivalences in a Functional Core Language Manfred Schmidt-Schauss and Nils Dallmeyer [Preproceedings] - 13:00-14:00 Lunch
- 14:00-15:30 Session 3 (chair: David Sabel)
14:00 Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction Shinnosuke Mizutani and Naoki Nishida [Preproceedings]
14:30 Attributed Hierarchical Port Graphs and Applications Nneka Ene, Maribel Fernandez and Bruno Pinaud [Preproceedings]
15:00 A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras Liyi Li and Elsa Gunter [Preproceedings] - 15:30-16:00 Coffee break
- 16:00-17:00 Session 4 (chair: Naoki Nishida)
16:00 Confluence by Strong Commutation with Disjoint Parallel Reduction Kentaro Kikuchi [Preproceedings]
16:30 Business meeting and closing
Registration is open now and possible via the FSCD 2017 registration.
The venue of WPTE is St Anne's College (56 Woodstock Road, OX2 6HS), see FSCD 2017 Local Information and ICFP 2017, Travel to Oxford for more information on attending Oxford.
For the paper submission deadline an extended abstract of at most 10 pages is required to be submitted.
The extended abstract may present original work or also work in progress.
However, for the formal post-proceedings (see below)
full papers must be submitted to the post-proceedings deadline.
Based on the submissions the program committee will select the presentations for the
workshop. All selected contributions will be included in the informal proceedings
distributed to the workshop participants.
One author of each accepted extended abstract is expected to present
it at the workshop. Submissions must be prepared in LaTeX using the
EPTCS macro package (http://style.eptcs.org/).
The call for papers is available in TXT-format.