| 2012 | Experience report: a do-it-yourself high-assurance compiler. | Lee Pike, Nis Wegmann, Sebastian Niller, Alwyn Goodloe |
| 2012 | Functional programs that explain their work. | Roly Perera, Umut A. Acar, James Cheney, Paul Blain Levy |
| 2012 | High performance embedded domain specific languages. | Kunle Olukotun |
| 2012 | Functional programming with structured graphs. | Bruno C. d. S. Oliveira, William R. Cook |
| 2012 | Financial software on GPUs: between Haskell and Fortran. | Cosmin E. Oancea, Christian Andreetta, Jost Berthold, Alain Frisch, Fritz Henglein |
| 2012 | Scheme on the web and in the classroom: a retrospective about the LAML project. | Kurt Nrmark |
| 2012 | A traversal-based algorithm for higher-order model checking. | Robin P. Neatherway, Steven J. Ramsay, C.-H. Luke Ong |
| 2012 | Proof-producing synthesis of ML from higher-order logic. | Magnus O. Myreen, Scott Owens |
| 2012 | Shake before building: replacing make with haskell. | Neil Mitchell |
| 2012 | Agda-curious?: an exploration of programming with dependent types. | Conor Thomas McBride |
| 2012 | Explicitly heterogeneous metaprogramming with MetaHaskell. | Geoffrey Mainland |
| 2012 | The right kind of generic programming. | Jos Pedro Magalhes |
| 2012 | Optimizing JavaScript code for V8. | Florian Loitsch |
| 2012 | Work efficient higher-order vectorisation. | Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Roman Leshchinskiy, Simon L. Peyton Jones |
| 2012 | Embedding F. | Sam Lindley |
| 2012 | Efficient lookup-table protocol in secure multiparty computation. | John Launchbury, Iavor S. Diatchki, Thomas DuBuisson, Andy Adams-Moran |
| 2012 | Superficially substructural types. | Neelakantan R. Krishnaswami, Aaron Turon, Derek Dreyer, Deepak Garg |
| 2012 | Generic conversions of abstract syntax representations. | Steven Keuchel, Johan Jeuring |
| 2012 | Using domain-specific languages and access-execute descriptors to expand the parallel code synthesis design space: keynote talk. | Paul H. J. Kelly |
| 2012 | Optimizing closures in O(0) time. | Andrew W. Keep, Alex Hearn, R. Kent Dybvig |
| 2012 | A sufficiently smart compiler for procedural records. | Andrew W. Keep, R. Kent Dybvig |
| 2012 | Deconstraining DSLs. | Will Jones, Tony Field, Tristan Oliver Richard Allwood |
| 2012 | Expressing multi-way data-flow constraint systems as a commutative monoid makes many of their properties obvious. | Jaakko Jrvi, Magne Haveraaen, John Freeman, Mat Marcus |
| 2012 | Formal verification of monad transformers. | Brian Huffman |
| 2012 | Sorting with bialgebras and distributive laws. | Ralf Hinze, Daniel W. H. James, Thomas Harper, Nicolas Wu, Jos Pedro Magalhes |