diff staging/updates.rss @ 378:6413675f8e04

Recursing under binders in reification
author Adam Chlipala <adam@chlipala.net>
date Thu, 29 Mar 2012 17:13:23 -0400
parents 3b36b1e05b4e
children 31fa03bc0f18
line wrap: on
line diff
--- a/staging/updates.rss	Wed Mar 28 13:20:50 2012 -0400
+++ b/staging/updates.rss	Thu Mar 29 17:13:23 2012 -0400
@@ -12,6 +12,14 @@
 <docs>http://blogs.law.harvard.edu/tech/rss</docs>
 
 <item>
+        <title>Two new tricks useful in proof by reflection</title>
+        <pubDate>Thu, 29 Mar 2012 17:12:01 EDT</pubDate>
+        <link>http://adam.chlipala.net/cpdt/</link>
+        <author>adamc@csail.mit.edu</author>
+        <description>The "Universes and Axioms" chapter has a new ending describing a way to avoid axioms in dealing with reified typing environments, and the "Proof by Reflection" chapter has a new ending explaining how to write a reification function that recurses under binders.</description>
+</item>
+
+<item>
         <title>Revisions touching many chapters</title>
         <pubDate>Mon, 26 Mar 2012 16:59:11 EDT</pubDate>
         <link>http://adam.chlipala.net/cpdt/</link>