From f687552465f86bfd66ada997a26486b2a20d5363 Mon Sep 17 00:00:00 2001
From: herbelin
Date: Thu, 21 Mar 2013 19:12:58 +0000
Subject: Fixing an old pecularity of "red": head betaiota redexes are now
 reduced in order to find some head constant to reduce.

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@16337 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 doc/refman/RefMan-tac.tex | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

(limited to 'doc')

diff --git a/doc/refman/RefMan-tac.tex b/doc/refman/RefMan-tac.tex
index d59e62640e..a2d02a4ca8 100644
--- a/doc/refman/RefMan-tac.tex
+++ b/doc/refman/RefMan-tac.tex
@@ -2899,7 +2899,9 @@ computational expressions (i.e. with few dead code).
 \tacindex{red}
 
 This tactic applies to a goal that has the form {\tt
-  forall (x:T1)\dots(xk:Tk), c t1 \dots\ tn} where {\tt c} is a constant.  If
+  forall (x:T1)\dots(xk:Tk), t} with {\tt t}
+$\beta\iota\zeta$-reducing to {\tt c t1 \dots\ tn} and {\tt c} a
+constant.  If
 {\tt c} is transparent then it replaces {\tt c} with its definition
 (say {\tt t}) and then reduces {\tt (t t1 \dots\ tn)} according to
 $\beta\iota\zeta$-reduction rules.
-- 
cgit v1.2.3