Programming Languages and Systems

1. Front Matter

   Pages I-XV

   PDF

2. Disjoint Polymorphism

   • João Alpuim, Bruno C. d. S. Oliveira, Zhiyuan Shi

   Pages 1-28

3. Generalizing Inference Systems by Coaxioms

   • Davide Ancona, Francesco Dagnino, Elena Zucca

   Pages 29-55

4. Observed Communication Semantics for Classical Processes

   • Robert Atkey

   Pages 56-82

5. Is Your Software on Dope?

   • Pedro R. D’Argenio, Gilles Barthe, Sebastian Biewer, Bernd Finkbeiner, Holger Hermanns

   Pages 83-110

6. Friends with Benefits

   • Jasmin Christian Blanchette, Aymeric Bouzy, Andreas Lochbihler, Andrei Popescu, Dmitriy Traytel

   Pages 111-140

7. Confluence of Graph Rewriting with Interfaces

   • Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Paweł Sobociński, Fabio Zanasi

   Pages 141-169

8. Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency

   • Ahmed Bouajjani, Michael Emmi, Constantin Enea, Burcu Kulahcioglu Ozkan, Serdar Tasiran

   Pages 170-200

9. Incremental Update for Graph Rewriting

   • Pierre Boutillier, Thomas Ehrhard, Jean Krivine

   Pages 201-228

10. Linearity, Control Effects, and Behavioral Types

    • Luís Caires, Jorge A. Pérez

    Pages 229-259

11. Temporary Read-Only Permissions for Separation Logic

    • Arthur Charguéraud, François Pottier

    Pages 260-286

12. Faster Algorithms for Weighted Recursive State Machines

    • Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis

    Pages 287-313

13. ML and Extended Branching VASS

    • Conrad Cotton-Barratt, Andrzej S. Murawski, C. -H. Luke Ong

    Pages 314-340

14. Metric Reasoning About \(\lambda \)-Terms: The General Case

    • Raphaëlle Crubillé, Ugo Dal Lago

    Pages 341-367

15. Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring

    • Ryan Culpepper, Andrew Cobb

    Pages 368-392

16. Probabilistic Termination by Monadic Affine Sized Typing

    • Ugo Dal Lago, Charles Grellois

    Pages 393-419

17. Caper

    • Thomas Dinsdale-Young, Pedro da Rocha Pinto, Kristoffer Just Andersen, Lars Birkedal

    Pages 420-447

18. Tackling Real-Life Relaxed Concurrency with FSL++

    • Marko Doko, Viktor Vafeiadis

    Pages 448-475

19. Extensible Datasort Refinements

    • Jana Dunfield

    Pages 476-503

20. Programs Using Syntax with First-Class Binders

    • Francisco Ferreira, Brigitte Pientka

    Pages 504-529

This book constitutes the proceedings of the 26th European Symposium on Programming, ESOP 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017.

The 36 papers presented in this volume were carefully reviewed and selected from 112 submissions. They cover traditional as well as emerging topics in programming languages. In detail they deal with semantic foundation and type system for probabilistic programming; techniqu3es for verifying concurrent or higher-order programs; programming languages for arrays or web data; program analysis and verification of non-standard program properties; foundation and application of interactive theorem proving; graph rewriting; separation logic; session type; type theory; and implicit computational complexity. 

• software engineering
• computer software selection and evaluation
• verification
• specifications
• semantics
• computer programming languages
• program compilers
• type systems
• functional programming
• separation logic
• formal logic
• concurrency
• program logic
• automated reasoning
• proof theory
• context specification languages

• Department of Computer Science, University of Oxford, Oxford, UK

  Hongseok Yang

Policies and ethics