From 454ec4db2fcbaef9c67f4b1a4889f47d18795882 Mon Sep 17 00:00:00 2001
From: herbelin
Date: Tue, 11 Oct 2011 19:18:06 +0000
Subject: 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
---
 CHANGES | 5 +++++
 1 file changed, 5 insertions(+)

(limited to 'CHANGES')

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
 
-- 
cgit v1.2.3