List of accepted papers

Semantic subtyping with an SMT Solver
Gavin Bierman (Microsoft Research); Andrew Gordon (Microsoft Research); Catalin Hritcu (Saarland University); David Langworthy (Microsoft Corporation)
Parametricity and dependent types
Jean-Philippe Bernardy (Chalmers University of Technology and University of Gothenburg); Patrik Jansson (Chalmers University of Technology and University of Gothenburg); Ross Paterson (City University London)
Experience Report: Growing Programming Languages for Beginning Students
Marcus Crestani (University of Tübingen); Michael Sperber (DeinProgramm)
Experience Report: Haskell as a reagent. Results and observations on the use of Haskell in a Python project
Authors: Iustin Pop (Google Inc)
Combining Syntactic and Semantic Bidirectionalization
Janis Voigtländer (University of Bonn); Zhenjiang Hu (National Institute of Informatics, Tokyo); Kazutaka Matsuda (Tohoku University, Sendai); Meng Wang (University of Oxford)
Program Verification Through Characteristic Formulae
Arthur Charguéraud (INRIA)
The Gentle Art of Levitation
Pierre-Evariste Dagand (University of Strathclyde); Conor McBride (University of Strathclyde); James Chapman (Institute of Cybernetics, Tallinn University of Technology); Peter Morris (University of Nottingham)
Scrapping your Inefficient Engine: using Partial Evaluation to Improve Domain-Specific Language Implementation
Edwin Brady (University of St Andrews); Kevin Hammond (University of St Andrews)
Total Parser Combinators
Nils Anders Danielsson (University of Nottingham)
Higher-order Representation of Substructural Logics
Karl Crary (Carnegie Mellon University)
Matching Lenses: Alignment and View Update
Davi M. J. Barbosa (École Polytechnique); Julien Cretin (École Polytechnique); Nate Foster (Princeton University); Michael Greenberg (University of Pennsylvania); Benjamin C. Pierce (University of Pennsylvania)
Using Functional Programming within an Industrial Product Group: Perspectives and Perceptions
David Scott (Citrix Systems R&D); Richard Sharp (Citrix Systems R&D); Thomas Gazagnaire (INRIA); Anil Madhavapeddy (University of Cambridge)
A Play on Regular Expressions
Sebastian Fischer (University of Kiel); Frank Huch (University of Kiel); Thomas Wilke (University of Kiel)
Distance Makes the Types Grow Stronger: A Calculus for Differential Privacy
Jason Reed (University of Pennsylvania); Benjamin Pierce (University of Pennsylvania)
Logical Types for Scheme
Sam Tobin-Hochstadt (Northeastern University); Matthias Felleisen (Northeastern University)
Lazy Tree Splitting
Lars Bergstrom (University of Chicago); Matthew Fluet (Rochester Institute of Technology); Michael Rainey (University of Chicago); John Reppy (University of Chicago); Adam Shaw (University of Chicago)
Abstracting Abstract Machines: Static Analysis of Evaluation Order, Return-flow, Laziness and the Stack
David Van Horn (Northeastern University); Matthew Might (University of Utah)
Security-Typed Programming within Dependently-Typed Programming
Jamie Morgenstern (University of Chicago); Dan Licata (Carnegie Mellon University)
VeriML: Typed Computation of Logical Terms inside a Language with Effects
Antonis Stampoulis (Yale University); Zhong Shao (Yale University)
A Certified Framework for Compiling and Executing Garbage-Collected Languages
Andrew McCreight (Portland State University); Tim Chevalier (Portland State University); Andrew Tolmach (Portland State University)
Instance chains: Type class programming without overlapping instances
J. Garrett Morris (Portland State University); Mark P. Jones (Portland State University)
Specifying and Verifying Sparse Matrix Codes
Gilad Arnold (University of California, Berkeley); Johannes Hölzl (Technische Universität München); Ali Sinan Köksal (Ecole Polytechnique Fédérale de Lausanne); Rastislav Bodik (University of California, Berkeley); Mooly Sagiv (Tel-Aviv University and Stanford University)
Bidirectionalizing Graph Transformations
Soichiro Hidaka (National Institute of Informatics, Japan); Zhenjiang Hu (National Institute of Informatics, Japan); Kazuhiro Inaba (National Institute of Informatics, Japan); Hiroyuki Kato (National Institute of Informatics, Japan); Kazutaka Matsuda (Tohoku University, Japan); Keisuke Nakano (University of Electro-Communications, Japan)
Polyvariant Flow Analysis with Higher-ranked Polymorphic Types and Higher-order Effect Operators
Stefan Holdermans (Vector Fabrics); Jurriaan Hage (Utrecht University)
Rethinking Supercompilation
Neil Mitchell
Regular, shape-polymorphic, parallel arrays in Haskell
Gabriele Keller (University of New South Wales); Manuel M. T. Chakravarty (University of New South Wales); Roman Leshchinskiy (University of New South Wales); Simon Peyton Jones (Microsoft Research Ltd); Ben Lippmeier (University of New South Wales)
The Reduceron Reconfigured
Matthew Naylor (University of York); Colin Runciman (University of York)
Fortifying Macros
Ryan Culpepper (Northeastern University); Matthias Felleisen (Northeastern University)
Functional Pearl: Every Bit Counts
Dimitrios Vytiniotis (Microsoft Research); Andrew Kennedy (Microsoft Research)
Lolliproc: to Concurrency from Classical Linear Logic via Curry-Howard and Control
Karl Mazurak (University of Pennsylvania); Steve Zdancewic (University of Pennsylvania)
ReCaml: Execution State as the Cornerstone of Reconfigurations
Jérémy Buisson (UEB / Ecoles de St-Cyr Coetquidan / VALORIA); Fabien Dagnat (UEB / Institut Télécom / Télécom Bretagne)
The Impact of Higher-Order State and Control Effects on Local Relational Reasoning
Derek Dreyer (MPI-SWS); Georg Neis (MPI-SWS); Lars Birkedal (IT University of Copenhagen)
A fresh look at programming with names and binders
Nicolas Pouillard (INRIA); François Pottier (INRIA)