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
79 type step = Note of note
80 | Theorem of name * what * note
83 | Intros of count option * name list * note
84 | Cut of name * what * note
85 | LetIn of name * what * note
86 | Rewrite of how * what * where * note
87 | Elim of what * using option * note
88 | Apply of what * note
90 | Branch of step list list * note
92 (* annterm constructors *****************************************************)
94 let mk_arel i b = Cic.ARel ("", "", i, b)
96 (* grafite ast constructors *************************************************)
98 let floc = H.dummy_floc
100 let hole = C.AImplicit ("", Some `Hole)
102 let mk_note str = G.Comment (floc, G.Note (floc, str))
104 let mk_theorem name t =
105 let obj = N.Theorem (`Theorem, name, t, None) in
106 G.Executable (floc, G.Command (floc, G.Obj (floc, obj)))
109 G.Executable (floc, G.Command (floc, G.Qed floc))
111 let mk_tactic tactic =
112 G.Executable (floc, G.Tactical (floc, G.Tactic (floc, tactic), None))
115 let tactic = G.IdTac floc in
118 let mk_intros xi ids =
119 let tactic = G.Intros (floc, xi, ids) in
122 let mk_cut name what =
123 let tactic = G.Cut (floc, Some name, what) in
126 let mk_letin name what =
127 let tactic = G.LetIn (floc, what, name) in
130 let mk_rewrite direction what where =
131 let direction = if direction then `RightToLeft else `LeftToRight in
132 let pattern, rename = match where with
133 | None -> (None, [], Some hole), []
134 | Some (premise, name) -> (None, [premise, hole], None), [name]
136 let tactic = G.Rewrite (floc, direction, what, pattern, rename) in
139 let mk_elim what using =
140 let tactic = G.Elim (floc, what, using, Some 0, []) in
144 let tactic = G.Apply (floc, t) in
148 let pattern = None, [], Some hole in
149 let tactic = G.Reduce (floc, `Whd, pattern) in
152 let mk_dot = G.Executable (floc, G.Tactical (floc, G.Dot floc, None))
154 let mk_sc = G.Executable (floc, G.Tactical (floc, G.Semicolon floc, None))
156 let mk_ob = G.Executable (floc, G.Tactical (floc, G.Branch floc, None))
158 let mk_cb = G.Executable (floc, G.Tactical (floc, G.Merge floc, None))
160 let mk_vb = G.Executable (floc, G.Tactical (floc, G.Shift floc, None))
162 (* rendering ****************************************************************)
164 let rec render_step sep a = function
165 | Note s -> mk_note s :: a
166 | Theorem (n, t, s) -> mk_note s :: mk_theorem n t :: a
167 | Qed s -> mk_note s :: mk_qed :: a
168 | Id s -> mk_note s :: cont sep (mk_id :: a)
169 | Intros (c, ns, s) -> mk_note s :: cont sep (mk_intros c ns :: a)
170 | Cut (n, t, s) -> mk_note s :: cont sep (mk_cut n t :: a)
171 | LetIn (n, t, s) -> mk_note s :: cont sep (mk_letin n t :: a)
172 | Rewrite (b, t, w, s) -> mk_note s :: cont sep (mk_rewrite b t w :: a)
173 | Elim (t, xu, s) -> mk_note s :: cont sep (mk_elim t xu :: a)
174 | Apply (t, s) -> mk_note s :: cont sep (mk_apply t :: a)
175 | Whd (c, s) -> mk_note s :: cont sep (mk_whd c :: a)
176 | Branch ([], s) -> a
177 | Branch ([ps], s) -> render_steps sep a ps
179 let a = mk_ob :: a in
180 let body = mk_cb :: list_rev_map_concat (render_steps None) mk_vb a pss in
181 mk_note s :: cont sep body
183 and render_steps sep a = function
185 | [p] -> render_step sep a p
186 | p :: Branch ([], _) :: ps ->
187 render_steps sep a (p :: ps)
188 | p :: ((Branch (_ :: _ :: _, _) :: _) as ps) ->
189 render_steps sep (render_step (Some mk_sc) a p) ps
191 render_steps sep (render_step (Some mk_dot) a p) ps
193 let render_steps a = render_steps None a
195 (* counting *****************************************************************)
197 let rec count_step a = function
201 | Branch (pps, _) -> List.fold_left count_steps a pps
204 and count_steps a = List.fold_left count_step a