Mercurial > cpdt > repo
comparison staging/index.html @ 308:d092baf477ae
New release
| author | Adam Chlipala <adam@chlipala.net> |
|---|---|
| date | Thu, 25 Aug 2011 14:55:38 -0400 |
| parents | 20c742997dae |
| children | 8cb9e31f86e7 |
comparison
equal
deleted
inserted
replaced
| 307:d2cb78f54454 | 308:d092baf477ae |
|---|---|
| 30 </div> | 30 </div> |
| 31 | 31 |
| 32 <div class="project"> | 32 <div class="project"> |
| 33 <h2>Used by:</h2> | 33 <h2>Used by:</h2> |
| 34 <ul> | 34 <ul> |
| 35 <li> CS252 at Harvard <a href="http://www.cs.harvard.edu/~adamc/cpdt/">(Fall 2008)</a></li> | 35 <li>6.892 at MIT <a href="http://stellar.mit.edu/S/course/6/fa11/6.892/">(Fall 2011)</a></li> |
| 36 <li>CS252 at Harvard <a href="http://www.cs.harvard.edu/~adamc/cpdt/">(Fall 2008)</a></li> | |
| 36 </ul> | 37 </ul> |
| 37 </div> | 38 </div> |
| 38 | 39 |
| 39 <div class="project"> | 40 <div class="project"> |
| 40 <h2>Status</h2> | 41 <h2>Status</h2> |
| 41 | 42 |
| 42 <p>Updated on November 16, 2009 with a version retargeted to Coq 8.2pl1, and then again on January 14, 2011 to support Coq 8.3.</p> | 43 <p>Updated on November 16, 2009 with a version retargeted to Coq 8.2pl1, and then again on January 14, 2011 to support Coq 8.3. On August 25, 2011, I've started passes through all chapters, with an eye toward getting ready both for <a href="http://stellar.mit.edu/S/course/6/fa11/6.892/">my fall class</a> and publication by MIT Press. I'm adding bibliographic references, index entries, and additional exercises, along with the usual tweaks and improvements.</p> |
| 43 | 44 |
| 44 <p>The current version is effectively a beta release. It is intended to be consistent, self-contained, and useful, both for individual study and for introductory theorem-proving classes aimed at students with ML or Haskell experience and with basic familiarity with programming language theory.</p> | 45 <p>The current version is effectively a beta release. It is intended to be consistent, self-contained, and useful, both for individual study and for introductory theorem-proving classes aimed at students with ML or Haskell experience and with basic familiarity with programming language theory.</p> |
| 45 | 46 |
| 46 <p>The main omissions have to do with some supporting resources that I didn't get around to implementing when I used this book for a course. Some suggested exercises are present, but only at points where I was looking to assign an exercise in the course. Some chapters are lacking the annotations used to build reduced versions of their source code, where some definitions and proofs have been elided; the course instructor can step through such a file, guiding class participants in filling in the omitted code.</p> | 47 <p>The main omissions have to do with some supporting resources that I didn't get around to implementing when I used this book for a course. Some suggested exercises are present, but only at points where I was looking to assign an exercise in the course. Some chapters are lacking the annotations used to build reduced versions of their source code, where some definitions and proofs have been elided; the course instructor can step through such a file, guiding class participants in filling in the omitted code.</p> |
| 47 | 48 |
| 48 <p>I'm also not sure how much of the final part, on programming languages and compilers, belongs in this book. It might change significantly or go away.</p> | 49 <p>My current tentative plan is to separate out the final part, on programming languages and compilers, into a distinct, online-only document, but I might be persuaded otherwise.</p> |
| 49 </div> | 50 </div> |
| 50 | 51 |
| 51 </body></html> | 52 </body></html> |