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 *)
52 if G.is_global_id name then P.sprintf "%s.%s" st.i name else ""
55 let rec aux = function
57 | (r, m, a) :: _ when r = s -> m, a
62 let get_head = function
64 let s, _ = K.resolve_reference c in
65 let macro, arity = get_macro s in
66 if arity = L.length ts then Some (macro, ts) else begin missing s; None end
69 let proc_sort st is = function
70 | C.Prop -> T.Macro "PROP" :: is
71 | C.Type [`Type, u] -> T.Macro "TYPE" :: T.arg (U.string_of_uri u) :: is
72 | C.Type [`CProp, u] -> T.Macro "CROP" :: T.arg (U.string_of_uri u) :: is
73 | C.Type _ -> malformed "T1"
75 let rec proc_term st is = function
78 | C.Implicit _ -> malformed "T2"
80 let name = K.resolve_lref st.c m in
81 T.Macro "LREF" :: T.arg name :: T.free (mk_ptr st name) :: is
83 let macro, ts = match get_head ts with
84 | Some (macro, ts) -> macro, ts
87 let riss = L.rev_map (proc_term st []) ts in
88 T.Macro macro :: T.mk_rev_args riss is
90 let is_w = proc_term st [] w in
91 let is_t = proc_term {st with c=K.add_dec s w st.c} is t in
92 T.Macro "PROD" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
93 | C.Lambda (s, w, t) ->
94 let is_w = proc_term st [] w in
95 let is_t = proc_term {st with c=K.add_dec s w st.c} is t in
96 T.Macro "ABST" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
97 | C.LetIn (s, w, v, t) ->
98 let is_w = proc_term st [] w in
99 let is_v = proc_term st [] v in
100 let is_t = proc_term {st with c=K.add_def s w v st.c} is t in
101 T.Macro "ABBR" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: T.Group is_v :: is_t
105 let s, name = K.resolve_reference c in
106 T.Macro "GREF" :: T.arg name :: T.free s :: is
107 | C.Match (w, u, v, ts) ->
108 let is_w = proc_term st [] (C.Const w) in
109 let is_u = proc_term st [] u in
110 let is_v = proc_term st [] v in
111 let riss = L.rev_map (proc_term st []) ts in
112 T.Macro "CASE" :: T.Group is_w :: T.Group is_u :: T.Group is_v :: T.mk_rev_args riss is
114 let proc_term st is t = try proc_term st is t with
116 | Invalid_argument "List.nth"
118 | Failure "name_of_reference" -> malformed "T3"
120 (* proof processing *)
122 let typeof st = function
124 | t -> K.whd_typeof st.c t
128 n = ""; s = [1]; c = [];
131 let push st n = {st with
132 n = n; s = 1 :: st.s;
135 let next st f = {st with
137 n = ""; s = match st.s with [] -> failwith "hd" | i :: tl -> succ i :: tl
141 X.rev_map_concat string_of_int "." "" (L.tl st.s)
144 if st.n <> "" || L.tl st.s = [] then ris else
145 T.free (scope st) :: T.Macro "EXIT" :: ris
148 if st.n = "" then ris else
149 T.free (scope st) :: T.free (mk_ptr st st.n) :: T.arg st.n :: T.Macro "OPEN" :: ris
151 let mk_dec st kind w s ris =
152 let w = if !G.no_types then [] else w in
153 T.Group w :: T.free (mk_ptr st s) :: T.arg s :: T.Macro kind :: ris
155 let mk_inferred st t ris =
156 let u = typeof st t in
157 let is_u = proc_term st [] u in
158 mk_dec st "DECL" is_u st.n ris
160 let rec proc_proof st ris t = match t with
165 | C.Prod _ -> malformed "P1"
167 | C.Rel _ -> proc_proof st ris (C.Appl [t])
168 | C.Lambda (s, w, t) ->
169 let is_w = proc_term st [] w in
170 let ris = mk_open st ris in
171 proc_proof (next st (K.add_dec s w)) (mk_dec st "PRIM" is_w s ris) t
172 | C.Appl (t0 :: ts) ->
173 let rts = X.rev_neg_filter (K.not_prop2 st.c) [t0] ts in
174 let ris = T.Macro "STEP" :: mk_inferred st t ris in
175 let tts = L.rev_map (proc_term st []) rts in
176 mk_exit st (T.rev_mk_args tts ris)
177 | C.Match (w, u, v, ts) ->
178 let rts = X.rev_neg_filter (K.not_prop2 st.c) [v] ts in
179 let ris = T.Macro "DEST" :: mk_inferred st t ris in
180 let tts = L.rev_map (proc_term st []) rts in
181 mk_exit st (T.rev_mk_args tts ris)
182 | C.LetIn (s, w, v, t) ->
183 let is_w = proc_term st [] w in
184 let ris = mk_open st ris in
185 if K.not_prop1 st.c w then
186 let is_v = proc_term st [] v in
187 let ris = T.Group is_v :: T.Macro "BODY" :: mk_dec st "DECL" is_w s ris in
188 proc_proof (next st (K.add_def s w v)) ris t
190 let ris_v = proc_proof (push st s) ris v in
191 proc_proof (next st (K.add_def s w v)) ris_v t
193 let proc_proof st rs t = try proc_proof st rs t with
195 | Invalid_argument "List.nth"
197 | Failure "name_of_reference" -> malformed "P2"
198 | V.TypeCheckerFailure s
199 | V.AssertFailure s -> malformed (Lazy.force s)
201 | Failure "tl" -> internal "P2"
203 (* top level processing *)
205 let note = T.Note "This file was automatically generated by MaTeX: do not edit"
207 let proc_item item s ss t =
209 let tt = N.process_top_term s t in (* alpha-conversion *)
210 let is = [T.Macro "end"; T.arg item] in
211 note :: T.Macro "begin" :: T.arg item :: T.arg s :: T.free ss :: proc_term st is tt
213 let proc_top_proof s ss t =
215 let t0 = A.process_top_term s t in (* anticipation *)
216 let tt = N.process_top_term s t0 in (* alpha-conversion *)
217 let ris = [T.free ss; T.arg s; T.arg "proof"; T.Macro "begin"; note] in
218 L.rev (T.arg "proof" :: T.Macro "end" :: proc_proof st ris tt)
221 let fname = s ^ T.file_ext in
222 begin match !G.list_och with
224 | Some och -> P.fprintf och "%s\n" fname
226 open_out (F.concat !G.out_dir fname)
228 let proc_pair s ss u = function
230 let name = X.rev_map_concat X.id "." "type" ss in
231 let och = open_out_tex name in
232 O.out_text och (proc_item "axiom" s name u);
236 if K.not_prop1 [] u then proc_item "declaration", proc_item "definition"
237 else proc_item "proposition", proc_top_proof
239 let name = X.rev_map_concat X.id "." "type" ss in
240 let och = open_out_tex name in
241 O.out_text och (text_u s name u);
243 let name = X.rev_map_concat X.id "." "body" ss in
244 let och = open_out_tex name in
245 O.out_text och (text_t s name t);
248 let proc_fun ss (r, s, i, u, t) =
249 proc_pair s (s :: ss) u (Some t)
251 let proc_constructor ss (r, s, u) =
252 proc_pair s (s :: ss) u None
254 let proc_type ss (r, s, u, cs) =
255 proc_pair s (s :: ss) u None;
256 L.iter (proc_constructor ss) cs
259 let ss = K.segments_of_uri u in
260 let _, _, _, _, obj = E.get_checked_obj G.status u in
262 | C.Constant (_, s, xt, u, _) -> proc_pair s ss u xt
263 | C.Fixpoint (_, fs, _) -> L.iter (proc_fun ss) fs
264 | C.Inductive (_, _, ts, _) -> L.iter (proc_type ss) ts
266 (* interface functions ******************************************************)
268 let process = proc_obj