Abstract is missing.
- FitSpec: refining property sets for functional testingRudy Braquehais, Colin Runciman. 1-12 [doi]
- QuickFuzz: an automatic random fuzzer for common file formatsGustavo Grieco, Martín Ceresa, Pablo Buiras. 13-20 [doi]
- Causal commutative arrows revisitedJeremy Yallop, Hai Liu. 21-32 [doi]
- Functional reactive programming, refactoredIvan Perez, Manuel Bärenz, Henrik Nilsson. 33-44 [doi]
- Free delivery (functional pearl)Jeremy Gibbons. 45-50 [doi]
- How to twist pointers without breaking themSatvik Chauhan, Piyush P. Kurur, Brent A. Yorgey. 51-61 [doi]
- High-performance client-side web applications through Haskell EDSLsAnton Ekblad. 62-73 [doi]
- Experience report: developing high performance HTTP/2 server in HaskellKazuhiko Yamamoto. 74-79 [doi]
- Pattern synonymsMatthew Pickering, Gergo Érdi, Simon L. Peyton Jones, Richard A. Eisenberg. 80-91 [doi]
- Desugaring Haskell's do-notation into applicative operationsSimon Marlow, Simon L. Peyton Jones, Edward Kmett, Andrey Mokhov. 92-104 [doi]
- Revisiting software transactional memory in HaskellMatthew Le, Ryan Yates, Matthew Fluet. 105-113 [doi]
- Autobahn: using genetic algorithms to infer strictness annotationsYisu Remy Wang, Diogenes Nunez, Kathleen Fisher. 114-126 [doi]
- Experience report: types for a relational algebra libraryLennart Augustsson, Mårten Ågren. 127-132 [doi]
- Embedding session types in HaskellSam Lindley, J. Garrett Morris. 133-145 [doi]
- The Key monad: type-safe unconstrained dynamic typingAtze van der Ploeg, Koen Claessen, Pablo Buiras. 146-157 [doi]
- Supermonads: one notion to bind them allJan Bracker, Henrik Nilsson. 158-169 [doi]
- Non-recursive make considered harmful: build systems at scaleAndrey Mokhov, Neil Mitchell, Simon L. Peyton Jones, Simon Marlow. 170-181 [doi]
- Lazy graph processing in HaskellPhilip Dexter, Yu David Liu, Kenneth Chiu. 182-192 [doi]