|
|
|
SESSION 1. Typed Functional Programming
Chair: Peter Thiemann (Wed 25th, 10:30-12:30)
- Well-typed programs can't be blamed.
Philip Wadler (University of Edinburgh), Robert Findler (University of Chicago)
- Exploring the Design Space of Higher-order Casts.
Jeremy Siek (University of Colorado at Boulder), Ronald Garcia (Rice University), Walid Taha (Rice University)
- Practical Variable-Arity Polymorphism.
T. Stephen Strickland (Northeastern University), Sam Tobin-Hochstadt (Northeastern University), Matthias Felleisen (Northeastern University)
- Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming.
Matthew R. Lakin (University of Cambridge), Andrew Pitts (University of Cambridge)
ETAPS INVITED TALK
(Wed 25th, 14:30-15:30)
- Using Category Theory to Design Programming Languages.
John C. Reynolds (Carnegie Mellon University)
SESSION 2. Computational Effects
Chair: Eugenio Moggi (Wed 25th, 15:30-16:30)
- Modular Monad Transformers.
Mauro Jaskelioff (University of Nottingham)
- Handlers of Algebraic Effects.
Gordon Plotkin (University of Edinburgh), Matija Pretnar (University of Edinburgh)
SESSION 3. Types for Object-Oriented Languages
Chair: Jan Vitek (Wed 25th, 17:00-18:30)
- Is Structural Subtyping Useful? An Empirical Study.
Donna Malayeri (Carnegie Mellon University), Jonathan Aldrich (Carnegie Mellon University)
- An Interval-based Inference of Variant Parametric Types.
Florin Craciun (Durham University), Wei-Ngan Chin (National University of Singapore), Guanhua He (Durham University), Shengchao Qin (Durham University)
- Existential Quantification for Variant Ownership.
Nicholas Cameron (Imperial College London), Sophia Drossopoulou (Imperial College London)
SESSION 4. Verification
Chair: Xavier Leroy (Thu 26th, 10:30-12:30)
- Formalising and Verifying Reference Attribute Grammars in Coq.
Max Schaefer (University of Oxford), Torbjörn Ekman (University of Oxford), Oege de Moor (University of Oxford)
- Verified, Executable SLR Parsing.
Aditi Barthwal (Australian National University), Michael Norrish (NICTA)
- An Efficient Algorithm for Solving the Dyck-CFL-Reachability Problem on Trees.
Hao Yuan (Purdue University), Patrick Eugster (Purdue University)
- Amortised Memory Analysis using the Depth of Data Structures.
Brian Campbell (University of Edinburgh)
ESOP INVITED TALK
(Thu 26th, 14:30-15:30)
- The Financial Crisis, a Lack of Contract Specification Tools: What Can Finance Learn from Programming Language Design?
Jean-Marc Eber (LexiFi)
SESSION 5. Security
Chair: Torben Amtoft (Thu 26th, 15:30-16:30)
- All Secrets Great and Small.
Delphine Demange (University of Rennes 1), David Sands (Chalmers University of Technology)
- Type-Based Automated Verification of Authenticity in Cryptographic Protocols.
Daisuke Kikuchi (Tohoku University), Naoki Kobayashi (Tohoku University)
SESSION 6. Concurrency
Chair: Peter Sewell (Thu 26th, 17:00-18:30)
- A Theory of Non-Monotone Memory (Or: Contexts for free).
Eijiro Sumii (Tohoku University)
- Abstraction for Concurrent Objects.
Ivana Mijajlovic (Queen Mary, University of London), Peter O'Hearn (Queen Mary, University of London), Noam Rinetzky (Queen Mary, University of London), Hongseok Yang (Queen Mary, University of London)
- A Minimization Algorithm for Symbolic Bisimilarity.
Filippo Bonchi (CWI), Ugo Montanari (Università di Pisa)
SESSION 7. Service-Oriented Computing
Chair: Mariangiola Dezani-Ciancaglini (Fri 27th, 10:30-12:30)
- Conversation Types.
Luís Caires (Universidade Nova de Lisboa), Hugo Vieira (Universidade Nova de Lisboa)
- Abstract Processes in Orchestration Languages.
Maria Grazia Buscemi (IMT Lucca Institute for Advanced Studies), Hernan Melgratti (University of Buenos Aires)
- Global Principal Typing in Partially Commutative Asynchronous Sessions.
Dimitris Mostrous (Imperial College London), Nobuko Yoshida (Imperial College London), Kohei Honda (Queen Mary, University of London)
- Tisa: A Language Design and Modular Verification Technique for Temporal Policies in Web Services.
Hridesh Rajan (Iowa State University), Jia Tao (Iowa State University), Steve Shaner (Iowa State University), Gary T. Leavens (University of Central Florida)
SESSION 8. Parallel and Concurrent Programming
Chair: Kostis Sagonas (Fri 27th, 14:30-16:30)
- Automatic Parallelization with Separation Logic.
Mohammad Raza (Imperial College London), Cristiano Calcagno (Imperial College London), Philippa Gardner (Imperial College London)
- Deny-Guarantee Reasoning.
Mike Dodds (University of Cambridge), Xinyu Feng (Toyota Technological Institute at Chicago), Matthew Parkinson (University of Cambridge), Viktor Vafeiadis (Microsoft Research Cambridge)
- A basis for verifying multi-threaded programs.
Rustan Leino (Microsoft Research), Peter Müller (ETH Zurich)
- SingleTrack: A Dynamic Determinism Checker for Multithreaded Programs.
Caitlin Sadowski (University of California at Santa Cruz), Stephen Freund (Williams College), Cormac Flanagan (University of California at Santa Cruz)
|
