- we introduce recursive free variables of a term in a context ...

[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 a9008510efef4517a9be55c26b05c9fa8c401273..9a3e5d490f08f88a6c4588e3495b289bfe0f9576 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/names.txt
+++ b/matita/matita/contribs/lambdadelta/basic_2/names.txt
@@ -76,11 +76,11 @@ 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
+w: reserved for generic pointwise extension
 x: extended reduction
 y: extended substitution
 
@@ -94,3 +94,4 @@ 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