Abstract is missing.
- A Notation for ComonadsDominic A. Orchard, Alan Mycroft. 1-17 [doi]
- Iterating Skeletons - Structured Parallelism by CompositionMischa Dieterle, Thomas Horstmeyer, Jost Berthold, Rita Loogen. 18-36 [doi]
- Building JavaScript Applications with HaskellAtze Dijkstra, Jurriën Stutterheim, Alessandro Vermeulen, S. Doaitse Swierstra. 37-52 [doi]
- Advances in Lazy SmallCheckJason S. Reich, Matthew Naylor, Colin Runciman. 53-70 [doi]
- OCaml-Java: From OCaml Sources to Java BytecodesXavier Clerc. 71-85 [doi]
- The HERMIT in the Tree - Mechanizing Program Transformations in the GHC Core LanguageNeil Sculthorpe, Andrew Farmer, Andy Gill. 86-103 [doi]
- Optimisation of Generic Programs Through InliningJosé Pedro Magalhães. 104-121 [doi]
- A Type- and Control-Flow Analysis for System FMatthew Fluet. 122-139 [doi]
- Dependently-Typed Programming in Scientific Computing - Examples from Economic ModellingCezar Ionescu, Patrik Jansson. 140-156 [doi]
- Engineering Proof by Reflection in AgdaPaul van der Walt, Wouter Swierstra. 157-173 [doi]
- Agda Meets AcceleratePeter Thiemann, Manuel M. T. Chakravarty. 174-189 [doi]
- An Embedded Type DebuggerKanae Tsushima, Kenichi Asai. 190-206 [doi]
- Pure and Lazy Lambda Mining - An Experience ReportNicolas Wu, José Pedro Magalhães, Jeroen Bransen, Wouter Swierstra. 207-223 [doi]
- Decomposing Metaheuristic OperationsRichard Senington, David Duke. 224-239 [doi]