CS240h lecture notes
-
Basics
[slides,
source]
-
Slides from previous lecture include this lecture, starting at slide 28
-
Memory
[slides,
source]
-
Testing
[slides,
source]
-
Concurrency
[slides,
source]
-
Zippers
[slides,
source]
-
Phantoms and mutants
[slides,
source]
-
Monoids and fingertrees
-
Monads and more
[slides,
source]
-
Iteratees
[slides,
source]
-
Information flow control
[slides,
source]
-
Parsing and continuations
[slides,
source]
-
Performance
[slides,
source]
-
Folds and parallelism
[slides,
source]
-
A Haskell Compiler
[slides,
source]
-
Library level optimization
[slides,
source]
-
Gnarly language extensions
[slides,
source]
-
Johan Tibell's guest lecture
-
Generic programming
[slides,
source]
These slides were formatted
using pandoc. To
install pandoc, run:
cabal install pandoc -fhighlighting
Slides were prepared with
pandoc --data-dir=datadir --offline -s -t slidy
-o outfile infile
where our datadir/slidy contains this slightly
modified slidy.css.
Permission hereby granted for anyone to copy, modify, and redistribute
any lecture note material from this class that belongs to the
instructor or Stanford.