Ported permutation.ma and fermat_little_theorem.ma

[helm.git] / matita / matita / contribs / lambda / policy.txt

diff --git a/matita/matita/contribs/lambda/policy.txt b/matita/matita/contribs/lambda/policy.txt
index 4d6e5bd8c0017847eb4a0de80452745299992d62..33fc5979b3592672612fa9f46e970f8ef076902a 100644 (file)
--- a/matita/matita/contribs/lambda/policy.txt
+++ b/matita/matita/contribs/lambda/policy.txt
@@ -1,14 +1,24 @@
 NAMING CONVENTIONS FOR METAVARIABLES
 
 A, B, C, D: term
+F,G       : subset of subterms
 H         : transient premise
 IH        : inductive premise
 M, N      : term
+P, Q      : pointer tree
+R         : arbitrary relation
+S         : arbitrary small type
+T, U, V, W: subset of subterms
 
-a, b      : boolean
-d, e      : variable reference depth 
+a         : arbitrary element
+b         : boolean mark
+c         : pointer step
+d, e      : variable reference level
 h         : relocation height
-i, j      : de Bruijn index
+i, j      : variable reference depth (de Bruijn index)
 k         : relocation height
-p, q      : redex pointer
-r, s      : redex pointer sequence
+l         : arbitrary list
+m, n      : measures on terms
+p, q      : pointer
+r, s      : pointer sequence
+