- 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 5ebf0e0b30bbdec21a6d84c2837ec3ba3394ea06..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
@@ -50,7 +50,7 @@
    </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.