From d619a834de7548649f53d59ec4fc9e892b33d24c Mon Sep 17 00:00:00 2001
From: msozeau
Date: Tue, 22 Jul 2008 14:35:51 +0000
Subject: A try at allowing matching on applications as a binary syntax node by
 default. It breaks tauto as [?X _ _] matches much more terms. It is mostly
 fixed by not destructing objects of record types. The new [intuition] was
 also pulling an unneeded dependency in Field_theory which can be cleared
 easily. Zis_gcd_bezout is also considered a conjunction now, which seems
 correct(?).

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@11243 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 pretyping/matching.ml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'pretyping')

diff --git a/pretyping/matching.ml b/pretyping/matching.ml
index 9a3130605e..09db049e46 100644
--- a/pretyping/matching.ml
+++ b/pretyping/matching.ml
@@ -208,7 +208,7 @@ let matches_core convert allow_partial_app pat c =
   let names,terms = sorec [] ([],[]) pat c in
   (names,Sort.list (fun (a,_) (b,_) -> a<b) terms)
 
-let extended_matches = matches_core None false
+let extended_matches = matches_core None true
 
 let matches c p = snd (matches_core None false c p)
 
-- 
cgit v1.2.3