On the Bright Side of Type Classes: Instance Arguments in Agda
Dominique Devriese and Frank Piessens (K.U.Leuven)
Set-theoretic Foundation of Parametric Polymorphism and Subtyping
Giuseppe Castagna (CNRS - Université Paris Diderot) and Zhiwu Xu (Université Paris Diderot and Institute of Software Chinese Academy of Sciences)
Geometry of Synthesis IV
Dan R. Ghica and Alex Smith (University of Birmingham) and Satnam Singh (Microsoft Research)
Modular verification of preemptive OS kernels
Alexey Gotsman (IMDEA Software Institute) and Hongseok Yang (Queen Mary University of London)
Experience Report: Functional Modelling of Musical Harmony
José Pedro Magalhães and W. Bas de Haas (Utrecht University)
Incremental Updates for Efficient Bidirectional Transformations
Meng Wang (Chalmers University of Technology) and Jeremy Gibbons and Nicolas Wu (University of Oxford)
Experience Report:Functional Programming through Deep Time
Emily G Mitchell (University of Cambridge, UK)
Proving The Unique Fixed-Point Principle Correct - An Adventure with Category Theory
Ralf Hinze and Daniel W. H. James (University of Oxford)
Monads, Zippers and Views: Virtualizing the Monad Stack
Tom Schrijvers (Universiteit Gent, Belgium) and Bruno C. d. S. Oliveira (ROSAEC Center, Seoul National University, South Korea)
Forest: A Language and Toolkit For Programming with Filestores
Kathleen Fisher (Tufts University), Nate Foster (Cornell University), David Walker (Princeton University), and Kenny Q. Zhu (Shanghai Jiao Tong University)
Implicit Self-Adjusting Computation for Purely Functional Programs
Yan Chen, Joshua Dunfield, Matthew A. Hammer, and Umut A. Acar (MPI-SWS)
Just do it: Simple Monadic Equational Reasoning
Jeremy Gibbons and Ralf Hinze (University of Oxford)
Characteristic Formulae for the Verification of Imperative Programs
Arthur Charguéraud (Max-Planck Institute for Software Systems)
Subtyping delimited continuations
Marek Materzok and Dariusz Biernacki (University of Wroclaw)
Secure Distributed Programming with Value-Dependent Types
Nikhil Swamy, Juan Chen, and Cedric Fournet (Microsoft Research), Pierre-Yves Strub (MSR-INRIA), Karthikeyan Bhargavan (INRIA), and Jean Yang (MIT)
Temporal Higher-Order Contracts
Tim Disney and Cormac Flanagan (University of California, Santa Cruz) and Jay McCarthy (Brigham Young University)
Pushdown Flow Analysis of First-Class Control
Dimitrios Vardoulakis and Olin Shivers (Northeastern University)
An Equivalence-Preserving CPS Translation via Multi-Language Semantics
Amal Ahmed (Indiana University) and Matthias Blume (Google)
Generalising and Dualising the Third List-Homomorphism Theorem
Shin-Cheng Mu (Academia Sinica, Taiwan) and Akimasa Morihata (Tohoku University, Japan)
Functional Pearl: Parsing with Derivatives
Matthew Might and David Darais (University of Utah) and Daniel Spiewak (University of Wisconsin-Milwaukee)
Lightweight Monadic Programming for ML
Nikhil Swamy (Microsoft Research), Nataliya Guts (University of Maryland, College Park), Daan Leijen (Microsoft Research), and Michael Hicks (University of Maryland, College Park)
Frenetic: A Network Programming Language
Nate Foster (Cornell University), Rob Harrison, Michael J. Freedman, Christopher Monsanto, and Jennifer Rexford (Princeton University), Alec Story (Cornell University), and David Walker (Princeton University)
The Mendler Hierarchy of Recursion Combinators: Taming Inductive Datatypes with Negative Occurrences.
Ki Yung Ahn and Tim Sheard (Portland State University)
Balanced Trees Inhabiting Functional Parallel Programming
Akimasa Morihata (Tohoku University) and Kiminori Matsuzaki (Kochi University of Technology)
A Kripke Logical Relation for Effect-Based Program Transformations
Jacob Thamsborg and Lars Birkedal (IT University of Copenhagen)
Typed Self-Interpretation by Pattern Matching
C. Barry Jay (University of Technology, Sydney) and Jens Palsberg (UCLA, University of California, Los Angeles)
Experience Report: Using Camlp4 for Presenting Dynamic Mathematics on the Web: DynaMoW, an OCaml language extension for the run-time generation of mathematical contents and their presentation on the Web
Frédéric Chyzak (INRIA) and Alexis Darrasse (Université Paris 6)
Parametric Polymorphism and Semantic Subtyping: the Logical Connection
Nils Gesbert (INRIA), Pierre Geneves (CNRS), and Nabil Layaida (INRIA)
Linearity and PCF: a semantic insight!
Marco Gaboardi (Universita di Bologna), Luca Paolini (Universita di Torino), and Mauro Piccolo (Politecnico di Torino)
How to Make Ad Hoc Proof Automation Less Ad Hoc
Georges Gonthier (Microsoft Research), Beta Ziliani (MPI-SWS), Aleksandar Nanevski (IMDEA Software Institute), and Derek Dreyer (MPI-SWS)
Nameless, Painless
Nicolas Pouillard (INRIA)
A Semantic Model for Graphical User Interfaces
Neelakantan R. Krishnaswami and Nick Benton (Microsoft Research)
Recursive principles for syntax with bindings and substitution
Andrei Popescu (Technical University Mun ich) and Elsa Gunter (University of Illinois)
Binders Unbound
Stephanie Weirich and Brent Yorgey (University of Pennsylvania) and Tim Sheard (Portland State University)
Modular rollback through control logging
Olin Shivers and Aaron Turon (Northeastern University)
Deriving an Efficient FPGA Implementation of a Low Density Parity Check Forward Error Corrector
Andy Gill and Andrew Farmer (University of Kansas)
An Efficient Non-Moving Garbage Collector for Functional Languages
Katsuhiro Ueno, Atsushi Ohori, and Toshiaki Otomo (Tohoku University)
Making Standard ML a Practical Database Programming Language
Atsushi Ohori and Katsuhiro Ueno (Tohoku University)