1 (* Copyright (C) 2002, 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/.
26 (* proof engine status *)
27 val proof : ProofEngineTypes.proof option ref
28 val goal : ProofEngineTypes.goal option ref
30 (* start a new goal undoing part of the proof *)
31 val perforate : Cic.context -> Cic.term -> Cic.term -> unit
33 (* reduction tactics *)
34 val whd : Cic.term list -> unit
35 val reduce : Cic.term list -> unit
36 val simpl : Cic.term list -> unit
37 val fold_whd : Cic.term -> unit
38 val fold_reduce : Cic.term -> unit
39 val fold_simpl : Cic.term -> unit
41 (* scratch area reduction tactics *)
42 val whd_in_scratch : Cic.term list -> Cic.term -> Cic.term
43 val reduce_in_scratch : Cic.term list -> Cic.term -> Cic.term
44 val simpl_in_scratch : Cic.term list -> Cic.term -> Cic.term
46 (* "primitive" tactics *)
47 val can_apply : Cic.term -> bool
48 val apply : Cic.term -> unit
50 ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type -> unit -> unit
52 ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type -> Cic.term -> unit
54 ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type -> Cic.term -> unit
55 val exact : Cic.term -> unit
56 val elim_intros_simpl : Cic.term -> unit
57 val change : goal_input:Cic.term -> input:Cic.term -> unit
59 (* structural tactics *)
60 val clearbody : Cic.hypothesis -> unit
61 val clear : Cic.hypothesis -> unit
64 val elim_type : Cic.term -> unit
65 val ring : unit -> unit
66 val fourier : unit -> unit
67 val rewrite_simpl : Cic.term -> unit
68 val rewrite_back_simpl : Cic.term -> unit
69 val replace : goal_input:Cic.term -> input:Cic.term -> unit
71 val reflexivity : unit -> unit
72 val symmetry : unit -> unit
73 val transitivity : Cic.term -> unit
75 val exists : unit -> unit
76 val split : unit -> unit
77 val left : unit -> unit
78 val right : unit -> unit
80 val assumption : unit -> unit
82 val generalize : Cic.term -> unit
84 val absurd : Cic.term -> unit
85 val contradiction : unit -> unit
89 ((UriManager.uri * int * (UriManager.uri * Cic.term) list) list ->
90 (UriManager.uri * int * (UriManager.uri * Cic.term) list) list) ->
94 val decide_equality : unit -> unit
95 val compare : Cic.term -> Cic.term -> unit
99 val prova_tatticali : unit -> unit