Search results

Page title matches

• User:Michiexile
  * [[User:Michiexile/MATH198|Stanford MATH 198: Category Theory for Functional Programming]]
  501 bytes (73 words) - 12:49, 3 September 2009
• User:Michiexile/MATH198
  * [[User:Michiexile/MATH198/Lecture 1]] * [[User:Michiexile/MATH198/Lecture 2]]
  2 KB (184 words) - 05:51, 24 July 2010
• User:Michiexile/MATH198/Lecture 4
  Recall from [[User:Michiexile/MATH198/Lecture_3|Lecture 3]] that we can consider endofunctors as containe
  11 KB (2,014 words) - 06:07, 22 October 2009
• User:Michiexile/MATH198/Lecture 5
  Recall when we talked about internal homs in [[User:Michiexile/MATH198/Lecture 2|Lecture 2]]. We can now define what we mean, formally, by For both of these, the argument is almost identical to the one in [[User:Michiexile/MATH198/Lecture 5#Limits we've already seen|the limits section]] above.
  18 KB (3,328 words) - 06:32, 28 October 2009
• User:Michiexile/MATH198/Lecture 6
  17 KB (3,008 words) - 19:19, 3 November 2009
• User:Michiexile/MATH198/Lecture 7
  12 KB (2,218 words) - 19:16, 4 November 2009
• User:Michiexile/MATH198/Lecture 8
  16 KB (2,852 words) - 15:45, 22 November 2009
• User:Michiexile/MATH198/Lecture 9
  14 KB (2,489 words) - 18:40, 17 November 2009
• User:Michiexile/MATH198/Lecture 1
  25 KB (4,385 words) - 02:50, 22 June 2012
• User:Michiexile/MATH198/Lecture 10
  29 KB (5,077 words) - 18:21, 2 December 2009
• User:Michiexile/SU09 Course Overview
  #redirect [[User:Michiexile/MATH198]]
  37 bytes (4 words) - 12:46, 3 September 2009
• User:Michiexile/SU09 Lecture 2
  8 KB (1,285 words) - 22:54, 22 September 2009
• User:Michiexile/MATH198/Lecture 2
  ...not all bijective homomorphisms are isomorphisms. See the notes for [[User:Michiexile/MATH198/Lecture 1|Lecture 1]] for details on posets and order-preserving ma ...rphisms? Definition of a graph and a graph homomorphism occurred in [[User:Michiexile/MATH198/Lecture 1|Lecture 1]].
  18 KB (3,153 words) - 06:10, 7 December 2009
• User:Michiexile/SU09 Lecture 1
  #redirect [[User:Michiexile/MATH198/Lecture 1]]
  47 bytes (5 words) - 12:47, 3 September 2009
• User:Michiexile/MATH198/Lecture 3
  19 KB (3,419 words) - 01:21, 8 October 2009

Page text matches

• User:Michiexile/MATH198
  * [[User:Michiexile/MATH198/Lecture 1]] * [[User:Michiexile/MATH198/Lecture 2]]
  2 KB (184 words) - 05:51, 24 July 2010
• User:Michiexile
  * [[User:Michiexile/MATH198|Stanford MATH 198: Category Theory for Functional Programming]]
  501 bytes (73 words) - 12:49, 3 September 2009
• User:Michiexile/MATH198/Lecture 5
  Recall when we talked about internal homs in [[User:Michiexile/MATH198/Lecture 2|Lecture 2]]. We can now define what we mean, formally, by For both of these, the argument is almost identical to the one in [[User:Michiexile/MATH198/Lecture 5#Limits we've already seen|the limits section]] above.
  18 KB (3,328 words) - 06:32, 28 October 2009
• User:Michiexile/MATH198/Lecture 2
  ...not all bijective homomorphisms are isomorphisms. See the notes for [[User:Michiexile/MATH198/Lecture 1|Lecture 1]] for details on posets and order-preserving ma ...rphisms? Definition of a graph and a graph homomorphism occurred in [[User:Michiexile/MATH198/Lecture 1|Lecture 1]].
  18 KB (3,153 words) - 06:10, 7 December 2009
• User:Michiexile/MATH198/Lecture 4
  Recall from [[User:Michiexile/MATH198/Lecture_3|Lecture 3]] that we can consider endofunctors as containe
  11 KB (2,014 words) - 06:07, 22 October 2009
• Es/Teoría de Categorías y Programación Funcional @ Stanford: Clase 1
  ...itulo=Teoría de Categorías y Programación Funcional: Clase 1|original=User:Michiexile/MATH198 }}
  21 KB (3,823 words) - 14:25, 4 August 2011

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)