Abstract is missing.
- Program synthesis: opportunities for the next decadeRastislav Bodík. 1 [doi]
- Functional pearl: a SQL to C compiler in 500 lines of codeTiark Rompf, Nada Amin. 2-9 [doi]
- An optimizing compiler for a purely functional web-application languageAdam Chlipala. 10-21 [doi]
- Pycket: a tracing JIT for a functional languageSpenser Bauman, Carl Friedrich Bolz, Robert Hirschfeld, Vasily Kirilichev, Tobias Pape, Jeremy G. Siek, Sam Tobin-Hochstadt. 22-34 [doi]
- 1ML - core and modules united (F-ing first-class modules)Andreas Rossberg. 35-47 [doi]
- Bounded refinement typesNiki Vazou, Alexander Bakst, Ranjit Jhala. 48-61 [doi]
- Applicative bidirectional programming with lensesKazutaka Matsuda, Meng Wang. 62-74 [doi]
- Hygienic resugaring of compositional desugaringJustin Pombrio, Shriram Krishnamurthi. 75-87 [doi]
- XQuery and static typing: tackling the problem of backward axesPierre Genevès, Nils Gesbert. 88-100 [doi]
- Noninterference for freeWilliam J. Bowman, Amal Ahmed. 101-113 [doi]
- Algebras and coalgebras in the light affine Lambda calculusMarco Gaboardi, Romain Péchoux. 114-126 [doi]
- Structures for structural recursionPaul Downen, Philip Johnson-Freyd, Zena M. Ariola. 127-139 [doi]
- Denotational cost semantics for functional languages with inductive typesNorman Danner, Daniel R. Licata, Ramyaa. 140-151 [doi]
- Analysing the complexity of functional programs: higher-order meets first-orderMartin Avanzini, Ugo Dal Lago, Georg Moser. 152-164 [doi]
- Functional programming and hardware design: still interesting after all these yearsMary Sheeran. 165 [doi]
- Pilsner: a compositionally verified compiler for a higher-order imperative languageGeorg Neis, Chung-Kil Hur, Jan-Oliver Kaiser, Craig McLaughlin, Derek Dreyer, Viktor Vafeiadis. 166-178 [doi]
- A unification algorithm for Coq featuring universe polymorphism and overloadingBeta Ziliani, Matthieu Sozeau. 179-191 [doi]
- Foundational extensible corecursion: a proof assistant perspectiveJasmin Christian Blanchette, Andrei Popescu 0001, Dmitriy Traytel. 192-204 [doi]
- Generating performance portable code using rewrite rules: from high-level functional expressions to high-performance OpenCL codeMichel Steuwer, Christian Fensch, Sam Lindley, Christophe Dubach. 205-217 [doi]
- Adaptive lock-free maps: purely-functional to scalableRyan R. Newton, Peter P. Fogg, Ali Varamesh. 218-229 [doi]
- Partial aborts for transactions via first-class continuationsMatthew Le, Matthew Fluet. 230-242 [doi]
- Which simple types have a unique inhabitant?Gabriel Scherer, Didier Rémy. 243-255 [doi]
- Elaborating evaluation-order polymorphismJoshua Dunfield. 256-268 [doi]
- Automatic refunctionalization to a language with copattern matching: with applications to the expression problemTillmann Rendel, Julia Trieflinger, Klaus Ostermann. 269-279 [doi]
- Functional pearl: two can keep a secret, if one of them uses HaskellAlejandro Russo. 280-288 [doi]
- HLIO: mixing static and dynamic typing for information-flow control in HaskellPablo Buiras, Dimitrios Vytiniotis, Alejandro Russo. 289-301 [doi]
- Practical principled FRP: forget the past, change the future, FRPNow!Atze van der Ploeg, Koen Claessen. 302-314 [doi]
- Certified symbolic management of financial multi-party contractsPatrick Bahr, Jost Berthold, Martin Elsman. 315-327 [doi]
- A fast compiler for NetKATSteffen Smolka, Spiridon Aristides Eliopoulos, Nate Foster, Arjun Guha. 328-341 [doi]
- RRB vector: a practical general purpose immutable sequenceNicolas Stucki, Tiark Rompf, Vlad Ureche, Phil Bagwell. 342-354 [doi]
- Functional pearl: a smart view on datatypesMauro Jaskelioff, Exequiel Rivas. 355-361 [doi]
- Efficient communication and collection with compact normal formsEdward Z. Yang, Giovanni Campagna, Ömer S. Agacan, Ahmed El-Hassany, Abhishek Kulkarni, Ryan R. Newton. 362-374 [doi]
- Blame assignment for higher-order contracts with intersection and unionMatthias Keil, Peter Thiemann. 375-386 [doi]
- Expressing contract monitors as patterns of communicationCameron Swords, Amr Sabry, Sam Tobin-Hochstadt. 387-399 [doi]
- Learning refinement typesHe Zhu, Aditya V. Nori, Suresh Jagannathan. 400-411 [doi]
- Practical SMT-based type error localizationZvonimir Pavlinovic, Tim King 0001, Thomas Wies. 412-423 [doi]
- GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and lazinessGeorgios Karachalias, Tom Schrijvers, Dimitrios Vytiniotis, Simon L. Peyton Jones. 424-436 [doi]