Haskell programming in plain view
Jump to navigation
Jump to search
Introduction[edit | edit source]
Applications[edit | edit source]
- Sudoku Background (pdf)
- Bird's Implementation
Using GHCi[edit | edit source]
- Getting started (pdf)
Using Libraries[edit | edit source]
- Library (pdf)
Types[edit | edit source]
Functions[edit | edit source]
Expressions[edit | edit source]
Lambda Calculus[edit | edit source]
- Lambda Calculus - informal description (pdf)
- Lambda Calculus - Formal definition (pdf)
- Expression Reduction (pdf)
- Normal Forms (pdf)
- Encoding Datatypes
Function Oriented Typeclasses[edit | edit source]
Functors[edit | edit source]
Applicatives[edit | edit source]
- Applicatives Overview (pdf)
- Applicatives Methods (pdf)
- Function Applicative (pdf)
- Applicatives Sequencing (pdf)
Monads I : Background[edit | edit source]
- Side Effects (pdf)
- Monad Overview (pdf)
- Monadic Operations (pdf)
- Maybe Monad (pdf)
- IO Actions (pdf)
- Several Monad Types (pdf)
Monads II : State Transformer Monads[edit | edit source]
- State Transformer
- - State Transformer Basics (pdf)
- - State Transformer Generic Monad (pdf)
- - State Transformer Monads (pdf)
- State Monad
Monads III : Mutable State Monads[edit | edit source]
- 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[edit | edit source]
- MonadReader Class
- Control Monad (pdf)
Monoid[edit | edit source]
- Monoids (pdf)
Arrow[edit | edit source]
- Arrows (pdf)
Polymorphism[edit | edit source]
- Polymorphism Overview (pdf)
Concurrent Haskell[edit | edit source]
go to [ Electrical_&_Computer_Engineering_Studies ]