schedule: reformat lists, use auto-numbering in some of them (fixed)

Signed-off-by: Jim Pryor <profjim@jimpryor.net>

diff --git a/schedule_of_topics.mdwn b/schedule_of_topics.mdwn
index 2037b35..eb7cf80 100644 (file)
--- a/schedule_of_topics.mdwn
+++ b/schedule_of_topics.mdwn
@@ -27,7 +27,7 @@ This is very sketchy at this point, but it should give a sense of our intended s
 1.     Representing lists as pairs
 1.     Representing lists as folds
 1.     Typical higher-order functions: map, filter, fold<p>
 1.     Representing lists as pairs
 1.     Representing lists as folds
 1.     Typical higher-order functions: map, filter, fold<p>

-1.     Recursion exploiting the fold-like representation of numbers and lists (deforestation, zippers)
+1.     Recursion exploiting the fold-like representation of numbers and lists ([[!wikipedia Deforestation (computer science)]], [[!wikipedia Zipper (data structure)]])

 1.     General recursion using omega
 1.     The Y combinator(s); more on evaluation strategies<p>
 1.     Introducing the notion of a "continuation", which technique we'll now already have used a few times
 1.     General recursion using omega
 1.     The Y combinator(s); more on evaluation strategies<p>
 1.     Introducing the notion of a "continuation", which technique we'll now already have used a few times