About "apply in":

- Added "simple apply in" (cf wish 1917) + conversion and descent
  under conjunction + contraction of useless beta-redex in "apply in"
  + support for open terms.
- Did not solve the "problem" that "apply in" generates a let-in which
  is type-checked using a kernel conversion in the opposite side of what
  the proof indicated (hence leading to a potential unexpected penalty
  at Qed time).
- When applyng a sequence of lemmas, it would have been nice to allow
  temporary evars as intermediate steps but this was too long to implement.

Smoother API in tactics.mli for assert_by/assert_as/pose_proof.



git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@11662 85f007b7-540e-0410-9357-904b9bb8a0f7

1 files changed, 8 insertions, 8 deletions

diff --git a/CHANGES b/CHANGES
index ffae4eb00f..df1b82a98c 100644
--- a/CHANGES
+++ b/CHANGES
@@ -285,14 +285,14 @@ Tactics
 - New syntax "rename a into b, c into d" for "rename a into b; rename c into d"
 - New tactics "dependent induction/destruction H [ generalizing id_1 .. id_n ]"
   to do induction-inversion on instantiated inductive families à la BasicElim.
-- Tactic "apply" now able to reason modulo unfolding of constants
-  (possible source of incompatibility in situations where apply may fail, 
-  e.g. as argument of a try or a repeat and in a ltac function);
-  version of apply that does not unfold is renamed into "simple apply"
-  (usable for compatibility or for automation).
-- Tactic "apply" now able to traverse conjunctions and to select the first 
-  matching lemma among the components of the conjunction; tactic apply also
-  able to apply lemmas of conclusion an empty type.
+- Tactics "apply" and "apply in" now able to reason modulo unfolding of 
+  constants (possible source of incompatibility in situations where apply 
+  may fail, e.g. as argument of a try or a repeat and in a ltac function);
+  versions that do not unfold are renamed into "simple apply" and 
+  "simple apply in" (usable for compatibility or for automation).
+- Tactics "apply" and "apply in" now able to traverse conjunctions and to 
+  select the first matching lemma among the components of the conjunction; 
+  tactic "apply" also able to apply lemmas of conclusion an empty type.
 - Tactic "apply" now supports application of several lemmas in a row.
 - Tactics "set" and "pose" can set functions using notation "(f x1..xn := c)".
 - New tactic "instantiate" (without argument).