|
| 1 | +- 10/04: Data Types a La Carte |
| 2 | +- 17/04: A Novel Representation of Lists and its Application to the Function "reverse". |
| 3 | +- 24/04: Algebraic graphs with class |
| 4 | +- 01/05: Applicative Programming with Effects |
| 5 | +- 08/05: A lightweight Optimization Technique for Data Types a la Carte |
| 6 | +- 15/05: Church Encoding of Data Types Considered Harmful for Implementations |
| 7 | +- 22/05: Generic datatypes a la carte |
| 8 | +- 29/05: Clowns to the left of me, Jokers to the right: Dissecting data structures |
| 9 | +- 05/06: Composing Monads |
| 10 | +- 12/06: Datatype-Generic Programming |
| 11 | +- 19/06: Effect Handlers in Scope |
| 12 | +- 26/06: Effect handlers in haskell, evidently |
| 13 | +- 03/07: Extensible Effects: An Alternative to Monad Transformers |
| 14 | +- 10/07: Finally Tagless, Partially Evaluated: Tagless Staged Interpreters for Simpler Typed Languages |
| 15 | +- 17/07: Foundations for structured programming with GADTs |
| 16 | +- 24/07: Free Delivery |
| 17 | +- 31/07: Implicit configurations--or, type classes reflect the values of types |
| 18 | +- 07/08: Streams and unique fix points |
| 19 | +- 14/08: Two can keep a secret, if one of them uses Haskell |
| 20 | +- 21/08: Generic views on Data Types |
| 21 | +- 28/08: Generic programming with indexed functors |
| 22 | +- 04/09: The sums of products |
| 23 | +- 11/09: There is No Fork: An Abstraction for Efficient, Concurrent, and Concise Data Access |
| 24 | +- 18/09: The design of a pretty printing library |
| 25 | +- 25/09: Stream Fusion. From Lists to Streams to Nothing at All |
| 26 | +- 02/10: Selective applicative functors |
| 27 | +- 09/10: Profunctor Optics: Modular Data Accessors |
| 28 | +- 16/10: OutsideIn(X) Modular type inference with local assumptions |
| 29 | +- 23/10: Monoids: theme and variations |
| 30 | +- 30/10: Monadic Parser Combinators |
| 31 | +- 04/11: Monad Transformers and Modular Interpreters |
| 32 | +- 13/11: Monad transformers and modular algebraic effects: what binds them together |
| 33 | +- 20/11: Modular type classes |
| 34 | +- 27/11: ML Modules and Haskell Type Classes: A Constructive Comparison |
| 35 | +- 04/12: How to Specify It!: A Guide to Writing Properties of Pure Functions |
| 36 | +- 11/12: Haskell Type Constraints Unleashed |
| 37 | +- 18/12: Ghosts of departed proofs |
| 38 | +- 25/12: Logic and programming languages |
0 commit comments