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 && a = l -> m
62 let get_head = function
64 let s, _ = K.resolve_reference c in
65 let macro = get_macro s (L.length ts) in
66 if macro <> "" then Some (macro, s, ts) else begin
67 if !G.log_missing then missing s;
72 let proc_sort st is = function
73 | C.Prop -> T.Macro "PROP" :: is
74 | C.Type [`Type, u] -> T.Macro "TYPE" :: T.arg (U.string_of_uri u) :: is
75 | C.Type [`CProp, u] -> T.Macro "CROP" :: T.arg (U.string_of_uri u) :: is
76 | C.Type _ -> malformed "T1"
78 let rec proc_term st is = function
81 | C.Implicit _ -> malformed "T2"
83 let name = K.resolve_lref st.c m in
84 T.Macro "LREF" :: T.arg name :: T.free (mk_ptr st name) :: is
86 begin match get_head ts with
87 | Some (macro, s, ts) ->
88 let riss = L.rev_map (proc_term st []) ts in
89 T.Macro macro :: T.free s :: T.mk_rev_args riss is
91 let riss = L.rev_map (proc_term st []) ts in
92 T.Macro "APPL" :: T.mk_rev_args riss is
95 let is_w = proc_term st [] w in
96 let c = K.add_dec s w st.c in
97 let is_t = proc_term {st with c=c} is t in
98 let macro = if K.not_prop1 c t then "PROD" else "FALL" in
99 T.Macro macro :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
100 | C.Lambda (s, w, t) ->
101 let is_w = proc_term st [] w in
102 let is_t = proc_term {st with c=K.add_dec s w st.c} is t in
103 T.Macro "ABST" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
104 | C.LetIn (s, w, v, t) ->
105 let is_w = proc_term st [] w in
106 let is_v = proc_term st [] v in
107 let is_t = proc_term {st with c=K.add_def s w v st.c} is t in
108 T.Macro "ABBR" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: T.Group is_v :: is_t
112 let s, name = K.resolve_reference c in
113 T.Macro "GREF" :: T.arg name :: T.free s :: is
114 | C.Match (w, u, v, ts) ->
115 let is_w = proc_term st [] (C.Const w) in
116 let is_u = proc_term st [] u in
117 let is_v = proc_term st [] v in
118 let riss = L.rev_map (proc_term st []) ts in
119 T.Macro "CASE" :: T.Group is_w :: T.Group is_u :: T.Group is_v :: T.mk_rev_args riss is
121 let proc_term st is t = try proc_term st is t with
123 | Invalid_argument "List.nth"
125 | Failure "name_of_reference" -> malformed "T3"
127 (* proof processing *)
129 let typeof st = function
131 | t -> K.whd_typeof st.c t
135 n = ""; s = [1]; c = [];
138 let push st n = {st with
139 n = n; s = 1 :: st.s;
142 let next st f = {st with
144 n = ""; s = match st.s with [] -> failwith "hd" | i :: tl -> succ i :: tl
148 X.rev_map_concat string_of_int "." "" (L.tl st.s)
151 if st.n <> "" || L.tl st.s = [] then ris else
152 T.free (scope st) :: T.Macro "EXIT" :: ris
155 if st.n = "" then ris else
156 T.free (scope st) :: T.free (mk_ptr st st.n) :: T.arg st.n :: T.Macro "OPEN" :: ris
158 let mk_dec st kind w s ris =
159 let w = if !G.no_types then [T.Macro "NONE"] else w in
160 T.Group w :: T.free (mk_ptr st s) :: T.arg s :: T.Macro kind :: ris
162 let mk_inferred st t ris =
163 let u = typeof st t in
164 let is_u = proc_term st [] u in
165 mk_dec st "DECL" is_u st.n ris
167 let rec proc_proof st ris t = match t with
172 | C.Prod _ -> malformed "P1"
174 | C.Rel _ -> proc_proof st ris (C.Appl [t])
175 | C.Lambda (s, w, t) ->
176 let is_w = proc_term st [] w in
177 let ris = mk_open st ris in
178 proc_proof (next st (K.add_dec s w)) (mk_dec st "PRIM" is_w s ris) t
179 | C.Appl (t0 :: ts) ->
180 let rts = X.rev_neg_filter (K.not_prop2 st.c) [t0] ts in
181 let ris = T.Macro "STEP" :: mk_inferred st t ris in
182 let tts = L.rev_map (proc_term st []) rts in
183 mk_exit st (T.rev_mk_args tts ris)
184 | C.Match (w, u, v, ts) ->
185 let rts = X.rev_neg_filter (K.not_prop2 st.c) [v] ts in
186 let ris = T.Macro "DEST" :: mk_inferred st t ris in
187 let tts = L.rev_map (proc_term st []) rts in
188 mk_exit st (T.rev_mk_args tts ris)
189 | C.LetIn (s, w, v, t) ->
190 let is_w = proc_term st [] w in
191 let ris = mk_open st ris in
192 if K.not_prop1 st.c w then
193 let is_v = proc_term st [] v in
194 let ris = T.Group is_v :: T.Macro "BODY" :: mk_dec st "DECL" is_w s ris in
195 proc_proof (next st (K.add_def s w v)) ris t
197 let ris_v = proc_proof (push st s) ris v in
198 proc_proof (next st (K.add_def s w v)) ris_v t
200 let proc_proof st rs t = try proc_proof st rs t with
202 | Invalid_argument "List.nth"
204 | Failure "name_of_reference" -> malformed "P2"
205 | V.TypeCheckerFailure s
206 | V.AssertFailure s -> malformed (Lazy.force s)
208 | Failure "tl" -> internal "P2"
210 (* top level processing *)
212 let note = T.Note "This file was automatically generated by MaTeX: do not edit"
214 let proc_item item s ss t =
216 let tt = N.process_top_term s t in (* alpha-conversion *)
217 let is = [T.Macro "end"; T.arg item] in
218 note :: T.Macro "begin" :: T.arg item :: T.arg s :: T.free ss :: proc_term st is tt
220 let proc_top_proof s ss t =
222 let t0 = A.process_top_term s t in (* anticipation *)
223 let tt = N.process_top_term s t0 in (* alpha-conversion *)
224 let ris = [T.free ss; T.arg s; T.arg "proof"; T.Macro "begin"; note] in
225 L.rev (T.arg "proof" :: T.Macro "end" :: proc_proof st ris tt)
228 let fname = s ^ T.file_ext in
229 begin match !G.list_och with
231 | Some och -> P.fprintf och "%s\n" fname
233 open_out (F.concat !G.out_dir fname)
235 let proc_pair s ss u = function
237 let name = X.rev_map_concat X.id "." "type" ss in
238 let och = open_out_tex name in
239 O.out_text och (proc_item "axiom" s name u);
243 if K.not_prop1 [] u then proc_item "declaration", proc_item "definition"
244 else proc_item "proposition", proc_top_proof
246 let name = X.rev_map_concat X.id "." "type" ss in
247 let och = open_out_tex name in
248 O.out_text och (text_u s name u);
250 let name = X.rev_map_concat X.id "." "body" ss in
251 let och = open_out_tex name in
252 O.out_text och (text_t s name t);
255 let proc_fun ss (r, s, i, u, t) =
256 proc_pair s (s :: ss) u (Some t)
258 let proc_constructor ss (r, s, u) =
259 proc_pair s (s :: ss) u None
261 let proc_type ss (r, s, u, cs) =
262 proc_pair s (s :: ss) u None;
263 L.iter (proc_constructor ss) cs
266 let ss = K.segments_of_uri u in
267 let _, _, _, _, obj = E.get_checked_obj G.status u in
269 | C.Constant (_, s, xt, u, _) -> proc_pair s ss u xt
270 | C.Fixpoint (_, fs, _) -> L.iter (proc_fun ss) fs
271 | C.Inductive (_, _, ts, _) -> L.iter (proc_type ss) ts
273 (* interface functions ******************************************************)
275 let process = proc_obj