- big-tree reduction is now based on extended reduction

[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 6c34328b45b311504e6237a4d1eca10c58a6ee5e..353fd787a2c91a82eb2c74a63269e86320a3bd3e 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/names.txt
+++ b/matita/matita/contribs/lambdadelta/basic_2/names.txt
@@ -46,3 +46,42 @@ d: abbreviation
 f: flat
 l: abstraction
 n: native type annotation
+
+NAMING CONVENTIONS FOR TRANSFORMATIONS AND RELATED FORMS
+
+- first letter
+
+c: contex-sensitive for terms
+f: context-freee for closures
+l: sn contex-sensitive for local environments
+r: dx contex-sensitive for local environments
+t: context-free for terms
+
+-second letter
+
+i: irreducible form
+n: normal form
+p: reflexive parallel transformation
+q: sequential transformation
+r: reducible form
+s: strongly normalizing form
+
+- third letter
+
+b: "big tree" reduction
+c: conversion
+d: decomposed extended reduction
+e: decomposed extended conversion
+q: restricted reduction
+r: reduction
+s: substitution
+x: extended reduction
+
+- forth letter (if present)
+
+c: proper single step                          (successor)
+e: reflexive transitive closure to normal form (evaluation)
+g: proper multiple step                        (greater)
+p: non-reflexive transitive closure            (plus)
+q: reflexive closure                           (question)
+s: reflexive transitive closure                (star)