Higher order Abstractions
summary
Defines and compares concrete Haskell type class implementations: Contravariant contramap :: (a -> b) -> f b -> f a with Predicate and function examples, BiFunctor with tuple and Either examples, and Profunctor with dimap-style mapping tying to optics. Explains functor/contravariant/invariant distinction via counting arrow positions, states the laws for each class, uses diagrams on slides to show data flow, and demonstrates when instances exist or fail for real types so viewer knows whether code examples and proofs are present.
AI-written summary · about
chapters (10)
- 0:00Intro
- 0:50Functor
- 2:43ByMap
- 3:19Bi Functions
- 4:01Contravariant Contour Map
- 4:38Contravariant Functions
- 6:08Pop Quiz
- 8:30CoFunctor
- 9:12ProFunctor
- 9:53Example
related talks
35mThe Functor, Applicative, Monad talk
26mAbstraction Functions as Types
30mTHINGS THAT ARE THINGS, BUT NOT OTHER THINGS
36mGoing Higher
56mCategory Theory Through Functional Programming (part 2/3)
54mCategory Theory Through Functional Programming (part 3/3)
21mFunctorial Syntax for All
01h 16mFunctional Composition Beyond Monads