theory of cpy is complete!

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / names.txt

diff --git a/matita/matita/contribs/lambdadelta/basic_2/names.txt b/matita/matita/contribs/lambdadelta/basic_2/names.txt
index 5530ee711cb640a1f9bd740c31c647ee5fbf7a7d..1bfe7ed6daa4d21aa6010a26b3f7a2ef503a38fb 100644 (file)
--- 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
@@ -58,7 +58,7 @@ l: sn contex-sensitive for local environments
 r: dx contex-sensitive for local environments
 t: context-free for terms
 
--second letter
+- second letter
 
 i: irreducible form
 n: normal form
@@ -73,17 +73,21 @@ b: "big tree" reduction
 c: conversion
 d: decomposed extended reduction
 e: decomposed extended conversion
+n: reduction for "big tree" normal forms
 q: restricted reduction
 r: reduction
 s: substitution
 u: supclosure
 x: extended reduction
+y: extended substitution
 
 - forth letter (if present)
 
-c: proper single step                          (successor)
+c: proper single step (general)                (successor)
 e: reflexive transitive closure to normal form (evaluation)
-g: proper multiple step                        (greater)
+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)