X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fbasic_2%2Fweb%2Fbasic_2.ldw.xml;h=6b5037b8554376e6edfb40aeb51a2822c4ef9816;hb=e258362c37ec6d9132ec57bd5e4987d148c10799;hp=76c69725fa16399e7c42db4710c58d093b1bd4fb;hpb=d7ccf1bd91637d3c59a285df6f215ecfde2a2450;p=helm.git 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 76c69725f..6b5037b85 100644 --- a/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml +++ b/matita/matita/contribs/lambdadelta/basic_2/web/basic_2.ldw.xml @@ -1,10 +1,12 @@ + + -
Summary of the Specification
+ Summary of the Specification 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]. - + + Stage "B" + Context-sensitive subject equivalence for native type assignment. - - Closure of context-sensitive extended computation - for native validity. + + Stage "A": "Extending the Applicability Condition" + + λδ version 2A is released. + + + Iterated static type assignment defined (more elegantly) + as a primitive notion. + + + Preservation of stratified native validity + for context-sensitive computation on terms. + + + Strong qrst-normalization + for simply typed terms. - + + Lazy equivalence on local environments + addded as q-step to rst-computation on closures + (anniversary milestone). + + + Parametrized slicing of local environments + comprises both versions of this operation + (one from basic_1, the other used in basic_2 till now). + + Passive support for global environments. - - - Reaxiomatized β-reductum as in extended β-reduction - - Context-sensitive extended strong normalization + + Reaxiomatized β-reductum as in rt-reduction. + + + Context-sensitive strong rt-normalization for simply typed terms. - - Reaxiomatized substitution and reduction + + Reaxiomatized substitution and reduction commute with respect to subclosure (anniversary milestone). - + Mutual recursive preservation of stratified native validity - for hyper computation on closures. + for rst-computation on closures. - + Confluence for context-free parallel reduction on closures. - - Term binders polarized to control ζ-reduction. + + Term binders polarized to control ζ-reduction (not released). - + Context-sensitive subject equivalence for atomic arity assignment (anniversary milestone). - + Context-sensitive strong normalization for simply typed terms. - + Support for abstract candidates of reducibility. - + Confluence for context-sensitive parallel reduction on terms. - + Confluence for context-free parallel reduction on terms. - + Specification starts. -
Logical Structure of the Specification
- The source files are grouped in planes and components - according to the following table. - A notation file covering the whole specification is provided. - The notation for the relations or functions introduced in each file - is shown in parentheses (? are placeholders). + Logical Structure of the Specification + This table reports the specification's components and their planes.
-
Physical Structure of the Specification
- The source files are grouped in directories, - one for each component. -