2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
20 module E = NCicEnvironment
21 module V = NCicTypeChecker
32 i: string; (* item name *)
33 n: string; (* reference name *)
34 s: int list; (* scope *)
35 c: C.context (* context for kernel calls *)
38 (* internal functions *******************************************************)
41 X.error ("engine: malformed stack: " ^ s)
44 X.error ("engine: malformed term: " ^ s)
47 X.log ("engine: missing macro for " ^ s)
49 (* generic term processing *)
51 let rec rename s = function
53 | (s1, s2) :: _ when s1 = s -> s2
54 | _ :: tl -> rename s tl
59 rename s !G.alpha_gref
62 if G.is_global_id name then P.sprintf "%s.%s" st.i name else ""
65 let rec aux = function
67 | (r, m, a) :: _ when r = s && a = l -> m
72 let get_head = function
74 let s, _ = K.resolve_reference c in
75 let macro = get_macro s (L.length ts) in
76 if macro <> "" then Some (macro, s, ts) else begin
77 if !G.log_missing then missing s;
82 let proc_sort st is = function
83 | C.Prop -> T.Macro "PROP" :: is
84 | C.Type [`Type, u] -> T.Macro "TYPE" :: T.arg (U.string_of_uri u) :: is
85 | C.Type [`CProp, u] -> T.Macro "CROP" :: T.arg (U.string_of_uri u) :: is
86 | C.Type _ -> malformed "T1"
88 let rec proc_term st is = function
91 | C.Implicit _ -> malformed "T2"
93 let s = K.resolve_lref st.c m in
94 T.Macro "LREF" :: T.arg (mk_lname s) :: T.free (mk_ptr st s) :: is
96 begin match get_head ts with
97 | Some (macro, s, ts) ->
98 let riss = L.rev_map (proc_term st []) ts in
99 T.Macro macro :: T.free s :: T.mk_rev_args riss is
101 let riss = L.rev_map (proc_term st []) ts in
102 T.Macro "APPL" :: T.mk_rev_args riss is
104 | C.Prod (s, w, t) ->
105 let is_w = proc_term st [] w in
106 let c = K.add_dec s w st.c in
107 let is_t = proc_term {st with c=c} is t in
108 let macro = if K.not_prop1 c t then "PROD" else "FALL" in
109 T.Macro macro :: T.arg (mk_lname s) :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
110 | C.Lambda (s, w, t) ->
111 let is_w = proc_term st [] w in
112 let is_t = proc_term {st with c=K.add_dec s w st.c} is t in
113 T.Macro "ABST" :: T.arg (mk_lname s) :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
114 | C.LetIn (s, w, v, t) ->
115 let is_w = proc_term st [] w in
116 let is_v = proc_term st [] v in
117 let is_t = proc_term {st with c=K.add_def s w v st.c} is t in
118 T.Macro "ABBR" :: T.arg (mk_lname s) :: T.free (mk_ptr st s) :: T.Group is_w :: T.Group is_v :: is_t
122 let s, name = K.resolve_reference c in
123 T.Macro "GREF" :: T.arg (mk_gname name) :: T.free s :: is
124 | C.Match (w, u, v, ts) ->
125 let is_w = proc_term st [] (C.Const w) in
126 let is_u = proc_term st [] u in
127 let is_v = proc_term st [] v in
128 let riss = X.rev_mapi (proc_case st [] w) K.fst_con ts in
129 let macro = if ts = [] then "CAZE" else "CASE" in
130 T.Macro macro :: T.Group is_w :: T.Group is_u :: T.Group is_v :: T.mk_rev_args riss is
132 and proc_case st is w i t =
133 let v = R.mk_constructor i w in
134 let is_v = proc_term st [] (C.Const v) in
135 let is_t = proc_term st [] t in
136 T.Macro "PAIR" :: T.Group is_v :: T.Group is_t :: is
138 let proc_term st is t = try proc_term st is t with
140 | Invalid_argument "List.nth"
142 | Failure "name_of_reference" -> malformed "T3"
144 (* proof processing *)
146 let typeof st = function
148 | t -> K.whd_typeof st.c t
152 n = ""; s = [1]; c = [];
155 let push st n = {st with
156 n = n; s = 1 :: st.s;
159 let next st f = {st with
161 n = ""; s = match st.s with [] -> failwith "hd" | i :: tl -> succ i :: tl
165 X.rev_map_concat string_of_int "." "" (L.tl st.s)
168 if st.n <> "" || L.tl st.s = [] then ris else
169 T.free (scope st) :: T.Macro "EXIT" :: ris
172 if st.n = "" then ris else
173 T.free (scope st) :: T.free (mk_ptr st st.n) :: T.arg (mk_lname st.n) :: T.Macro "OPEN" :: ris
175 let mk_dec st kind w s ris =
176 let w = if !G.no_types then [] else w in
177 T.Group w :: T.free (mk_ptr st s) :: T.arg (mk_lname s) :: T.Macro kind :: ris
179 let mk_inferred st t ris =
180 let u = typeof st t in
181 let is_u = proc_term st [] u in
182 mk_dec st "DECL" is_u st.n ris
184 let rec proc_proof st ris t = match t with
189 | C.Prod _ -> malformed "P1"
191 | C.Rel _ -> proc_proof st ris (C.Appl [t])
192 | C.Lambda (s, w, t) ->
193 let is_w = proc_term st [] w in
194 let ris = mk_open st ris in
195 proc_proof (next st (K.add_dec s w)) (mk_dec st "PRIM" is_w s ris) t
196 | C.Appl (t0 :: ts) ->
197 let rts = X.rev_neg_filter (K.not_prop2 st.c) [t0] ts in
198 let ris = T.Macro "STEP" :: mk_inferred st t ris in
199 let tts = L.rev_map (proc_term st []) rts in
200 mk_exit st (T.rev_mk_args tts ris)
201 | C.Match (w, u, v, ts) ->
202 let rts = X.rev_neg_filter (K.not_prop2 st.c) [v] ts in
203 let ris = T.Macro "DEST" :: mk_inferred st t ris in
204 let tts = L.rev_map (proc_term st []) rts in
205 mk_exit st (T.rev_mk_args tts ris)
206 | C.LetIn (s, w, v, t) ->
207 let is_w = proc_term st [] w in
208 let ris = mk_open st ris in
209 if K.not_prop1 st.c w then
210 let is_v = proc_term st [] v in
211 let ris = T.Group is_v :: T.Macro "BODY" :: mk_dec st "DECL" is_w s ris in
212 proc_proof (next st (K.add_def s w v)) ris t
214 let ris_v = proc_proof (push st s) ris v in
215 proc_proof (next st (K.add_def s w v)) ris_v t
217 let proc_proof st rs t = try proc_proof st rs t with
219 | Invalid_argument "List.nth"
221 | Failure "name_of_reference" -> malformed "P2"
222 | V.TypeCheckerFailure s
223 | V.AssertFailure s -> malformed (Lazy.force s)
225 | Failure "tl" -> internal "P2"
227 (* top level processing *)
229 let note = T.Note "This file was automatically generated by MaTeX: do not edit"
231 let proc_item item s ss t =
233 let tt = N.process_top_term s t in (* alpha-conversion *)
234 let is = [T.Macro "end"; T.arg item] in
235 note :: T.Macro "begin" :: T.arg item :: T.arg (mk_gname s) :: T.free ss :: proc_term st is tt
237 let proc_top_proof s ss t =
239 let t0 = A.process_top_term s t in (* anticipation *)
240 let tt = N.process_top_term s t0 in (* alpha-conversion *)
241 let ris = [T.free ss; T.arg (mk_gname s); T.arg "proof"; T.Macro "begin"; note] in
242 L.rev (T.arg "proof" :: T.Macro "end" :: proc_proof st ris tt)
245 let fname = s ^ T.file_ext in
246 begin match !G.list_och with
248 | Some och -> P.fprintf och "%s\n" fname
250 open_out (F.concat !G.out_dir fname)
252 let proc_pair s ss u = function
254 let name = X.rev_map_concat X.id "." "type" ss in
255 let och = open_out_tex name in
256 O.out_text och (proc_item "axiom" s name u);
260 if K.not_prop1 [] u then proc_item "declaration", proc_item "definition"
261 else proc_item "proposition", proc_top_proof
263 let name = X.rev_map_concat X.id "." "type" ss in
264 let och = open_out_tex name in
265 O.out_text och (text_u s name u);
267 let name = X.rev_map_concat X.id "." "body" ss in
268 let och = open_out_tex name in
269 O.out_text och (text_t s name t);
272 let proc_fun ss (r, s, i, u, t) =
273 proc_pair s (s :: ss) u (Some t)
275 let proc_constructor ss (r, s, u) =
276 proc_pair s (s :: ss) u None
278 let proc_type ss (r, s, u, cs) =
279 proc_pair s (s :: ss) u None;
280 L.iter (proc_constructor ss) cs
283 let ss = K.segments_of_uri u in
284 let _, _, _, _, obj = E.get_checked_obj G.status u in
286 | C.Constant (_, s, xt, u, _) -> proc_pair s ss u xt
287 | C.Fixpoint (_, fs, _) -> L.iter (proc_fun ss) fs
288 | C.Inductive (_, _, ts, _) -> L.iter (proc_type ss) ts
290 (* interface functions ******************************************************)
292 let process = proc_obj