diff options
| author |  Samuel Mimram <smimram@debian.org> | 2006-04-28 14:59:16 +0000 |
|---|---|---|
| committer | Samuel Mimram <smimram@debian.org> | 2006-04-28 14:59:16 +0000 |
| commit | 3ef7797ef6fc605dfafb32523261fe1b023aeecb (patch) | |
| tree | ad89c6bb57ceee608fcba2bb3435b74e0f57919e /tactics/hipattern.mli | |
| parent | 018ee3b0c2be79eb81b1f65c3f3fa142d24129c8 (diff) | |
Imported Upstream version 8.0pl3+8.1alphaupstream/8.0pl3+8.1alpha
Diffstat (limited to 'tactics/hipattern.mli')
| -rw-r--r-- | tactics/hipattern.mli | 14 |
1 files changed, 5 insertions, 9 deletions
diff --git a/tactics/hipattern.mli b/tactics/hipattern.mli index 7e2aa8f2..1627a8ca 100644 --- a/tactics/hipattern.mli +++ b/tactics/hipattern.mli @@ -6,7 +6,7 @@ (* * GNU Lesser General Public License Version 2.1 *) (************************************************************************) -(*i $Id: hipattern.mli,v 1.13.2.1 2004/07/16 19:30:53 herbelin Exp $ i*) +(*i $Id: hipattern.mli 8652 2006-03-22 08:27:14Z herbelin $ i*) (*i*) open Util @@ -37,8 +37,6 @@ open Proof_trees intersection of the free-rels of the term and the current stack be contained in the arguments of the application *) -val is_imp_term : constr -> bool - (*s I implemented the following functions which test whether a term [t] is an inductive but non-recursive type, a general conjuction, a general disjunction, or a type with no constructors. @@ -98,7 +96,7 @@ val is_sigma_type : testing_function open Coqlib -(* Match terms [(eq A t u)], [(eqT A t u)] or [(identityT A t u)] *) +(* Match terms [(eq A t u)] or [(identity A t u)] *) (* Returns associated lemmas and [A,t,u] *) val find_eq_data_decompose : constr -> coq_leibniz_eq_data * (constr * constr * constr) @@ -113,11 +111,9 @@ val match_sigma : constr -> constr * constr val is_matching_sigma : constr -> bool -(* Match a term of the form [{x=y}+{_}], returns [x] and [y] *) -val match_eqdec_partial : constr -> constr * constr - -(* Match a term of the form [(x,y:t){x=y}+{~x=y}], returns [t] *) -val match_eqdec : constr -> constr +(* Match a decidable equality judgement (e.g [{t=u:>T}+{~t=u}]), returns + [t,u,T] and a boolean telling if equality is on the left side *) +val match_eqdec : constr -> bool * constr * constr * constr * constr (* Match an equality up to conversion; returns [(eq,t1,t2)] in normal form *) open Proof_type |