1 (* Copyright (C) 2003-2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
27 module PEH = ProofEngineHelpers
29 module Cl = ProceduralClassify
31 let is_eliminator = function
32 | _ :: (_, C.MutInd _) :: _ -> true
33 | _ :: (_, C.Appl (C.MutInd _ :: _)) :: _ -> true
36 let is_const = function
41 | C.MutConstruct _ -> true
44 let rec is_appl b = function
45 | C.Appl (hd :: tl) -> List.fold_left is_appl (is_const hd) tl
46 | t when is_const t -> b
51 let classes, rc = Cl.classify c t in
52 let premises, _ = PEH.split_with_whd (c, t) in
54 | Some (i, j, _, _) when i > 1 && i <= List.length classes && is_eliminator premises -> true
56 let _, conclusion = List.hd premises in
57 is_appl true conclusion