Abstract is missing.
- ML: metalanguage or object language?Michael J. C. Gordon. 1-2 [doi]
- The gentle art of levitationJames Chapman, Pierre-Évariste Dagand, Conor McBride, Peter Morris. 3-14 [doi]
- Functional pearl: every bit countsDimitrios Vytiniotis, Andrew Kennedy. 15-26 [doi]
- ReCaml: execution state as the cornerstone of reconfigurationsJérémy Buisson, Fabien Dagnat. 27-38 [doi]
- Lolliproc: to concurrency from classical linear logic via curry-howard and controlKarl Mazurak, Steve Zdancewic. 39-50 [doi]
- Abstracting abstract machinesDavid Van Horn, Matthew Might. 51-62 [doi]
- Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operatorsStefan Holdermans, Jurriaan Hage. 63-74 [doi]
- The reduceron reconfiguredMatthew Naylor, Colin Runciman. 75-86 [doi]
- Using functional programming within an industrial product group: perspectives and perceptionsDavid Scott, Richard Sharp, Thomas Gazagnaire, Anil Madhavapeddy. 87-92 [doi]
- Lazy tree splittingLars Bergstrom, Mike Rainey, John H. Reppy, Adam Shaw, Matthew Fluet. 93-104 [doi]
- Semantic subtyping with an SMT solverGavin M. Bierman, Andrew D. Gordon, Catalin Hritcu, David E. Langworthy. 105-116 [doi]
- Logical types for untyped languagesSam Tobin-Hochstadt, Matthias Felleisen. 117-128 [doi]
- TeachScheme!: a checkpointMatthias Felleisen. 129-130 [doi]
- Higher-order representation of substructural logicsKarl Crary. 131-142 [doi]
- The impact of higher-order state and control effects on local relational reasoningDerek Dreyer, Georg Neis, Lars Birkedal. 143-156 [doi]
- Distance makes the types grow stronger: a calculus for differential privacyJason Reed, Benjamin C. Pierce. 157-168 [doi]
- Security-typed programming within dependently typed programmingJamie Morgenstern, Daniel R. Licata. 169-180 [doi]
- Combining syntactic and semantic bidirectionalizationJanis Voigtländer, Zhenjiang Hu, Kazutaka Matsuda, Meng Wang. 181-192 [doi]
- Matching lenses: alignment and view updateDavi M. J. Barbosa, Julien Cretin, J. Nathan Foster, Michael Greenberg, Benjamin C. Pierce. 193-204 [doi]
- Bidirectionalizing graph transformationsSoichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano. 205-216 [doi]
- A fresh look at programming with names and bindersNicolas Pouillard, François Pottier. 217-228 [doi]
- Experience report: growing programming languages for beginning studentsMarcus Crestani, Michael Sperber. 229-234 [doi]
- Fortifying macrosRyan Culpepper, Matthias Felleisen. 235-246 [doi]
- Functional parallel algorithmsGuy E. Blelloch. 247-248 [doi]
- Specifying and verifying sparse matrix codesGilad Arnold, Johannes Hölzl, Ali Sinan Köksal, Rastislav Bodík, Mooly Sagiv. 249-260 [doi]
- Regular, shape-polymorphic, parallel arrays in HaskellGabriele Keller, Manuel M. T. Chakravarty, Roman Leshchinskiy, Simon L. Peyton Jones, Ben Lippmeier. 261-272 [doi]
- A certified framework for compiling and executing garbage-collected languagesAndrew McCreight, Tim Chevalier, Andrew P. Tolmach. 273-284 [doi]
- Total parser combinatorsNils Anders Danielsson. 285-296 [doi]
- Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementationEdwin Brady, Kevin Hammond. 297-308 [doi]
- Rethinking supercompilationNeil Mitchell. 309-320 [doi]
- Program verification through characteristic formulaeArthur Charguéraud. 321-332 [doi]
- VeriML: typed computation of logical terms inside a language with effectsAntonis Stampoulis, Zhong Shao. 333-344 [doi]
- Parametricity and dependent typesJean-Philippe Bernardy, Patrik Jansson, Ross Paterson. 345-356 [doi]
- A play on regular expressions: functional pearlSebastian Fischer, Frank Huch, Thomas Wilke. 357-368 [doi]
- Instance chains: type class programming without overlapping instancesJ. Garrett Morris, Mark P. Jones. 375-386 [doi]