X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fbasic_2%2Fweb%2Fbasic_2.ldw.xml;h=33d86efdac9451a5cc6a974596fc3564761ef212;hp=e40771d8e9b64d16545e0ed4c57a2c82d65d097e;hb=1fd63df4c77f5c24024769432ea8492748b4ac79;hpb=277fc8ff21ce3dbd6893b1994c55cf5c06a98355 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 e40771d8e..33d86efda 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 @@ -26,159 +26,82 @@ - Stage "B" - + + λδ-2B is repackaged without λδ-ground-2. + + λδ-2B is released. - + Applicability condition is now parametrized with a generic subset of numbers. - + Applicability condition parametrized with an initial interval of numbers allows λδ-2B to generalize both λδ-2A and λδ-1B. - + Extended (λδ-2A) and restricted (λδ-1B) validity is decidable (anniversary milestone). - + Preservation of validity for rt-computation does not need the sort degree parameter (i.e. no induction on the degree). - + Extended (λδ-2A) and restricted (λδ-1B) validity 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" - - λδ-2A is repackaged (was λδ-2A1). - - - λδ-2A appears too complex and is dismissed. - - - λδ-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 - added as q-step to rst-computation on closures - (anniversary milestone). - - - 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 rt-reduction. - - - 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 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. - - - Generic candidates of reducibility. - - - Confluence for context-sensitive parallel reduction on terms. - - - Confluence for context-free parallel reduction on terms. - - - λδ-2A is started. - - Logical Structure of the Specification This table reports the specification's components and their planes.