- lambdadelta: tentative definition of lazy equivalence for closures +

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / web / basic_2.ldw.xml
diff --git a/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml b/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml

index b2cadf0d28d42d383f7858061959bb851f030c97..f596851ee8c5cce47a430c4e98fd8d8c55d4fb5d 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml
+++ b/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml
@@ -19,6 +19,10 @@
     <section>Summary of the Specification</section>
     <body>Here is a numerical acount of the specification's contents
           and its timeline.
+         Nodes are counted according to the "intrinsinc complexity measure"
+         [F. Guidi: "Procedural Representation of CIC Proof Terms"
+         Journal of Automated Reasoning 44(1-2), Springer (February 2010),
+         pp. 53-78].
     </body>
     <table name="basic_2_sum"/>
     <news date="In progress.">
@@ -29,7 +33,10 @@
           Closure of context-sensitive extended computation
           for native validity.
     </news>
-   <news date="In progress.">
+   <news date="2013 August 7.">
+         Passive support for global environments.
+   </news>
+   <news date="2013 July 27.">
           Reaxiomatized β-reductum as in extended β-reduction
     </news>
     <news date="2013 July 20.">
@@ -37,13 +44,13 @@
           for simply typed terms.
     </news>
     <news date="2013 April 16.">
-         Reaxiomatized substitution and reduction 
+         Reaxiomatized substitution and reduction
           commute with respect to subclosure
           (anniversary milestone).
     </news>
     <news date="2013 March 16.">
           Mutual recursive preservation of stratified native validity
-         for hyper computation on closures.
+         for "big tree" computation on closures.
     </news>
     <news date="2012 October 16.">
           Confluence for context-free parallel reduction on closures.