Completed
Haskell for Imperative Programmers #30 - Software Transactional Memory (STM)
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Haskell for Imperative Programmers
Automatically move to the next video in the Classroom when playback concludes
- 1 Haskell for Imperative Programmers #1 - Basics
- 2 Haskell for Imperative Programmers #2 - Functions, Types, let & where
- 3 Haskell for Imperative Programmers #3 - Recursion, Guards, Patterns
- 4 Haskell for Imperative Programmers #4 - Lists and Tuples
- 5 Haskell for Imperative Programmers #5 - List Exercises
- 6 Haskell for Imperative Programmers #6 - Higher Order Functions & Anonymous Functions
- 7 Haskell for Imperative Programmers #7 - Partial Function Application & Currying
- 8 Haskell for Imperative Programmers #8 - Function Composition
- 9 Haskell for Imperative Programmers #9 - Folding (foldr, foldl)
- 10 Haskell for Imperative Programmers #10 - Datatypes
- 11 Haskell for Imperative Programmers #11 - Folding Exercises
- 12 Haskell for Imperative Programmers #12 - Records
- 13 Haskell for Imperative Programmers #13 - Typeclasses
- 14 Haskell for Imperative Programmers #14 - Maybe
- 15 Haskell for Imperative Programmers #15 - IO
- 16 Haskell for Imperative Programmers #16 - Type inference
- 17 Haskell for Imperative Programmers #17 - Monads
- 18 Haskell for Imperative Programmers #18 - QuickCheck
- 19 Haskell for Imperative Programmers #19 - Infinite Lists
- 20 Haskell for Imperative Programmers #20 - Advanced Exercises
- 21 Haskell for Imperative Programmers #21 - data, type & newtype
- 22 Haskell for Imperative Programmers #22 - Either
- 23 Haskell for Imperative Programmers #23 - Modules
- 24 Haskell for Imperative Programmers #24 - Environment
- 25 Haskell for Imperative Programmers #25 - Compiling Binaries
- 26 Haskell for Imperative Programmers #26 - Strictness, Thunks & seq
- 27 Haskell for Imperative Programmers #27 - Exceptions
- 28 Haskell for Imperative Programmers #28 - Concurrency & Threads
- 29 Haskell for Imperative Programmers #29 - Semaphores (QSem, QSemN)
- 30 Haskell for Imperative Programmers #30 - Software Transactional Memory (STM)
- 31 Haskell for Imperative Programmers #31 - Weak Head Normal Form
- 32 Haskell for Imperative Programmers #32 - DeepSeq
- 33 Haskell for Imperative Programmers #33 - Parallelism
- 34 Haskell for Imperative Programmers #34 - Profiling
- 35 Haskell for Imperative Programmers #35 - Semigroup & Monoid
- 36 Haskell for Imperative Programmers #36 - Category Theory (Functors, Applicatives, Monads)
- 37 Haskell for Imperative Programmers #37 - Arrows
- 38 Haskell for Imperative Programmers #38 - Monad Transformers
- 39 Haskell for Imperative Programmers #39 - Induction Proofs
- 40 Haskell for Imperative Programmers #40 - Termination Proofs
- 41 Haskell for Imperative Programmers #41 - Formal Verification (using Isabelle)
- 42 Haskell for Imperative Programmers #42 - QuickSpec
- 43 Haskell for Imperative Programmers #43 - Cabal
