Pass over MoreDep

latex/cpdt.bib

@@ -201,4 +201,14 @@
   title = 	 {Separation Logic: A Logic for Shared Mutable Data Structures},
   booktitle =    {Proceedings of the IEEE Symposium on Logic in Computer Science},
   year = 	 {2002}
-}
\ No newline at end of file
+}
+
+@article{Okasaki,
+ author = {Okasaki, Chris},
+ title = {Red-black trees in a functional setting},
+ journal = {J. Funct. Program.},
+ volume = {9},
+ issue = {4},
+ year = {1999},
+ pages = {471--477},
+} 

src/Subset.v

@@ -326,7 +326,7 @@ end
      : forall n : nat, n > 0 -> {m : nat | n = S m}
 ]]
 
-We are almost done with the ideal implementation of dependent predecessor.  We can use Coq's syntax extension facility to arrive at code with almost no complexity beyond a Haskell or ML program with a complete specification in a comment. *)
+We are almost done with the ideal implementation of dependent predecessor.  We can use Coq's syntax extension facility to arrive at code with almost no complexity beyond a Haskell or ML program with a complete specification in a comment.  In this book, we will not dwell on the details of syntax extensions; the Coq manual gives a straightforward introduction to them. *)
 
 Notation "!" := (False_rec _ _).
 Notation "[ e ]" := (exist _ e _).

staging/updates.rss

@@ -11,6 +11,13 @@
 <webMaster>adam@chlipala.net</webMaster>
 <docs>http://blogs.law.harvard.edu/tech/rss</docs>
 
+<item>
+        <title>A pass through "More Dependent Types"</title>
+        <pubDate>Mon, 10 Oct 2011 15:59:55 EDT</pubDate>
+        <link>http://adam.chlipala.net/cpdt/</link>
+        <author>adamc@csail.mit.edu</author>
+</item>
+
 <item>
         <title>A pass through "Subset Types and Variations"</title>
         <pubDate>Wed, 5 Oct 2011 11:32:54 EDT</pubDate>