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=ca4970bcb5d75dc7e4f059d2440716e53e83fdc1;hb=6f1f9e20aa2775d41bba64289fc903e6612baaf3;hp=af73af5fc26343c50eebd3dfc4b6f0380b75fb64;hpb=f95f6cb21b86f3dad114b21f687aa5df36088064;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 af73af5fc..ca4970bcb 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,11 @@ +
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" + 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]. + + Stage "B" Context-sensitive subject equivalence for native type assignment. - - Closure of context-sensitive extended computation - for native validity. + + Stage "A": "Weakening the Applicability Condition" + + 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 + Reaxiomatized β-reductum as in rt-reduction. - Context-sensitive extended strong normalization + 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 @@ -83,7 +107,7 @@
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. + 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).