IFL 2012 - Accepted Papers
The following papers have been accepted for publication in the post-proceedings, and appear in Springer LNCS 8241:
- A Notation for Comonads: Dominic Orchard and Alan Mycroft
- Iterating Skeletons - Structured Parallelism by Composition: Mischa Dieterle, Thomas Horstmeyer, Jost Berthold and Rita Loogen
- Building JavaScript Applications with Haskell: Atze Dijkstra, Jurri"en Stutterheim, Alessandro Vermeulen and S. Doaitse Swierstra
- Advances in Lazy SmallCheck: Jason S. Reich, Matthew Naylor and Colin Runciman
- OCaml-Java: from OCaml sources to Java bytecodes: Xavier Clerc
- The HERMIT in the Tree: Mechanizing Program Transformations in the GHC Core Language: Neil Sculthorpe, Andrew Farmer and Andy Gill
- Optimisation of Generic Programs through Inlining: José Pedro Magalhães
- A Type- and Control-Flow Analysis for System F: Matthew Fluet
- Dependently-typed Programming in Scientific Computing: Examples from economic modelling: Cezar Ionescu and Patrik Jansson
- Engineering Proof by Reflection in Agda: Paul van der Walt and Wouter Swierstra
- Agda Meets Accelerate: Peter Thiemann and Manuel Chakravarty
- An Embedded Type Debugger: Kanae Tsushima and Kenichi Asai
- Pure and Lazy Lambda Mining: An Experience Report: Nicolas Wu, José Pedro Magalhães, Jeroen Bransen and Wouter Swierstra
- Decomposing Metaheuristic Operations: Richard Senington and David Duke