comparison staging/updates.rss @ 380:31fa03bc0f18

Get it to build with Coq 8.4
author Adam Chlipala <adam@chlipala.net>
date Thu, 29 Mar 2012 18:10:52 -0400
parents 6413675f8e04
children d5112c099fbf
comparison
equal deleted inserted replaced
379:e23d41ae63be 380:31fa03bc0f18
10 <managingEditor>adam@chlipala.net</managingEditor> 10 <managingEditor>adam@chlipala.net</managingEditor>
11 <webMaster>adam@chlipala.net</webMaster> 11 <webMaster>adam@chlipala.net</webMaster>
12 <docs>http://blogs.law.harvard.edu/tech/rss</docs> 12 <docs>http://blogs.law.harvard.edu/tech/rss</docs>
13 13
14 <item> 14 <item>
15 <title>Update to work with Coq 8.4 beta (and keep working with 8.3pl2)</title>
16 <pubDate>Thu, 29 Mar 2012 18:10:00 EDT</pubDate>
17 <link>http://adam.chlipala.net/cpdt/</link>
18 <author>adamc@csail.mit.edu</author>
19 </item>
20
21 <item>
15 <title>Two new tricks useful in proof by reflection</title> 22 <title>Two new tricks useful in proof by reflection</title>
16 <pubDate>Thu, 29 Mar 2012 17:12:01 EDT</pubDate> 23 <pubDate>Thu, 29 Mar 2012 17:12:01 EDT</pubDate>
17 <link>http://adam.chlipala.net/cpdt/</link> 24 <link>http://adam.chlipala.net/cpdt/</link>
18 <author>adamc@csail.mit.edu</author> 25 <author>adamc@csail.mit.edu</author>
19 <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> 26 <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>