![[lambdadelta home]](http://lambdadelta.info/images/crux_32.png "lambdadelta home")
-
+
+
+ +
+
+
+
+
+
+ | + home + | ++ news + | ++ specification + | +
+ + |
+
+ + |
+ + documentation + | ++ implementation + | +
+ + |
+
| + foreword + | ++ milestones + | ++ version 2 + | +(background - core - applications) | +
+ + |
+ + version 2 + | ++ library + | +(static LDDL directory) | +
| + citations + | ++ visibility + | ++ version 1 + | +(background - core) | +(static HELM directory) | ++ version 1 + | ++ helena + | +
+ + |
+
Summary of the Specification ![[spacer]](http://lambdadelta.info/images/b4.png "lambdadelta butterfly")
+
+
+ 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].
-
+
-
| category | -objects | -+ | category | +objects | +
|
- + |
|
- + |
|
- + |
|
- + |
|
| sizes | -files | -361 | -characters | -652919 | -nodes | -1828390 | +sizes | +files | +360 | +characters | +437272 | +nodes | +1935835 |
| propositions | -theorems | -121 | -lemmas | -1299 | -total | -1420 | +propositions | +theorems | +130 | +lemmas | +1303 | +total | +1433 |
| concepts | -declared | -54 | -defined | -81 | -total | -135 | +concepts | +declared | +54 | +defined | +89 | +total | +143 |
-
+
- - In progress. + Ongoing. Context-sensitive subject equivalence for native type assignment.
- - 2014 June 18. + 2014 October 28. + λδ version 2A is released. + +
- + 2014 September 9. + Iterated static type assignment defined (more elegantly) + as a primitive notion. + +
- + 2014 June 18. Preservation of stratified native validity for context-sensitive computation on terms.
- - 2014 June 9. - "Big tree" strong normalization + 2014 June 9. + Strong qrst-normalization for simply typed terms.
- - 2014 April 16. - lazy equivalence on local environments - serves as irrelevant step in "big tree" computation on closures + 2014 April 16. + Lazy equivalence on local environments + added as q-step to rst-computation on closures (anniversary milestone).
- - 2014 January 20. - Parametrized slicing for local environments + 2014 January 20. + Parametrized slicing of local environments comprises both versions of this operation (one from basic_1, the other used in basic_2 till now).
- - 2013 August 7. + 2013 August 7. Passive support for global environments.
- - 2013 July 27. - Reaxiomatized β-reductum as in extended β-reduction + 2013 July 27. + Reaxiomatized β-reductum as in rt-reduction.
- - 2013 July 20. - Context-sensitive extended strong normalization + 2013 July 20. + Context-sensitive strong rt-normalization for simply typed terms.
- - 2013 April 16. + 2013 April 16. Reaxiomatized substitution and reduction commute with respect to subclosure (anniversary milestone).
- - 2013 March 16. + 2013 March 16. Mutual recursive preservation of stratified native validity - for "big tree" computation on closures. + for rst-computation on closures.
- - 2012 October 16. + 2012 October 16. Confluence for context-free parallel reduction on closures.
- - 2012 July 26. + 2012 July 26. Term binders polarized to control ζ-reduction (not released).
- - 2012 April 16. + 2012 April 16. Context-sensitive subject equivalence for atomic arity assignment (anniversary milestone).
- - 2012 March 15. + 2012 March 15. Context-sensitive strong normalization for simply typed terms.
- - 2012 January 27. + 2012 January 27. Support for abstract candidates of reducibility.
- - 2011 September 21. + 2011 September 21. Confluence for context-sensitive parallel reduction on terms.
- - 2011 September 6. + 2011 September 6. Confluence for context-free parallel reduction on terms.
- - 2011 April 17. + 2011 April 17. Specification starts.
Stage "B"
+ -
+
Stage "A": "Extending the Applicability Condition"
+ -
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
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.
-
+
-
-
-
| component | -plane | -files | -+ | component | +plane | +files | +
|
- + |
|
- + |
|
| dynamic typing | -local env. ref. for stratified native validity | -lsubsv ( ? ⢠? ¡â«[?,?] ? ) | -lsubsv_lsuba lsubsv_lsubd lsubsv_lstas lsubsv_cpds lsubsv_cpcs lsubsv_snv | -+ | examples | +terms with special features | +ex_sta_ldec ex_cpr_omega ex_fpbg_refl ex_snv_eta | +
|
- + |
+ + |
+
|
| + | + | + | + |
|
- stratified native validity | -snv ( �,?⦠⢠? ¡[?,?] ) | -snv_lift snv_aaa snv_da_lpr snv_lstas snv_lstas_lpr snv_lpr snv_cpcs snv_preserve | -+ |
|
- + |
|
| equivalence | -decomposed extended equivalence | -cpes ( â¦?,?⦠⢠? â¢*â¬*[?,?] ? ) | -cpes_cpds | -+ | dynamic typing | +local env. ref. for stratified native validity | +lsubsv ( ? ⢠? â«Â¡[?,?] ? ) | +lsubsv_lsuba lsubsv_lsubd lsubsv_lstas lsubsv_scpds lsubsv_cpcs lsubsv_snv | +
|
- + |
|
| + |
+ + |
+ stratified native validity | +shnv ( �,?⦠⢠? ¡[?,?,?] ) | +
|
- context-sensitive equivalence | -cpcs ( â¦?,?⦠⢠? â¬* ? ) | -cpcs_aaa cpcs_cprs cpcs_cpcs | -+ |
|
- + |
|
| conversion | -context-sensitive conversion | -cpc ( �,?⦠⢠? ⬠? ) | -cpc_cpc | -+ |
|
- + |
|
- ||||
| computation | -evaluation for context-sensitive extended reduction | -cpxe ( â¦?,?⦠⢠â¡*[?,?] ðâ¦?⦠) | -+ | snv ( â¦?,?⦠⢠? ¡[?,?] ) | +snv_lift snv_aaa snv_da_lpr snv_lstas snv_lstas_lpr snv_lpr snv_fsb snv_scpes snv_preserve | +
|
- + |
|
- + | ||
| equivalence | +decomposed rt-equivalence | +scpes ( â¦?,?⦠⢠? â¢*â¬*[?,?,?,?] ? ) | +scpes_aaa scpes_cpcs scpes_scpes | +
+ + |
+
|
||||||
| + |
|
- evaluation for context-sensitive reduction | -cpre ( â¦?,?⦠⢠â¡* ðâ¦?⦠) | -cpre_cpre | -+ | context-sensitive equivalence | +cpcs ( â¦?,?⦠⢠? â¬* ? ) | +cpcs_aaa cpcs_cprs cpcs_cpcs | +
|
- + |
|
| + | conversion | +context-sensitive conversion | +cpc ( �,?⦠⢠? ⬠? ) | +cpc_cpc | +
|
- strongly normalizing "big tree" computation | -fsb ( �,?⦠⢠⦥[?,?] ? ) | -fsb_alt ( �,?⦠⢠⦥⦥[?,?] ? ) | -fsb_aaa fsb_csx | -+ |
|
| + | computation | +evaluation for context-sensitive rt-reduction | +cpxe ( â¦?,?⦠⢠â¡*[?,?] ðâ¦?⦠) | +
|
- strongly normalizing extended computation | -lcosx ( ? ⢠~â¬*[?,?,?] ? ) | -lcosx_cpx | -+ |
|
- + |
|
| + |
|
- + | evaluation for context-sensitive reduction | +cpre ( â¦?,?⦠⢠â¡* ðâ¦?⦠) | +cpre_cpre | +
|
- lsx ( ? ⢠â¬*[?,?,?,?] ? ) | -lsx_alt ( ? ⢠â¬â¬*[?,?,?,?] ? ) | -lsx_drop lsx_lpx lsx_lpxs llsx_csx | -+ |
|
| + |
+ + |
+ strongly normalizing qrst-computation | +fsb ( ⦥[?,?] �,?,?⦠) | +fsb_alt ( ⦥⦥[?,?] �,?,?⦠) | +fsb_aaa fsb_csx | +
|
- + | ||||
|
|
- csx_vector ( â¦?,?⦠⢠â¬*[?,?] ? ) | -csx_tstc_vector csx_aaa | -+ | strongly normalizing rt-computation | +lcosx ( ? ⢠~â¬*[?,?,?] ? ) | +lcosx_cpx | +
|
- + |
|
||
| + |
|
- + |
|
- csx ( â¦?,?⦠⢠â¬*[?,?] ? ) | -csx_alt ( â¦?,?⦠⢠â¬â¬*[?,?] ? ) | -csx_lift csx_lleq csx_lpx csx_lpxs csx_fpbs | -+ | lsx ( ? ⢠â¬*[?,?,?,?] ? ) | +lsx_alt ( ? ⢠â¬â¬*[?,?,?,?] ? ) | +lsx_drop lsx_lpx lsx_lpxs llsx_csx | +
|
| + |
|
- "big tree" parallel computation | -fpbg ( â¦?,?,?⦠>â¡[?,?] â¦?,?,?⦠) | -fpbg_lift fpbg_fleq fpbg_fpbg | -+ |
|
- + | csx_vector ( â¦?,?⦠⢠â¬*[?,?] ? ) | +csx_tsts_vector csx_aaa | +
|
- |
| + |
|
- + | |||||||||
|
|
- fpbc ( â¦?,?,?⦠â»â¡[?,?] â¦?,?,?⦠) | -fpbc_fleq fpbc_fpbs | -+ |
|
- + | csx ( â¦?,?⦠⢠â¬*[?,?] ? ) | +csx_alt ( â¦?,?⦠⢠â¬â¬*[?,?] ? ) | +csx_lift csx_lleq csx_lpx csx_lpxs csx_fpbs | +
|
||
| + |
|
- + | parallel qrst-computation | +fpbg ( â¦?,?,?⦠>â¡[?,?] â¦?,?,?⦠) | +fpbg_lift fpbg_fleq fpbg_fpbs fpbg_fpbg | +
|
- fpbu ( â¦?,?,?⦠â»[?,?] â¦?,?,?⦠) | -fpbu_lift fpbu_lleq | -fpbu_fleq | -+ |
|
| + |
|
- + |
|
- fpbs ( â¦?,?,?⦠â¥[?,?] â¦?,?,?⦠) | -fpbs_alt ( â¦?,?,?⦠â¥â¥[?,?] â¦?,?,?⦠) | -fpbs_lift fpbs_fleq fpbs_aaa fpbs_fpbs fpbs_ext | -+ | fpbs ( â¦?,?,?⦠â¥[?,?] â¦?,?,?⦠) | +fpbs_alt ( â¦?,?,?⦠â¥â¥[?,?] â¦?,?,?⦠) | +fpbs_lift fpbs_aaa fpbs_fpb fpbs_fpbs | +
|
| + |
|
- decomposed extended computation | -cpds ( â¦?,?⦠⢠? â¢*â¡*[?,?] ? ) | -cpds_lift cpds_aaa cpds_cpds | -+ | decomposed rt-computation | +scpds ( â¦?,?⦠⢠? â¢*â¡*[?,?,?] ? ) | +scpds_lift scpds_aaa scpds_scpds | +
|
- + |
|
| + |
|
- context-sensitive extended computation | -lpxs ( â¦?,?⦠⢠â¡*[?,?] ? ) | -lpxs_drop lpxs_lleq lpxs_aaa lpxs_cpxs lpxs_lpxs | -+ | context-sensitive rt-computation | +lpxs ( â¦?,?⦠⢠â¡*[?,?] ? ) | +lpxs_drop lpxs_lleq lpxs_aaa lpxs_cpxs lpxs_lpxs | +
|
- + |
|
| + |
|
- + |
|
- cpxs ( â¦?,?⦠⢠? â¡*[?,?] ? ) | -cpxs_tstc cpxs_tstc_vector cpxs_leq cpxs_lift cpxs_lleq cpxs_aaa cpxs_cpxs | -+ | cpxs ( â¦?,?⦠⢠? â¡*[?,?] ? ) | +cpxs_tsts cpxs_tsts_vector cpxs_lreq cpxs_lift cpxs_lleq cpxs_aaa cpxs_cpxs | +
|
- + |
|
| + |
|
- context-sensitive computation | -lprs ( â¦?,?⦠⢠â¡* ? ) | -lprs_drop lprs_cprs lprs_lprs | -+ | context-sensitive computation | +lprs ( â¦?,?⦠⢠â¡* ? ) | +lprs_drop lprs_cprs lprs_lprs | +
|
- + |
|
| + |
|
- + |
|
- cprs ( â¦?,?⦠⢠? â¡* ?) | -cprs_lift cprs_cprs | -+ | cprs ( â¦?,?⦠⢠? â¡* ?) | +cprs_lift cprs_cprs | +
|
- + |
|
| + |
|
- local env. ref. for abstract candidates of reducibility | -lsubc ( ? ⢠? â«[?] ? ) | -lsubc_drop lsubc_drops lsubc_lsuba | -+ | local env. ref. for generic reducibility | +lsubc ( ? ⢠? â«[?] ? ) | +lsubc_drop lsubc_drops lsubc_lsuba | +
|
- + |
|
| + |
|
- support for abstract computation properties | -acp | -acp_cr ( â¦?,?,?⦠ϵ[?] ã?ã ) | -acp_aaa | -+ | support for generic computation properties | +gcp | +gcp_cr ( â¦?,?,?⦠ϵ[?] ã?ã ) | +gcp_aaa | +
+ + |
+
| reduction | +parallel qrst-reduction | +fpbq ( â¦?,?,?⦠â½[?,?] â¦?,?,?⦠) | +fpbq_alt ( â¦?,?,?⦠â½â½[?,?] â¦?,?,?⦠) | +fpbq_lift fpbq_aaa | +
|
||||||
| reduction | -"big tree" parallel reduction | -fpb ( â¦?,?,?⦠â½[?,?] â¦?,?,?⦠) | -fpb_lift fpb_aaa | -+ |
+ + |
+
+ + |
+ fpb ( â¦?,?,?⦠â»[?,?] â¦?,?,?⦠) | +fpb_lift fpb_lleq fpb_fleq | +
|
- + |
|
| + |
|
- normal forms for context-sensitive extended reduction | -cnx ( â¦?,?⦠⢠â¡[?,?] ðâ¦?⦠) | -cnx_lift cnx_crx cnx_cix | -+ | normal forms for context-sensitive rt-reduction | +cnx ( â¦?,?⦠⢠â¡[?,?] ðâ¦?⦠) | +cnx_lift cnx_crx cnx_cix | +
|
- + |
|
| + |
|
- context-sensitive extended reduction | -lpx ( â¦?,?⦠⢠â¡[?,?] ? ) | -lpx_drop lpx_frees | -lpx_lleq lpx_aaa | -+ | context-sensitive rt-reduction | +lpx ( â¦?,?⦠⢠â¡[?,?] ? ) | +lpx_drop lpx_frees lpx_lleq lpx_aaa | +
+ + |
+
|
| + |
|
- + |
|
- cpx ( â¦?,?⦠⢠? â¡[?,?] ? ) | -cpx_leq cpx_lift cpx_llpx_sn cpx_lleq cpx_cix | -+ | cpx ( â¦?,?⦠⢠? â¡[?,?] ? ) | +cpx_lreq cpx_lift cpx_llpx_sn cpx_lleq cpx_cix | +
|
- + |
|
| + |
|
- irreducible forms for context-sensitive extended reduction | -cix ( â¦?,?⦠⢠â¡[?,?] ðâ¦?⦠) | -cix_lift | -+ | irreducible forms for context-sensitive rt-reduction | +cix ( â¦?,?⦠⢠â¡[?,?] ðâ¦?⦠) | +cix_lift | +
|
- + |
|
| + |
|
- reducible forms for context-sensitive extended reduction | -crx ( â¦?,?⦠⢠â¡[?,?] ðâ¦?⦠) | -crx_lift | -+ | reducible forms for context-sensitive rt-reduction | +crx ( â¦?,?⦠⢠â¡[?,?] ðâ¦?⦠) | +crx_lift | +
|
- + |
|
| + |
|
- normal forms for context-sensitive reduction | -cnr ( â¦?,?⦠⢠⡠ðâ¦?⦠) | -cnr_lift cnr_crr cnr_cir | -+ | normal forms for context-sensitive reduction | +cnr ( â¦?,?⦠⢠⡠ðâ¦?⦠) | +cnr_lift cnr_crr cnr_cir | +
|
- + |
|
| + |
|
- context-sensitive reduction | -lpr ( �,?⦠⢠⡠? ) | -lpr_drop lpr_lpr | -+ | context-sensitive reduction | +lpr ( �,?⦠⢠⡠? ) | +lpr_drop lpr_lpr | +
|
- + |
|
| + |
|
- + |
|
- cpr ( �,?⦠⢠? ⡠? ) | -cpr_lift cpr_llpx_sn cpr_cir | -+ | cpr ( �,?⦠⢠? ⡠? ) | +cpr_lift cpr_llpx_sn cpr_cir | +
|
- + |
|
| + |
|
- irreducible forms for context-sensitive reduction | -cir ( â¦?,?⦠⢠⡠ðâ¦?⦠) | -cir_lift | -+ | irreducible forms for context-sensitive reduction | +cir ( â¦?,?⦠⢠⡠ðâ¦?⦠) | +cir_lift | +
|
- + |
|
| + |
|
- reducible forms for context-sensitive reduction | -crr ( â¦?,?⦠⢠⡠ðâ¦?⦠) | -crr_lift | -+ | reducible forms for context-sensitive reduction | +crr ( â¦?,?⦠⢠⡠ðâ¦?⦠) | +crr_lift | +
|
- + |
|
| unfold | -unfold | -unfold ( �,?⦠⢠? ⧫* ? ) | -+ | unfold | +unfold | +unfold ( �,?⦠⢠? ⧫* ? ) | +
|
- + |
|
- + |
|
| + |
|
- iterated static type assignment | -lstas ( â¦?,?⦠⢠? â¢*[?,?] ? ) | -lstas_alt ( â¦?,?⦠⢠? â¢â¢*[?,?] ? ) | -lstas_lift lstas_aaa lstas_da lstas_lstas | -
- - |
- |||||
| static typing | -local env. ref. for degree assignment | -lsubd ( ? ⢠? âªâ« ? ) | -lsubd_da lsubd_lsubd | -+ | iterated static type assignment | +lstas ( â¦?,?⦠⢠? â¢*[?,?] ? ) | +lstas_lift lstas_llpx_sn.ma lstas_aaa lstas_da lstas_lstas | +
|
- + |
|
|
|
- - |
- degree assignment | -da ( â¦?,?⦠⢠? âª[?,?] ? ) | -da_lift da_aaa da_sta da_da | -+ | static typing | +local env. ref. for degree assignment | +lsubd ( ? ⢠? â«âª[?,?] ? ) | +lsubd_da lsubd_lsubd | +
|
- + |
|
| + |
|
- static type assignment | -sta ( â¦?,?⦠⢠? â¢[?] ? ) | -sta_lift sta_lpx_sn sta_aaa sta_sta | -+ | degree assignment | +da ( â¦?,?⦠⢠? âª[?,?] ? ) | +da_lift da_aaa da_da | +
|
- + |
|
| + |
|
- parameters | -sh | -sd | -+ | parameters | +sh | +sd | +
|
- + |
|
| + |
|
- local env. ref. for atomic arity assignment | -lsuba ( ? ⢠? ââ« ? ) | -lsuba_aaa lsuba_lsuba | -+ | local env. ref. for atomic arity assignment | +lsuba ( ? ⢠? â«â ? ) | +lsuba_aaa lsuba_lsuba | +
|
- + |
|
| + |
|
- atomic arity assignment | -aaa ( â¦?,?⦠⢠? â ? ) | -aaa_lift aaa_lifts aaa_fqus aaa_lleq aaa_aaa | -+ | atomic arity assignment | +aaa ( â¦?,?⦠⢠? â ? ) | +aaa_lift aaa_lifts aaa_fqus aaa_lleq aaa_aaa | +
|
- + |
|
| + |
|
- restricted local env. ref. | -lsubr ( ? â« ? ) | -lsubr_lsubr | -+ | restricted local env. ref. | +lsubr ( ? â« ? ) | +lsubr_lsubr | +
|
- + |
|
| multiple substitution | -lazy equivalence | -fleq ( â¦?,?,?⦠â¡[?] â¦?,?,?⦠) | -fleq_fleq | -+ | multiple substitution | +lazy equivalence | +fleq ( â¦?,?,?⦠â¡[?] â¦?,?,?⦠) | +fleq_fleq | +
|
- + |
|
| + |
|
- + |
|
- lleq ( ? â¡[?,?] ? ) | -lleq_alt lleq_alt_rec lleq_leq lleq_drop lleq_fqus lleq_llor lleq_lleq | -+ | lleq ( ? â¡[?,?] ? ) | +lleq_alt lleq_alt_rec lleq_lreq lleq_drop lleq_fqus lleq_llor lleq_lleq | +
|
- + |
|
| + |
|
- lazy pointwise extension of a relation | -llpx_sn | -llpx_sn_alt llpx_sn_alt_rec llpx_sn_tc llpx_sn_leq llpx_sn_drop llpx_sn_lpx_sn llpx_sn_frees llpx_sn_llor | -+ | lazy pointwise extension of a relation | +llpx_sn | +llpx_sn_alt llpx_sn_alt_rec llpx_sn_tc llpx_sn_lreq llpx_sn_drop llpx_sn_lpx_sn llpx_sn_frees llpx_sn_llor | +
|
- + |
|
| + |
|
- pointwise union for local environments | -llor ( ? â©[?,?] ? â¡ ? ) | -llor_alt llor_drop | -+ | pointwise union for local environments | +llor ( ? â[?,?] ? â¡ ? ) | +llor_alt llor_drop | +
|
- + |
|
| + |
|
- context-sensitive exclusion from free variables | -frees ( ? ⢠? ϵ ð *[?]â¦?⦠) | -frees_append frees_leq frees_lift | -+ | context-sensitive exclusion from free variables | +frees ( ? ⢠? ϵ ð *[?]â¦?⦠) | +frees_append frees_lreq frees_lift | +
|
- + |
|
| + |
|
- contxt-sensitive extended multiple substitution | -cpys ( â¦?,?⦠⢠? â¶*[?,?] ? ) | -cpys_alt ( â¦?,?⦠⢠? â¶â¶*[?,?] ? ) | -cpys_lift cpys_cpys | -+ | context-sensitive multiple rt-substitution | +cpys ( â¦?,?⦠⢠? â¶*[?,?] ? ) | +cpys_alt ( â¦?,?⦠⢠? â¶â¶*[?,?] ? ) | +cpys_lift cpys_cpys | +
|
| + |
|
- iterated structural successor for closures | -fqus ( â¦?,?,?⦠â* â¦?,?,?⦠) | -fqus_alt fqus_fqus | -+ | iterated structural successor for closures | +fqus ( â¦?,?,?⦠â* â¦?,?,?⦠) | +fqus_alt fqus_fqus | +
|
- + |
|
| + |
|
- + |
|
- fqup ( â¦?,?,?⦠â+ â¦?,?,?⦠) | -fqup_fqup | -+ | fqup ( â¦?,?,?⦠â+ â¦?,?,?⦠) | +fqup_fqup | +
|
- + |
|
| + |
|
- iterated local env. slicing | -drops ( â©*[?,?] ? â¡ ? ) | -drops_drop drops_drops | -+ | iterated local env. slicing | +drops ( â¬*[?,?] ? â¡ ? ) | +drops_drop drops_drops | +
|
- + |
|
| + |
|
- generic term relocation | -lifts_vector ( â§*[?] ? â¡ ? ) | -lifts_lift_vector | -+ | generic term relocation | +lifts_vector ( â¬*[?] ? â¡ ? ) | +lifts_lift_vector | +
|
- + |
|
| + |
|
- + |
|
- lifts ( â§*[?] ? â¡ ? ) | -lifts_lift lifts_lifts | -+ | lifts ( â¬*[?] ? â¡ ? ) | +lifts_lift lifts_lifts | +
|
- + |
|
| + |
|
- support for generic relocation | -gr2 ( @â¦?,?⦠⡠? ) | -gr2_plus ( ? + ? ) | -gr2_minus ( ? â ? â¡ ? ) | -gr2_gr2 | +support for multiple relocation | +mr2 ( @â¦?,?⦠⡠? ) | +mr2_plus ( ? + ? ) | +mr2_minus ( ? â ? â¡ ? ) | +mr2_mr2 |
| substitution | -structural successor for closures | -fquq ( â¦?,?,?⦠â⸮ â¦?,?,?⦠) | -fquq_alt ( â¦?,?,?⦠ââ⸮ â¦?,?,?⦠) | -+ | substitution | +structural successor for closures | +fquq ( â¦?,?,?⦠â⸮ â¦?,?,?⦠) | +fquq_alt ( â¦?,?,?⦠ââ⸮ â¦?,?,?⦠) | +
|
- + |
|
| + |
|
- + |
|
- fqu ( â¦?,?,?⦠â â¦?,?,?⦠) | -+ | fqu ( â¦?,?,?⦠â â¦?,?,?⦠) | +
|
- + |
|
- + |
|
| + |
|
- global env. slicing | -gget ( â©[?] ? â¡ ? ) | -gget_gget | -+ | global env. slicing | +gget ( â¬[?] ? â¡ ? ) | +gget_gget | +
|
- + |
|
| + |
|
- contxt-sensitive extended ordinary substitution | -cpy ( â¦?,?⦠⢠? â¶[?,?] ? ) | -cpy_lift cpy_nlift cpy_cpy | -+ | context-sensitive ordinary rt-substitution | +cpy ( â¦?,?⦠⢠? â¶[?,?] ? ) | +cpy_lift cpy_nlift cpy_cpy | +
|
- + |
|
| + |
|
- local env. ref. for extended substitution | -lsuby ( ? âÃ[?,?] ? ) | -lsuby_lsuby | -+ | local env. ref. for rt-substitution | +lsuby ( ? â[?,?] ? ) | +lsuby_lsuby | +
|
- + |
|
| + |
|
- pointwise extension of a relation | -lpx_sn | -lpx_sn_alt lpx_sn_tc lpx_sn_drop lpx_sn_lpx_sn | -+ | pointwise extension of a relation | +lpx_sn | +lpx_sn_alt lpx_sn_tc lpx_sn_drop lpx_sn_lpx_sn | +
|
- + |
|
| + |
|
- basic local env. slicing | -drop ( â©[?,?,?] ? â¡ ? ) | -drop_append drop_leq drop_drop | -+ | basic local env. slicing | +drop ( â¬[?,?,?] ? â¡ ? ) | +drop_append drop_lreq drop_drop | +
|
- + |
|
| + |
|
- basic term relocation | -lift_vector ( â§[?,?] ? â¡ ? ) | -lift_lift_vector | -+ | basic term relocation | +lift_vector ( â¬[?,?] ? â¡ ? ) | +lift_lift_vector | +
|
- + |
|
| + |
|
- + |
|
- lift ( â§[?,?] ? â¡ ? ) | -lift_neq lift_lift | -+ | lift ( â¬[?,?] ? â¡ ? ) | +lift_neq lift_lift | +
|
- + |
|
| grammar | -equivalence for local environments | -leq ( ? ⩬[?,?] ? ) | -leq_leq | -+ | grammar | +equivalence for local environments | +lreq ( ? ⩬[?,?] ? ) | +lreq_lreq | +
|
- + |
|
| + |
|
- same top term constructor | -tstc ( ? â ? ) | -tstc_tstc tstc_vector | -+ | same top term structure | +tsts ( ? â ? ) | +tsts_tsts tsts_vector | +
|
- + |
|
| + |
|
- closures | -cl_weight ( â¯{?,?,?} ) | -cl_restricted_weight ( â¯{?,?} ) | -+ | closures | +cl_weight ( â¯{?,?,?} ) | +cl_restricted_weight ( â¯{?,?} ) | +
|
- + |
|
| + |
|
- internal syntax | -genv | -+ | internal syntax | +genv | +
|
- + |
|
- + |
|
| + |
|
- + |
|
- lenv | -lenv_weight ( â¯{?} ) | -lenv_length ( |?| ) | -lenv_append ( ? @@ ? ) | +lenv | +lenv_weight ( â¯{?} ) | +lenv_length ( |?| ) | +lenv_append ( ? @@ ? ) |
| + |
|
- + |
|
- term | -term_weight ( â¯{?} ) | -term_simple ( ðâ¦?⦠) | -term_vector | +term | +term_weight ( â¯{?} ) | +term_simple ( ðâ¦?⦠) | +term_vector ( â¶?.? ) |
| + |
|
- + |
|
- item | -+ | item | +
|
- + |
|
- + |
|
| + |
|
- external syntax | -aarity | -+ | external syntax | +aarity | +
|
- + |
|
- + |
|
Physical Structure of the Specification
- The source files are grouped in directories,
- one for each component.
-
-
+
![[Spacer]](http://lambdadelta.info/images/rainbow.png "lambdadelta rainbow rule")
@@ -1275,6 +1384,6 @@
-
Last update: Sun, 29 Jun 2014 22:20:18 +0200
-