]> matita.cs.unibo.it Git - helm.git/blobdiff - matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml
- lambdadelta: tentative definition of lazy equivalence for closures +
[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / web / basic_2.ldw.xml
index 76c69725fa16399e7c42db4710c58d093b1bd4fb..f596851ee8c5cce47a430c4e98fd8d8c55d4fb5d 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"
+         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].
+         pp. 53-78].
    </body>
    <table name="basic_2_sum"/>
    <news date="In progress.">
@@ -35,7 +35,7 @@
    </news>
    <news date="2013 August 7.">
          Passive support for global environments.
-   </news>   
+   </news>
    <news date="2013 July 27.">
          Reaxiomatized β-reductum as in extended β-reduction
    </news>
          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.