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=82019a3bea72f3bd633da5d1c1e78ad4fc8557be;hb=614d006be363d2e2bbfdf8eb3c20c8604d278be1;hp=7a26896f5330ee81d54e6d58a9ea330c48fd2fb6;hpb=bcab3f92c6f815098ecc24eff06bfd3d232eb497;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 7a26896f5..82019a3be 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,11 +1,13 @@ - -
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]. - - Context-sensitive subject equivalence - for native type assignment. - - - Preservation of stratified native validity - for context-sensitive computation on terms. + + + λδ-2B is repackaged for publication. - - "Big tree" strong normalization - for simply typed terms. + + Improved theory of rst-transition. - - lazy equivalence on local environments - serves as irrelevant step in "big tree" computation on closures + + Sort hierarchy parameter removed from unbound rt-transition (anniversary milestone). - - Parametrized slicing for local environments - comprises both versions of this operation - (one from basic_1, the other used in basic_2 till now). + + λδ-2B is repackaged without λδ-ground. - - Passive support for global environments. + + λδ-2B is released. - - Reaxiomatized β-reductum as in extended β-reduction + + Applicability condition is now parametrized + with a generic subset of numbers. - - Context-sensitive extended strong normalization - for simply typed terms. + + Applicability condition parametrized + with an initial interval of numbers + allows λδ-2B to generalize both λδ-2A and λδ-1B. - - Reaxiomatized substitution and reduction - commute with respect to subclosure + + Extended (λδ-2A) and restricted (λδ-1B) validity is decidable (anniversary milestone). - - Mutual recursive preservation of stratified native validity - for "big tree" computation on closures. + + 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. - - Confluence for context-free parallel reduction on closures. + + λδ-2A completed with + confluence of rt-computation and + preservation of validity for rt-computation. - - Term binders polarized to control ζ-reduction (not released). + + Behavioral component rt_computation completed. - - Context-sensitive subject equivalence - for atomic arity assignment + + "Big tree" theorem (anniversary milestone). - - Context-sensitive strong normalization - for simply typed terms. + + 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). - - Support for abstract candidates of reducibility. + + Behavioral component rt_transition completed. - - Confluence for context-sensitive parallel reduction on terms. + + Generic candidates of reducibility. - - Confluence for context-free parallel reduction on terms. + + Confluence for parallel r-transition on referred entries of local environments. - - Specification starts. + + 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. -
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. -