aboutsummaryrefslogtreecommitdiff
path: root/CHANGES
diff options
context:
space:
mode:
authorherbelin2011-10-11 19:18:06 +0000
committerherbelin2011-10-11 19:18:06 +0000
commit454ec4db2fcbaef9c67f4b1a4889f47d18795882 (patch)
tree9dbabcc73533f96d6355643b7fa578341611d658 /CHANGES
parent6fd6bb20f0263667e23cd02ec03beb8d81b60785 (diff)
Completing r14538 (Chung-Kil Hur's trick for fast dependently-typed
second-order matching) which was not working correctly in the general case. Also made that second-order matching for tactics (abstract_list_all) uses this algorithm, along the lines of a proposal first experimented by Dan Grayson (see unification.v). git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@14549 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'CHANGES')
-rw-r--r--CHANGES5
1 files changed, 5 insertions, 0 deletions
diff --git a/CHANGES b/CHANGES
index 9320735c4b..6b071342b3 100644
--- a/CHANGES
+++ b/CHANGES
@@ -50,6 +50,11 @@ Tactics
This pseudo-database "nocore" can also be used with trivial and eauto.
- Tactics "set", "destruct" and "induction" accepts incomplete terms and
use the goal to complete the pattern assuming it is no ambiguous.
+- When used on arguments with a dependent type, tactics such as
+ "destruct", "induction", "case", "elim", etc. now try to abstract
+ automatically the dependencies over the arguments of the types
+ (based on initial ideas from Chung-Kil Hur, extension to nested
+ dependencies suggested by Dan Grayson)
Vernacular commands