Haskell programming in plain view
Introduction
Applications
- Sudoku Background (pdf)
- Bird's Implementation
Using GHCi
- Getting started (pdf)
Using Libraries
- Library (pdf)
Types
Functions
Expressions
Lambda Calculus
- Lambda Calculus - informal description (pdf)
- Lambda Calculus - Formal definition (pdf)
- Expression Reduction (pdf)
- Normal Forms (pdf)
- Encoding Datatypes
- - Church Numerals (pdf)
- - Church Booleans (pdf)
- - Functions (pdf)
- - Combinators (pdf)
- - Recursions (pdf)
Function Oriented Typeclasses
Functors
Applicatives
Monads I : Background
Monads II : State Transformer Monads
- State Transformer
- - State Transformer Basics (pdf)
- - State Transformer Generic Monad (pdf)
- - State Transformer Monads (pdf)
- State Monad
Monads III : Mutable State Monads
- Mutability Background
- - Inhabitedness (pdf)
- - Existential Types (pdf)
- - forall Keyword (pdf)
- - Mutability and Strictness (pdf)
- - Strict and Lazy Packages (pdf)
- Mutable Objects
- IO Monad
- ST Monad
Monads IV : Reader and Writer Monads
- MonadReader Class
- Control Monad (pdf)
Monoid
- Monoids (pdf)
Arrow
- Arrows (pdf)
Polymorphism
- Polymorphism Overview (pdf)
Concurrent Haskell
External links
This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.