X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fbasic_2%2Fnames.txt;h=1f1d889d74b0ff1c30d934738fd2d01c0cdff0e2;hb=e62715437a9c39244c9809c00585a5ef44a39797;hp=8b80babf92ea0bc2895d977e0c07a2c1784daade;hpb=ef49e0e7f5f298c299afdd3cbfdc2404ecb93879;p=helm.git diff --git a/matita/matita/contribs/lambdadelta/basic_2/names.txt b/matita/matita/contribs/lambdadelta/basic_2/names.txt index 8b80babf9..1f1d889d7 100644 --- a/matita/matita/contribs/lambdadelta/basic_2/names.txt +++ b/matita/matita/contribs/lambdadelta/basic_2/names.txt @@ -1,9 +1,9 @@ NAMING CONVENTIONS FOR METAVARIABLES A,B : arity -C,D : candidate of reducibility -E,F : RTM environment -G : global environment +C : candidate of reducibility +D,E : RTM environment +F,G : global environment H : reserved: transient premise IH : reserved: inductive premise I,J : item @@ -15,22 +15,22 @@ S : RTM stack T,U,V,W: term X,Y,Z : reserved: transient objet denoted by a capital letter -a,b : binder polarity -c : reserved: future use (lambda_delta 3) -d : relocation depth -e : relocation height -f : -g : sort degree parameter +a : applicability condition (true = restricted, false = general) +b : local dropping kind parameter (true = restricted, false = general) +c : rt-reduction count parameter +d : term degree +e : reserved: future use (\lambda\delta 3) +f,g : local reference transforming map h : sort hierarchy parameter -i,j : local reference position index (de Bruijn's) -k : sort index -l : term degree -m,n : reserved: future use -o : -p,q : global reference position -r,s : -t,u : local reference position level (de Bruijn's) -v,w : +i,j : local reference depth (de Bruijn's) +k,l : global reference level +m,n : iterations +o : sort degree parameter (origin) +p,q : binder polarity +r : +s : sort index +t,u : +v,w : local reference position level (de Bruijn's) (RTM) x,y,z : reserved: transient objet denoted by a small letter NAMING CONVENTIONS FOR CONSTRUCTORS @@ -39,43 +39,65 @@ NAMING CONVENTIONS FOR CONSTRUCTORS 2: binary A: application to vector +E: empty list +F: boolean false +T: boolean true a: application -b: binder +b: generic binder with one argument d: abbreviation -f: flat -l: abstraction +f: generic flat with one argument +i: generic binder for local environments +l: typed abstraction n: native type annotation +u: generic binder with zero argument +x: exclusion NAMING CONVENTIONS FOR TRANSFORMATIONS AND RELATED FORMS -- first letter +- prefix and first letter +b: bi contex-sensitive for local environments c: contex-sensitive for terms f: context-freee for closures l: sn contex-sensitive for local environments r: dx contex-sensitive for local environments +s: stratified (prefix) t: context-free for terms --second letter +- second letter +e: reserved for generic entrywise extension i: irreducible form n: normal form -p: parallel transformation +p: reflexive parallel transformation +q: sequential transformation r: reducible form -s: sequential transformation +s: strongly normalizing form - third letter +b: (q)rst-reduction c: conversion -d: decomposed extended reduction +d: decomposed rt-reduction +e: decomposed rt-conversion +g: counted rt-transition (generic) +m: semi-counted rt-transition (mixed) q: restricted reduction r: reduction s: substitution -x: extended reduction +u: supclosure +w: reserved for generic pointwise extension +x: uncounted rt-transition (extended) +y: rt-substitution - forth letter (if present) -p: non-reflexive transitive closure (plus) -q: reflexive closure (question) -s: reflexive transitive closure (star) +c: proper single step (general) (successor) +e: reflexive transitive closure to normal form (evaluation) +g: proper multiple step (general) (greater) +p: non-reflexive transitive closure (plus) +q: reflexive closure (question) +r: proper multiple step (restricted) (restricted) +s: reflexive transitive closure (star) +u: proper single step (restricted) (unit)