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=3aff8e423f73848c7ca05cf6e211207152b6032a;hb=084ea7868f6153effc18e8ee1c0e6cdb34d181c0;hp=e6c828efbefc20207e99b25b96b8f12342b6d3d2;hpb=f5924d06e3e5d5a4e16247f51fe675e97433128e;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 e6c828efb..3aff8e423 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
- Here is a numerical acount of the specification's contents + Summary of the Specification + Here is a numerical account 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" - + Stage "B" + + + Extended (λδ-2) and restricted (λδ-1) type rules justified. + + + λδ-2A completed with + confluence of rt-computation and + preservation of validity for rt-computation. + + + Behavioral component rt_computation completed. + + + "Big tree" theorem + (anniversary milestone). + + + Support for rt-computation completed. + + + Exclusion binder in local environments. + Syntactic component updated: + syntax, relocation, s_transition, s_computation, static, i_static. + + + Strong rt-normalization + for simply typed terms + (anniversary milestone). + + + Behavioral component rt_transition completed. + + + Generic candidates of reducibility. + + + Confluence for parallel r-transition on referred entries of local environments. + + + Confluence for context-sensitive parallel r-transition on terms. + + + Syntactic component completed: + syntax, relocation, s_transition, s_computation, static + (anniversary milestone). + + + Relocation with reference transforming maps (rtmap). + + + λδ-2B is started. + - Stage "A": "Weakening the Applicability Condition" - + Stage "A" + + λδ-2A appears too complex and is dismissed. + + + λδ 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. - - "Big tree" strong normalization + + Strong qrst-normalization for simply typed terms. - - lazy equivalence on local environments - serves as irrelevant step in "big tree" computation on closures + + Lazy equivalence on local environments + added as q-step to rst-computation on closures (anniversary milestone). - - Parametrized slicing for local environments + + Parametrized slicing on 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 commute with respect to subclosure (anniversary milestone). - + Mutual recursive preservation of stratified native validity - for "big tree" computation on closures. + for rst-computation on closures. - + Confluence for context-free parallel reduction on closures. - + 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. + + Generic candidates of reducibility. - + Confluence for context-sensitive parallel reduction on terms. - + Confluence for context-free parallel reduction on terms. - - Specification starts. + + λδ-2A is started. -
Logical Structure of the Specification
- The source files are grouped in planes and components - according to the following table. - 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). + 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. -