1 (* Copyright (C) 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://helm.cs.unibo.it/
26 let compose_tac ?howmany ?mk_fresh_name_callback t1 t2 (proof, goal) =
27 let _,metasenv,_subst,_,_,_ = proof in
28 let _,context,_ = CicUtil.lookup_meta goal metasenv in
30 CicTypeChecker.type_of_aux' metasenv context t1 CicUniv.oblivion_ugraph
32 let rec count_pi = function Cic.Prod (_,_,t) -> count_pi t + 1 | _ -> 0 in
33 let rec generate arity menv acc =
34 if arity < 0 then acc, menv
38 CloseCoercionGraph.generate_composite t1 t2 context menv
39 CicUniv.oblivion_ugraph arity false
41 generate (arity - 1) menv (t::acc)
43 | CloseCoercionGraph.UnableToCompose -> generate (arity - 1) menv acc
45 let terms, metasenv = generate (count_pi ty1) metasenv [] in
47 let uri, _, _subst, bo, ty, attrs = proof in
48 uri, metasenv, _subst, bo, ty, attrs
52 (fun (proof,goal) t ->
54 ProofEngineTypes.const_lazy_term t
57 ProofEngineTypes.apply_tactic
58 (VariousTactics.generalize_tac (Some (lazy_of t), [], None))
61 assert(List.length gl = 1);
65 ProofEngineTypes.apply_tactic
66 (PrimitiveTactics.intros_tac ?howmany ?mk_fresh_name_callback ())
70 let compose_tac ?howmany ?mk_fresh_name_callback t1 t2 =
71 ProofEngineTypes.mk_tactic
72 (compose_tac ?howmany ?mk_fresh_name_callback t1 t2)