Monads

• What are monads fallacy
• What is a monad?
• John Wiegley on Monads in Lisp
• On why Reader + IO instead of Writer or State ?

Streaming

• Simpler conduit library - Code
• Reasoning about streaming - lazy/strict/pipes
• Gabriel Gonzalez's - Streams are categories paper

Libraries

• Aeson - Tutorial
• Lens over tea
• Tutorial on time library
• Tutorial on Parsing using parsec library

FFI

• FFI - Wikibooks
• Practical example with FFI
• Niklas on Interruptibility, safe etc

Performance

• Inlining and specialization
• Luke Palmer on determinig if a function is strict

Misc

• How important is laziness in practice?
• Pinned/Unpinned
• What is the # sign after the type ?
• Applying Type Level and generic programming in Haskell- 50 Pages pdf
• What is positive, negative nature and contravariant?
• Continuation based relative time FRP
• Dependent type programming and theorem proving in Haskell
• Effects encoded in types break encapsulation
• Type Unification technique
• Do free monads actually matter
• The Algebra of ADT- Part 1
• The Algebra of ADT- Part 2
• The Algebra of ADT- Part 3
• Resource management in Haskell
• Generics in Haskell
• unsafePerformIO and NOINLINE
• foldl vs foldr

Template Haskell

• Terminology Refresher
• Brief introduction to Quasi-Quotation

Typeclasses

• On Typeclass instance selection
• Typeclass patterns and anti-patterns
• Instances and dictionaries
• Haskell type equality constraints
• ~ in constraints

Alternative Typeclass

• What does <|> do ?
• Explanation of some and many function

Testing

• Up front unit testing in Haskell

Kinds

• Basic type level programming
• Types and Kinds and Sorts, Oh My!
• What does * :: * mean ?
• Minimal Servant

GHC Extensions

• Type Families - Basic introduction
• Type Families - type vs data
• RankNTypes and scope of forall

Maths related

• Symbolic differentiation in Haskell
• Automatic differentiation

GHC

• GHC for Hardware persons