]> matita.cs.unibo.it Git - helm.git/blobdiff - matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml
commit completed: now we support two versions of slicing for local
[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / web / basic_2.ldw.xml
index d8206ed982e239c5ef674bd7fefaaba3f5ed4e2d..06a65ff53fe3b3c2074b6bd4053378c9a4e4bddc 100644 (file)
    <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.">
          for native type assignment.
    </news>
    <news date="In progress.">
-         Closure of extended context-sensitive computation
+         Closure of context-sensitive extended computation
          for native validity.
    </news>
-   <news date="In progress.">
-         Extended context-sensitive strong normalization
+   <news date="2014 January 20.">
+         Parametrized slicing for local environments
+        comprises both versions of this operation
+        (one from basic_1, the other used in basic_2 till now).
+   </news>
+   <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.">
+         Context-sensitive extended strong normalization
          for simply typed terms.
    </news>
+   <news date="2013 April 16.">
+         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.
    </news>
    <news date="2012 July 26.">
-         Term binders polarized to control ζ reduction.
+         Term binders polarized to control ζ-reduction.
    </news>
    <news date="2012 April 16.">
          Context-sensitive subject equivalence
@@ -68,7 +88,7 @@
    <section>Logical Structure of the Specification</section>
    <body>The source files are grouped in planes and components
          according to the following table.
-         A notation file covering the whole specification is provided.
+         Notation files covering the whole specification are provided.
          The notation for the relations or functions introduced in each file
          is shown in parentheses (? are placeholders).
    </body>