Abstract is missing.
- Agda-curious?: an exploration of programming with dependent typesConor Thomas McBride. 1-2 [doi]
- Verified heap theorem prover by paramodulationGordon Stewart, Lennart Beringer, Andrew W. Appel. 3-14 [doi]
- Formal verification of monad transformersBrian Huffman. 15-16 [doi]
- Elaborating intersection and union typesJoshua Dunfield. 17-28 [doi]
- An error-tolerant type system for variational lambda calculusSheng Chen 0008, Martin Erwig, Eric Walkingshaw. 29-40 [doi]
- Superficially substructural typesNeelakantan R. Krishnaswami, Aaron Turon, Derek Dreyer, Deepak Garg. 41-54 [doi]
- Shake before building: replacing make with haskellNeil Mitchell. 55-66 [doi]
- Practical typed lazy contractsOlaf Chitil. 67-76 [doi]
- Functional programming with structured graphsBruno C. D. S. Oliveira, William R. Cook. 77-88 [doi]
- Painless programming combining reduction and search: design principles for embedding decision procedures in high-level languagesTimothy E. Sheard. 89-102 [doi]
- Transporting functions across ornamentsPierre-Évariste Dagand, Conor McBride. 103-114 [doi]
- Proof-producing synthesis of ML from higher-order logicMagnus O. Myreen, Scott Owens. 115-126 [doi]
- Operational semantics using the partiality monadNils Anders Danielsson. 127-138 [doi]
- High performance embedded domain specific languagesKunle Olukotun. 139-140 [doi]
- Pure type systems with corecursion on streams: from finite to infinitary normalisationPaula Severi, Fer-Jan de Vries. 141-152 [doi]
- On the complexity of equivalence of specifications of infinite objectsJörg Endrullis, Dimitri Hendriks, Rena Bakhshi. 153-164 [doi]
- Automatic amortised analysis of dynamic memory allocation for lazy functional programsHugo R. Simões, Pedro B. Vasconcelos, Mário Florido, Steffen Jost, Kevin Hammond. 165-176 [doi]
- Introspective pushdown analysis of higher-order programsChristopher Earl, Ilya Sergey, Matthew Might, David Van Horn. 177-188 [doi]
- Efficient lookup-table protocol in secure multiparty computationJohn Launchbury, Iavor S. Diatchki, Thomas Dubuisson, Andy Adams-Moran. 189-200 [doi]
- Addressing covert termination and timing channels in concurrent information flow systemsDeian Stefan, Alejandro Russo, Pablo Buiras, Amit Levy, John C. Mitchell, David Mazières. 201-214 [doi]
- Sneaking around concatMap: efficient combinators for dynamic programmingChristian Höner zu Siederdissen. 215-226 [doi]
- Experience report: Haskell in computational biologyNoah M. Daniels, Andrew Gallant, Norman Ramsey. 227-234 [doi]
- A meta-scheduler for the par-monad: composable scheduling for the heterogeneous cloudAdam Foltzer, Abhishek Kulkarni, Rebecca Swords, Sajith Sasidharan, Eric Jiang, Ryan Newton. 235-246 [doi]
- Nested data-parallelism on the gpuLars Bergstrom, John H. Reppy. 247-258 [doi]
- Work efficient higher-order vectorisationBen Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Roman Leshchinskiy, Simon L. Peyton Jones. 259-270 [doi]
- Tales from the junglePeter Sewell. 271-272 [doi]
- Propositions as sessionsPhilip Wadler. 273-286 [doi]
- Typing unmarshalling without marshalling typesGrégoire Henry, Michel Mauny, Emmanuel Chailloux, Pascal Manoury. 287-298 [doi]
- Deconstraining DSLsWill Jones, Tony Field, Tristan O. R. Allwood. 299-310 [doi]
- Explicitly heterogeneous metaprogramming with MetaHaskellGeoffrey Mainland. 311-322 [doi]
- A generic abstract syntax model for embedded languagesEmil Axelsson. 323-334 [doi]
- Experience report: a do-it-yourself high-assurance compilerLee Pike, Nis Wegmann, Sebastian Niller, Alwyn Goodloe. 335-340 [doi]
- Equality proofs and deferred type errors: a compiler pearlDimitrios Vytiniotis, Simon L. Peyton Jones, José Pedro Magalhães. 341-352 [doi]
- A traversal-based algorithm for higher-order model checkingRobin P. Neatherway, Steven James Ramsay, C.-H. Luke Ong. 353-364 [doi]
- Functional programs that explain their workRoly Perera, Umut A. Acar, James Cheney, Paul Blain Levy. 365-376 [doi]