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/.
29 module N = CicNotationPt
31 (* functions to be moved ****************************************************)
33 let list_map2_filter map l1 l2 =
34 let rec filter l = function
36 | None :: tl -> filter l tl
37 | Some a :: tl -> filter (a :: l) tl
39 filter [] (List.rev_map2 map l1 l2)
41 let rec list_split n l =
42 if n = 0 then [], l else
43 let l1, l2 = list_split (pred n) (List.tl l) in
46 let cont sep a = match sep with
48 | Some sep -> sep :: a
50 let list_rev_map_concat map sep a l =
51 let rec aux a = function
54 | x :: y :: l -> aux (sep :: map a x) (y :: l)
58 let is_atomic = function
66 | C.AImplicit _ -> true
69 (****************************************************************************)
72 type what = Cic.annterm
74 type using = Cic.annterm
77 type where = (name * name) option
78 type inferred = Cic.annterm
80 type step = Note of note
81 | Theorem of name * what * note
84 | Intros of count option * name list * note
85 | Cut of name * what * note
86 | LetIn of name * what * note
87 | Rewrite of how * what * where * note
88 | Elim of what * using option * note
89 | Apply of what * note
91 | Change of inferred * what * note
92 | Branch of step list list * note
94 (* annterm constructors *****************************************************)
96 let mk_arel i b = Cic.ARel ("", "", i, b)
98 (* grafite ast constructors *************************************************)
100 let floc = H.dummy_floc
102 let hole = C.AImplicit ("", Some `Hole)
104 let mk_note str = G.Comment (floc, G.Note (floc, str))
106 let mk_theorem name t =
107 let obj = N.Theorem (`Theorem, name, t, None) in
108 G.Executable (floc, G.Command (floc, G.Obj (floc, obj)))
111 G.Executable (floc, G.Command (floc, G.Qed floc))
113 let mk_tactic tactic =
114 G.Executable (floc, G.Tactical (floc, G.Tactic (floc, tactic), None))
117 let tactic = G.IdTac floc in
120 let mk_intros xi ids =
121 let tactic = G.Intros (floc, xi, ids) in
124 let mk_cut name what =
125 let tactic = G.Cut (floc, Some name, what) in
128 let mk_letin name what =
129 let tactic = G.LetIn (floc, what, name) in
132 let mk_rewrite direction what where =
133 let direction = if direction then `RightToLeft else `LeftToRight in
134 let pattern, rename = match where with
135 | None -> (None, [], Some hole), []
136 | Some (premise, name) -> (None, [premise, hole], None), [name]
138 let tactic = G.Rewrite (floc, direction, what, pattern, rename) in
141 let mk_elim what using =
142 let tactic = G.Elim (floc, what, using, Some 0, []) in
146 let tactic = G.Apply (floc, t) in
150 let pattern = None, [], Some hole in
151 let tactic = G.Reduce (floc, `Whd, pattern) in
155 let pattern = None, [], Some hole in
156 let tactic = G.Change (floc, pattern, t) in
159 let mk_dot = G.Executable (floc, G.Tactical (floc, G.Dot floc, None))
161 let mk_sc = G.Executable (floc, G.Tactical (floc, G.Semicolon floc, None))
163 let mk_ob = G.Executable (floc, G.Tactical (floc, G.Branch floc, None))
165 let mk_cb = G.Executable (floc, G.Tactical (floc, G.Merge floc, None))
167 let mk_vb = G.Executable (floc, G.Tactical (floc, G.Shift floc, None))
169 (* rendering ****************************************************************)
171 let rec render_step sep a = function
172 | Note s -> mk_note s :: a
173 | Theorem (n, t, s) -> mk_note s :: mk_theorem n t :: a
174 | Qed s -> (* mk_note s :: *) mk_qed :: a
175 | Id s -> mk_note s :: cont sep (mk_id :: a)
176 | Intros (c, ns, s) -> mk_note s :: cont sep (mk_intros c ns :: a)
177 | Cut (n, t, s) -> mk_note s :: cont sep (mk_cut n t :: a)
178 | LetIn (n, t, s) -> mk_note s :: cont sep (mk_letin n t :: a)
179 | Rewrite (b, t, w, s) -> mk_note s :: cont sep (mk_rewrite b t w :: a)
180 | Elim (t, xu, s) -> mk_note s :: cont sep (mk_elim t xu :: a)
181 | Apply (t, s) -> mk_note s :: cont sep (mk_apply t :: a)
182 | Whd (c, s) -> mk_note s :: cont sep (mk_whd c :: a)
183 | Change (t, _, s) -> mk_note s :: cont sep (mk_change t :: a)
184 | Branch ([], s) -> a
185 | Branch ([ps], s) -> render_steps sep a ps
187 let a = mk_ob :: a in
188 let body = mk_cb :: list_rev_map_concat (render_steps None) mk_vb a pss in
189 mk_note s :: cont sep body
191 and render_steps sep a = function
193 | [p] -> render_step sep a p
194 | p :: Branch ([], _) :: ps ->
195 render_steps sep a (p :: ps)
196 | p :: ((Branch (_ :: _ :: _, _) :: _) as ps) ->
197 render_steps sep (render_step (Some mk_sc) a p) ps
199 render_steps sep (render_step (Some mk_dot) a p) ps
201 let render_steps a = render_steps None a
203 (* counting *****************************************************************)
205 let rec count_step a = function
209 | Branch (pps, _) -> List.fold_left count_steps a pps
212 and count_steps a = List.fold_left count_step a