X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fbasic_2%2Fnames.txt;h=d80ea011a72c21b409719bde01ff05a83f6e4b06;hb=c450fdfb1b02eb69e5e7ef25f0acdf80157710df;hp=9a3319f5ca8d09b8ff0f44a78a3189451b3f3593;hpb=cf10254638dab42421a9281a9418001d9bdbc8c0;p=helm.git diff --git a/matita/matita/contribs/lambdadelta/basic_2/names.txt b/matita/matita/contribs/lambdadelta/basic_2/names.txt index 9a3319f5c..d80ea011a 100644 --- a/matita/matita/contribs/lambdadelta/basic_2/names.txt +++ b/matita/matita/contribs/lambdadelta/basic_2/names.txt @@ -9,29 +9,30 @@ IH : reserved: inductive premise I,J : item K,L : local environment M,N : reserved: future use -O,P,Q : -R : generic predicate (relation) +O : +P : relocation environment +Q : elimination predicate +R : generic predicate/relation 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 : reduction kind parameter (true = ordinary, false = extended) -s : local dropping kind parameter (true = general, false = restricted) -t,u : local reference position level (de Bruijn's) (RTM) -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 @@ -40,15 +41,19 @@ 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 @@ -64,6 +69,7 @@ t: context-free for terms - second letter +e: reserved for generic entrywise extension i: irreducible form n: normal form p: reflexive parallel transformation @@ -77,12 +83,14 @@ b: (q)rst-reduction c: conversion 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 u: supclosure w: reserved for generic pointwise extension -x: rt-reduction +x: uncounted rt-transition (extended) y: rt-substitution - forth letter (if present) @@ -95,4 +103,3 @@ q: reflexive closure (question) r: proper multiple step (restricted) (restricted) s: reflexive transitive closure (star) u: proper single step (restricted) (unit) -x: reserved for generic pointwise extension