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/.
30 module N = CicNotationPt
32 module H = ProceduralHelpers
34 (* functions to be moved ****************************************************)
36 let list_rev_map2 map l1 l2 =
37 let rec aux res = function
38 | hd1 :: tl1, hd2 :: tl2 -> aux (map hd1 hd2 :: res) (tl1, tl2)
43 let list_map2_filter map l1 l2 =
44 let rec filter l = function
46 | None :: tl -> filter l tl
47 | Some a :: tl -> filter (a :: l) tl
49 filter [] (list_rev_map2 map l1 l2)
52 let rec aux a j = if j < 0 then a else aux (f j :: a) (pred j) in
55 (****************************************************************************)
57 type flavour = C.object_flavour
58 type name = string option
62 type using = C.annterm
65 type where = (hyp * name) option
66 type inferred = C.annterm
67 type pattern = C.annterm
68 type body = C.annterm option
69 type types = C.anninductiveType list
72 type step = Note of note
73 | Inductive of types * lpsno * note
74 | Statement of flavour * name * what * body * note
77 | Intros of count option * name list * note
78 | Cut of name * what * note
79 | LetIn of name * what * note
80 | Rewrite of how * what * where * pattern * note
81 | Elim of what * using option * pattern * note
82 | Apply of what * note
83 | Change of inferred * what * where * pattern * note
84 | Clear of hyp list * note
85 | ClearBody of hyp * note
86 | Branch of step list list * note
88 (* annterm constructors *****************************************************)
90 let mk_arel i b = C.ARel ("", "", i, b)
92 (* FG: this is really awful !! *)
93 let arel_of_name = function
94 | C.Name s -> mk_arel 0 s
95 | C.Anonymous -> mk_arel 0 "_"
97 (* helper functions on left params for use with inductive types *************)
99 let strip_lps lpsno arity =
100 let rec aux no lps = function
101 | C.AProd (_, name, w, t) when no > 0 ->
102 let lp = name, Some w in
103 aux (pred no) (lp :: lps) t
108 let merge_lps lps1 lps2 =
109 let map (n1, w1) (n2, _) =
110 let n = match n1, n2 with
116 if lps1 = [] then lps2 else
117 List.map2 map lps1 lps2
119 (* grafite ast constructors *************************************************)
121 let floc = HEL.dummy_floc
123 let mk_note str = G.Comment (floc, G.Note (floc, str))
125 let mk_tacnote str a =
126 if str = "" then mk_note "" :: a else mk_note "" :: mk_note str :: a
128 let mk_notenote str a =
129 if str = "" then a else mk_note str :: a
131 let mk_thnote str a =
132 if str = "" then a else mk_note "" :: mk_note str :: a
134 let mk_inductive types lpsno =
135 let map1 (lps1, cons) (name, arity) =
136 let lps2, arity = strip_lps lpsno arity in
137 merge_lps lps1 lps2, (name, arity) :: cons
139 let map2 (lps1, types) (_, name, kind, arity, cons) =
140 let lps2, arity = strip_lps lpsno arity in
141 let lps1, rev_cons = List.fold_left map1 (lps1, []) cons in
142 merge_lps lps1 lps2, (name, kind, arity, List.rev rev_cons) :: types
144 let map3 (name, xw) = arel_of_name name, xw in
145 let rev_lps, rev_types = List.fold_left map2 ([], []) types in
146 let lpars, types = List.rev_map map3 rev_lps, List.rev rev_types in
147 let obj = N.Inductive (lpars, types) in
148 G.Executable (floc, G.Command (floc, G.Obj (floc, obj)))
150 let mk_statement flavour name t v =
151 let name = match name with Some name -> name | None -> assert false in
152 let obj = N.Theorem (flavour, name, t, v) in
153 G.Executable (floc, G.Command (floc, G.Obj (floc, obj)))
156 G.Executable (floc, G.Command (floc, G.Qed floc))
158 let mk_tactic tactic punctation =
159 G.Executable (floc, G.Tactic (floc, Some tactic, punctation))
161 let mk_punctation punctation =
162 G.Executable (floc, G.Tactic (floc, None, punctation))
164 let mk_id punctation =
165 let tactic = G.IdTac floc in
166 mk_tactic tactic punctation
168 let mk_intros xi xids punctation =
169 let tactic = G.Intros (floc, (xi, xids)) in
170 mk_tactic tactic punctation
172 let mk_cut name what punctation =
173 let name = match name with Some name -> name | None -> assert false in
174 let tactic = G.Cut (floc, Some name, what) in
175 mk_tactic tactic punctation
177 let mk_letin name what punctation =
178 let name = match name with Some name -> name | None -> assert false in
179 let tactic = G.LetIn (floc, what, name) in
180 mk_tactic tactic punctation
182 let mk_rewrite direction what where pattern punctation =
183 let direction = if direction then `RightToLeft else `LeftToRight in
184 let pattern, rename = match where with
185 | None -> (None, [], Some pattern), []
186 | Some (premise, Some name) -> (None, [premise, pattern], None), [Some name]
187 | Some (premise, None) -> (None, [premise, pattern], None), []
189 let tactic = G.Rewrite (floc, direction, what, pattern, rename) in
190 mk_tactic tactic punctation
192 let mk_elim what using pattern punctation =
193 let pattern = None, [], Some pattern in
194 let tactic = G.Elim (floc, what, using, pattern, (Some 0, [])) in
195 mk_tactic tactic punctation
197 let mk_apply t punctation =
198 let tactic = G.ApplyP (floc, t) in
199 mk_tactic tactic punctation
201 let mk_change t where pattern punctation =
202 let pattern = match where with
203 | None -> None, [], Some pattern
204 | Some (premise, _) -> None, [premise, pattern], None
206 let tactic = G.Change (floc, pattern, t) in
207 mk_tactic tactic punctation
209 let mk_clear ids punctation =
210 let tactic = G.Clear (floc, ids) in
211 mk_tactic tactic punctation
213 let mk_clearbody id punctation =
214 let tactic = G.ClearBody (floc, id) in
215 mk_tactic tactic punctation
218 let punctation = G.Branch floc in
219 mk_punctation punctation
221 let mk_dot = G.Dot floc
223 let mk_sc = G.Semicolon floc
225 let mk_cb = G.Merge floc
227 let mk_vb = G.Shift floc
229 (* rendering ****************************************************************)
231 let rec render_step sep a = function
232 | Note s -> mk_notenote s a
233 | Statement (f, n, t, v, s) -> mk_statement f n t v :: mk_thnote s a
234 | Inductive (lps, ts, s) -> mk_inductive lps ts :: mk_thnote s a
235 | Qed s -> mk_qed :: mk_tacnote s a
236 | Id s -> mk_id sep :: mk_tacnote s a
237 | Intros (c, ns, s) -> mk_intros c ns sep :: mk_tacnote s a
238 | Cut (n, t, s) -> mk_cut n t sep :: mk_tacnote s a
239 | LetIn (n, t, s) -> mk_letin n t sep :: mk_tacnote s a
240 | Rewrite (b, t, w, e, s) -> mk_rewrite b t w e sep :: mk_tacnote s a
241 | Elim (t, xu, e, s) -> mk_elim t xu e sep :: mk_tacnote s a
242 | Apply (t, s) -> mk_apply t sep :: mk_tacnote s a
243 | Change (t, _, w, e, s) -> mk_change t w e sep :: mk_tacnote s a
244 | Clear (ns, s) -> mk_clear ns sep :: mk_tacnote s a
245 | ClearBody (n, s) -> mk_clearbody n sep :: mk_tacnote s a
246 | Branch ([], s) -> a
247 | Branch ([ps], s) -> render_steps sep a ps
248 | Branch (ps :: pss, s) ->
249 let a = mk_ob :: mk_tacnote s a in
250 let a = List.fold_left (render_steps mk_vb) a (List.rev pss) in
251 mk_punctation sep :: render_steps mk_cb a ps
253 and render_steps sep a = function
255 | [p] -> render_step sep a p
256 | p :: Branch ([], _) :: ps ->
257 render_steps sep a (p :: ps)
258 | p :: ((Branch (_ :: _ :: _, _) :: _) as ps) ->
259 render_steps sep (render_step mk_sc a p) ps
261 render_steps sep (render_step mk_sc a p) ps
263 let render_steps a = render_steps mk_dot a
265 (* counting *****************************************************************)
267 let rec count_step a = function
271 | Branch (pps, _) -> List.fold_left count_steps a pps
274 and count_steps a = List.fold_left count_step a
276 let rec count_node a = function
287 | Apply (t, _) -> I.count_nodes a (H.cic t)
288 | Rewrite (_, t, _, p, _)
290 | Change (t, _, _, p, _) ->
291 let a = I.count_nodes a (H.cic t) in
292 I.count_nodes a (H.cic p)
293 | Branch (ss, _) -> List.fold_left count_nodes a ss
295 and count_nodes a = List.fold_left count_node a