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 * where * note
92 | ClearBody of name * note
93 | Branch of step list list * note
95 (* annterm constructors *****************************************************)
97 let mk_arel i b = Cic.ARel ("", "", i, b)
99 (* grafite ast constructors *************************************************)
101 let floc = H.dummy_floc
103 let hole = C.AImplicit ("", Some `Hole)
105 let mk_note str = G.Comment (floc, G.Note (floc, str))
107 let mk_theorem name t =
108 let obj = N.Theorem (`Theorem, name, t, None) in
109 G.Executable (floc, G.Command (floc, G.Obj (floc, obj)))
112 G.Executable (floc, G.Command (floc, G.Qed floc))
114 let mk_tactic tactic =
115 G.Executable (floc, G.Tactical (floc, G.Tactic (floc, tactic), None))
118 let tactic = G.IdTac floc in
121 let mk_intros xi ids =
122 let tactic = G.Intros (floc, xi, ids) in
125 let mk_cut name what =
126 let tactic = G.Cut (floc, Some name, what) in
129 let mk_letin name what =
130 let tactic = G.LetIn (floc, what, name) in
133 let mk_rewrite direction what where =
134 let direction = if direction then `RightToLeft else `LeftToRight in
135 let pattern, rename = match where with
136 | None -> (None, [], Some hole), []
137 | Some (premise, name) -> (None, [premise, hole], None), [name]
139 let tactic = G.Rewrite (floc, direction, what, pattern, rename) in
142 let mk_elim what using =
143 let tactic = G.Elim (floc, what, using, Some 0, []) in
147 let tactic = G.Apply (floc, t) in
151 let pattern = None, [], Some hole in
152 let tactic = G.Reduce (floc, `Whd, pattern) in
155 let mk_change t where =
156 let pattern = match where with
157 | None -> None, [], Some hole
158 | Some (premise, _) -> None, [premise, hole], None
160 let tactic = G.Change (floc, pattern, t) in
163 let mk_clearbody id =
164 let tactic = G.ClearBody (floc, id) in
167 let mk_dot = G.Executable (floc, G.Tactical (floc, G.Dot floc, None))
169 let mk_sc = G.Executable (floc, G.Tactical (floc, G.Semicolon floc, None))
171 let mk_ob = G.Executable (floc, G.Tactical (floc, G.Branch floc, None))
173 let mk_cb = G.Executable (floc, G.Tactical (floc, G.Merge floc, None))
175 let mk_vb = G.Executable (floc, G.Tactical (floc, G.Shift floc, None))
177 (* rendering ****************************************************************)
179 let rec render_step sep a = function
180 | Note s -> mk_note s :: a
181 | Theorem (n, t, s) -> mk_note s :: mk_theorem n t :: a
182 | Qed s -> (* mk_note s :: *) mk_qed :: a
183 | Id s -> mk_note s :: cont sep (mk_id :: a)
184 | Intros (c, ns, s) -> mk_note s :: cont sep (mk_intros c ns :: a)
185 | Cut (n, t, s) -> mk_note s :: cont sep (mk_cut n t :: a)
186 | LetIn (n, t, s) -> mk_note s :: cont sep (mk_letin n t :: a)
187 | Rewrite (b, t, w, s) -> mk_note s :: cont sep (mk_rewrite b t w :: a)
188 | Elim (t, xu, s) -> mk_note s :: cont sep (mk_elim t xu :: a)
189 | Apply (t, s) -> mk_note s :: cont sep (mk_apply t :: a)
190 | Whd (c, s) -> mk_note s :: cont sep (mk_whd c :: a)
191 | Change (t, _, w, s) -> mk_note s :: cont sep (mk_change t w :: a)
192 | ClearBody (n, s) -> mk_note s :: cont sep (mk_clearbody n :: a)
193 | Branch ([], s) -> a
194 | Branch ([ps], s) -> render_steps sep a ps
196 let a = mk_ob :: a in
197 let body = mk_cb :: list_rev_map_concat (render_steps None) mk_vb a pss in
198 mk_note s :: cont sep body
200 and render_steps sep a = function
202 | [p] -> render_step sep a p
203 | p :: Branch ([], _) :: ps ->
204 render_steps sep a (p :: ps)
205 | p :: ((Branch (_ :: _ :: _, _) :: _) as ps) ->
206 render_steps sep (render_step (Some mk_sc) a p) ps
208 render_steps sep (render_step (Some mk_dot) a p) ps
210 let render_steps a = render_steps None a
212 (* counting *****************************************************************)
214 let rec count_step a = function
218 | Branch (pps, _) -> List.fold_left count_steps a pps
221 and count_steps a = List.fold_left count_step a