Difference between revisions of "User:Michiexile/MATH198"

From HaskellWiki
Jump to navigation Jump to search
 
(7 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
==Course overview==
  
==Course overview==
   
−
Page is work in progress for background material for the Fall 2009 lecture course MATH198[http://coursework.stanford.edu/homepage/F09/F09-MATH-198-01.html] on Category Theory and Functional Programming that I am planning to give at Stanford University.
 +
Page is the background material for the Fall 2009 lecture course MATH198[http://coursework.stanford.edu/homepage/F09/F09-MATH-198-01.html] on Category Theory and Functional Programming that I gave at Stanford University.
   
 
Single unit course. 10 lectures. Each lecture is Wednesday 4.15-5.05 in 380F.
  
Single unit course. 10 lectures. Each lecture is Wednesday 4.15-5.05 in 380F.
Line 33: Line 33:
 
** Functors.
  
** Functors.
 
** Category of categories.
  
** Category of categories.
  ⚫
** Natural transformations.
   
 
* [[User:Michiexile/MATH198/Lecture 4]]
  
* [[User:Michiexile/MATH198/Lecture 4]]
  ⚫
** Products, coproducts.
⚫
** Natural transformations.
  
  ⚫
** The power of dualization.
⚫
** Adjunctions.
  
  +
** The algebra of datatypes
⚫
** Free and forgetful.
  
  +
   
 
* [[User:Michiexile/MATH198/Lecture 5]]
  
* [[User:Michiexile/MATH198/Lecture 5]]
⚫
** The power of dualization.
  
 
** Limits, colimits.
  
** Limits, colimits.
  +
⚫
** Products, coproducts.
  
  ⚫
* [[User:Michiexile/MATH198/Lecture 6]]
 
** Equalizers, coequalizers.
  
** Equalizers, coequalizers.
  +
** Pushouts/pullbacks
  ⚫
** Adjunctions.
  ⚫
** Free and forgetful.
   
  +
⚫
* [[User:Michiexile/MATH198/Lecture 6]]
  
  ⚫
* [[User:Michiexile/MATH198/Lecture 7]]
−
** Monoids.
  
  ⚫
** Monoid objects.
 
** Monads.
  
** Monads.
 
** Triples.
  
** Triples.
−
** The Kleisli category.
 +
** Kleisli category.
 
** Monad factorization.
  
** Monad factorization.
−  
−  
⚫
* [[User:Michiexile/MATH198/Lecture 7]]
  
−
** Recursion as a categorical construction.
 
−
** Recursive categories.
  
−
** Recursion as fixed points of monad algebras.
  
−
** Recursion using special morphisms.
  
−
*** Hylo-
  
−
*** Zygo-
  
−
*** et.c.
  
   
 
* [[User:Michiexile/MATH198/Lecture 8]]
  
* [[User:Michiexile/MATH198/Lecture 8]]
  +
** Algebras over monads
−
** Topos.
  
  +
** Algebras over endofunctors
−
** Exponentials.
  
  +
** Initial algebras and recursion
⚫
** Power objects.
  
  +
** Lambek's lemma
−
** Cartesian Closed Categories.
  
   
 
* [[User:Michiexile/MATH198/Lecture 9]]
  
* [[User:Michiexile/MATH198/Lecture 9]]
  +
** Catamorphisms
⚫
** Internal logic.
  
  +
** Anamorphisms
  +
** Hylomorphisms
  +
** Metamorphisms
  +
** Paramorphisms
  +
** Apomorphisms
  +
** Properties of adjunctions, examples of adjunctions
   
 
* [[User:Michiexile/MATH198/Lecture 10]]
  
* [[User:Michiexile/MATH198/Lecture 10]]
  +
** Power objects
−
** Review.
  
  +
** Classifying objects
  +
** Topoi
  ⚫
** Internal logic

Latest revision as of 05:51, 24 July 2010

Course overview

Page is the background material for the Fall 2009 lecture course MATH198[1] on Category Theory and Functional Programming that I gave 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.




  • User:Michiexile/MATH198/Lecture 9
    • Catamorphisms
    • Anamorphisms
    • Hylomorphisms
    • Metamorphisms
    • Paramorphisms
    • Apomorphisms
    • Properties of adjunctions, examples of adjunctions
Retrieved from "https://wiki.haskell.org/index.php?title=User:Michiexile/MATH198&oldid=36339"