1 (* Copyright (C) 2000-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 (******************************************************************************)
30 (* Claudio Sacerdoti Coen <sacerdot@cs.unibo.it> *)
34 (******************************************************************************)
36 exception RefreshSequentException of exn
37 exception RefreshProofException of exn
39 module type Callbacks =
41 val sequent_viewer : unit -> TermViewer.sequent_viewer
42 val term_editor : unit -> TermEditor.term_editor
43 val get_current_scratch_infos :
46 (Cic.id, Cic.term) Hashtbl.t *
47 (Cic.id, Cic.id option) Hashtbl.t *
48 (string, Cic.hypothesis) Hashtbl.t
50 val set_current_scratch_infos :
52 (Cic.id, Cic.term) Hashtbl.t *
53 (Cic.id, Cic.id option) Hashtbl.t *
54 (string, Cic.hypothesis) Hashtbl.t
56 val refresh_proof : unit -> unit
57 val refresh_goals : unit -> unit
58 val decompose_uris_choice_callback :
59 (UriManager.uri * int * 'a) list ->
60 (UriManager.uri * int * 'b list) list
61 val mk_fresh_name_callback :
62 Cic.context -> Cic.name -> typ:Cic.term -> Cic.name
63 val output_html : string -> unit
66 module Make (C : Callbacks) :
68 val intros : unit -> unit
69 val exact : unit -> unit
70 val apply : unit -> unit
71 val elimintrossimpl : unit -> unit
72 val elimtype : unit -> unit
73 val whd : unit -> unit
74 val reduce : unit -> unit
75 val simpl : unit -> unit
76 val fold_whd : unit -> unit
77 val fold_reduce : unit -> unit
78 val fold_simpl : unit -> unit
79 val cut : unit -> unit
80 val change : unit -> unit
81 val letin : unit -> unit
82 val ring : unit -> unit
83 val clearbody : unit -> unit
84 val clear : unit -> unit
85 val fourier : unit -> unit
86 val rewritesimpl : unit -> unit
87 val rewritebacksimpl : unit -> unit
88 val replace : unit -> unit
89 val reflexivity : unit -> unit
90 val symmetry : unit -> unit
91 val transitivity : unit -> unit
92 val exists : unit -> unit
93 val split : unit -> unit
94 val left : unit -> unit
95 val right : unit -> unit
96 val assumption : unit -> unit
97 val generalize : unit -> unit
98 val absurd : unit -> unit
99 val contradiction : unit -> unit
100 val decompose : unit -> unit
102 < mmlwidget : GMathViewAux.multi_selection_math_view;
103 show : unit -> 'a; .. > ->
105 val reduce_in_scratch :
106 < mmlwidget : GMathViewAux.multi_selection_math_view;
107 show : unit -> 'a; .. > ->
109 val simpl_in_scratch :
110 < mmlwidget : GMathViewAux.multi_selection_math_view;
111 show : unit -> 'a; .. > ->