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 (** return a pair of "xml" (as defined in Xml module) representing the current
31 proof type and body, respectively *)
32 val get_current_status_as_xml : unit -> Xml.token Stream.t * Xml.token Stream.t
34 (* start a new goal undoing part of the proof *)
35 val perforate : Cic.context -> Cic.term -> Cic.term -> unit
37 (* reduction tactics *)
38 val whd : Cic.term list -> unit
39 val reduce : Cic.term list -> unit
40 val simpl : Cic.term list -> unit
41 val fold_whd : Cic.term -> unit
42 val fold_reduce : Cic.term -> unit
43 val fold_simpl : Cic.term -> unit
45 (* scratch area reduction tactics *)
46 val whd_in_scratch : Cic.term list -> Cic.term -> Cic.term
47 val reduce_in_scratch : Cic.term list -> Cic.term -> Cic.term
48 val simpl_in_scratch : Cic.term list -> Cic.term -> Cic.term
50 (* "primitive" tactics *)
51 val apply : Cic.term -> unit
53 ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type -> unit -> unit
55 ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type -> Cic.term -> unit
57 ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type -> Cic.term -> unit
58 val exact : Cic.term -> unit
59 val elim_intros_simpl : Cic.term -> unit
60 val change : goal_input:Cic.term -> input:Cic.term -> unit
62 (* structural tactics *)
63 val clearbody : Cic.hypothesis -> unit
64 val clear : Cic.hypothesis -> unit
67 val elim_type : Cic.term -> unit
68 val ring : unit -> unit
69 val fourier : unit -> unit
70 val rewrite_simpl : Cic.term -> unit
71 val rewrite_back_simpl : Cic.term -> unit
72 val replace : goal_input:Cic.term -> input:Cic.term -> unit
74 val reflexivity : unit -> unit
75 val symmetry : unit -> unit
76 val transitivity : Cic.term -> unit
78 val exists : unit -> unit
79 val split : unit -> unit
80 val left : unit -> unit
81 val right : unit -> unit
83 val assumption : unit -> unit
86 ?mk_fresh_name_callback:ProofEngineTypes.mk_fresh_name_type ->
89 val absurd : Cic.term -> unit
90 val contradiction : unit -> unit
94 ((UriManager.uri * int * (UriManager.uri * Cic.term) list) list ->
95 (UriManager.uri * int * (UriManager.uri * Cic.term) list) list) ->
98 val injection : Cic.term -> unit
99 val discriminate : Cic.term -> unit
100 val decide_equality : unit -> unit
101 val compare : Cic.term -> unit
105 val prova_tatticali : unit -> unit