Abstract is missing.
- Improving Haskell types with SMTIavor S. Diatchki. 1-10 [doi]
- A typechecker plugin for units of measure: domain-specific constraint solving in GHC HaskellAdam Gundry. 11-22 [doi]
- Reasoning with the HERMIT: tool support for equational reasoning on GHC core programsAndrew Farmer, Neil Sculthorpe, Andy Gill. 23-34 [doi]
- Formally proving a compiler transformation safeJoachim Breitner. 35-46 [doi]
- Bridging the GUI gap with reactive values and relationsIvan Perez, Henrik Nilsson. 47-58 [doi]
- The remote monad design patternAndy Gill, Neil Sculthorpe, Justin Dawson, Aleksander Eskilson, Andrew Farmer, Mark Grebe, Jeffrey Rosenbluth, Ryan Scott, James Stanton. 59-70 [doi]
- Variations on variantsJ. Garrett Morris. 71-81 [doi]
- Modular reifiable matching: a list-of-functors approach to two-level typesBruno C. D. S. Oliveira, Shin-Cheng Mu, Shu-Hung You. 82-93 [doi]
- Freer monads, more extensible effectsOleg Kiselyov, Hiromi Ishii. 94-105 [doi]
- Functional pearl: getting a quick fix on comonadsKenneth Foner. 106-117 [doi]
- Injective type families for HaskellJan Stolarek, Simon L. Peyton Jones, Richard A. Eisenberg. 118-128 [doi]
- Type families with class, type classes with familyAlejandro Serrano, Jurriaan Hage, Patrick Bahr. 129-140 [doi]
- Déjà Fu: a concurrency testing library for HaskellMichael Walker, Colin Runciman. 141-152 [doi]
- Improving implicit parallelismJosé Manuel Calderón Trilla, Colin Runciman. 153-164 [doi]
- Practical probabilistic programming with monadsAdam Scibior, Zoubin Ghahramani, Andrew D. Gordon. 165-176 [doi]
- Embedding a full linear Lambda calculus in HaskellJeff Polakow. 177-188 [doi]
- Guilt free ivoryTrevor Elliott, Lee Pike, Simon Winwood, Patrick C. Hickey, James Bielman, Jamey Sharp, Eric L. Seidel, John Launchbury. 189-200 [doi]
- Type-safe runtime code generation: accelerate to LLVMTrevor L. McDonell, Manuel M. T. Chakravarty, Vinod Grover, Ryan R. Newton. 201-212 [doi]