- strongly normalizing terms form a candidate of reducibility

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / rt_computation / csx_gcp.ma

diff --git a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/csx_gcp.ma b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/csx_gcp.ma
index a5bfe6cdf008ddfae45a4c7b49d5cd512b51ac0f..5a0426628a6f19bbb7518e5d5d253c9699433de1 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/rt_computation/csx_gcp.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/rt_computation/csx_gcp.ma
@@ -18,7 +18,7 @@ include "basic_2/rt_computation/csx_drops.ma".
 
 (* STRONGLY NORMALIZING TERMS FOR UNCOUNTED PARALLEL RT-TRANSITION **********)
 
-(* Main properties **********************************************************)
+(* Main properties with generic computation properties **********************)
 
 theorem csx_gcp: ∀h,o. gcp (cpx h) (tdeq h o) (csx h o).
 #h #o @mk_gcp