Difference between revisions of "User:Michiexile/MATH198"

From HaskellWiki
Jump to navigation Jump to search
Line 43: Line 43:
 
* [[User:Michiexile/MATH198/Lecture 5]]
 
* [[User:Michiexile/MATH198/Lecture 5]]
 
** Limits, colimits.
 
** Limits, colimits.
** Equalizers, coequalizers.
 
** Simulation using test suites.
 
 
 
 
* [[User:Michiexile/MATH198/Lecture 6]]
 
* [[User:Michiexile/MATH198/Lecture 6]]
 
** Equalizers, coequalizers.
 
** Pushouts/pullbacks
 
** Pushouts/pullbacks
 
** Adjunctions.
 
** Adjunctions.
Line 56: Line 55:
 
** Monads.
 
** Monads.
 
** Triples.
 
** Triples.
** The Kleisli category.
+
** Kleisli category.
 
** Monad factorization.
 
** Monad factorization.
   
 
* [[User:Michiexile/MATH198/Lecture 8]]
 
* [[User:Michiexile/MATH198/Lecture 8]]
  +
** Properties of adjunctions.
** Recursion as a categorical construction.
 
  +
** Examples of adjunctions.
** Recursive categories.
 
  +
** Things that are not adjunctions.
** Recursion as fixed points of monad algebras.
 
** Recursion using special morphisms.
 
*** Hylo-
 
*** Zygo-
 
*** et.c.
 
   
 
* [[User:Michiexile/MATH198/Lecture 9]]
 
* [[User:Michiexile/MATH198/Lecture 9]]
Line 77: Line 72:
 
* [[User:Michiexile/MATH198/Lecture 10]]
 
* [[User:Michiexile/MATH198/Lecture 10]]
 
** Review.
 
** Review.
  +
 
** Recursion as a categorical construction.
 
** Recursive categories.
 
** Recursion as fixed points of monad algebras.
 
** Recursion using special morphisms.
 
*** Hylo-
 
*** Zygo-
 
*** et.c.

Revision as of 21:02, 28 October 2009

Course overview

Page is work in progress for background material for the Fall 2009 lecture course MATH198[1] on Category Theory and Functional Programming that I am planning to give at Stanford University.

Single unit course. 10 lectures. Each lecture is Wednesday 4.15-5.05 in 380F.


  • User:Michiexile/MATH198/Lecture 1
    • Category: Definition and examples.
    • Concrete categories.
      • Set.
      • Various categories capturing linear algebra.
    • Small categories.
      • Partial orders.
      • Monoids.
      • Finite groups.
    • Haskell-Curry isomorphism.




    • Recursion as a categorical construction.
    • Recursive categories.
    • Recursion as fixed points of monad algebras.
    • Recursion using special morphisms.
      • Hylo-
      • Zygo-
      • et.c.