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)
46 (* generic term processing *)
49 if G.is_global_id name then P.sprintf "%s.%s" st.i name else ""
51 let proc_sort st is = function
52 | C.Prop -> T.Macro "PROP" :: is
53 | C.Type [`Type, u] -> T.Macro "TYPE" :: T.arg (U.string_of_uri u) :: is
54 | C.Type [`CProp, u] -> T.Macro "CROP" :: T.arg (U.string_of_uri u) :: is
55 | C.Type _ -> malformed "T1"
57 let rec proc_term st is = function
60 | C.Implicit _ -> malformed "T2"
62 let name = K.resolve_lref st.c m in
63 T.Macro "LREF" :: T.arg name :: T.free (mk_ptr st name) :: is
65 let riss = L.rev_map (proc_term st []) ts in
66 T.Macro "APPL" :: T.mk_rev_args riss is
68 let is_w = proc_term st [] w in
69 let is_t = proc_term {st with c=K.add_dec s w st.c} is t in
70 T.Macro "PROD" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
71 | C.Lambda (s, w, t) ->
72 let is_w = proc_term st [] w in
73 let is_t = proc_term {st with c=K.add_dec s w st.c} is t in
74 T.Macro "ABST" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
75 | C.LetIn (s, w, v, t) ->
76 let is_w = proc_term st [] w in
77 let is_v = proc_term st [] v in
78 let is_t = proc_term {st with c=K.add_def s w v st.c} is t in
79 T.Macro "ABBR" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: T.Group is_v :: is_t
82 | C.Const (R.Ref (u, r)) ->
83 let ss = K.segments_of_uri u in
84 let _, _, _, _, obj = E.get_checked_obj G.status u in
85 let ss, name = K.name_of_reference ss (obj, r) in
86 T.Macro "GREF" :: T.arg name :: T.free (X.rev_map_concat X.id "." "type" ss) :: is
87 | C.Match (w, u, v, ts) ->
88 let is_w = proc_term st [] (C.Const w) in
89 let is_u = proc_term st [] u in
90 let is_v = proc_term st [] v in
91 let riss = L.rev_map (proc_term st []) ts in
92 T.Macro "CASE" :: T.Group is_w :: T.Group is_u :: T.Group is_v :: T.mk_rev_args riss is
94 let proc_term st is t = try proc_term st is t with
96 | Invalid_argument "List.nth"
98 | Failure "name_of_reference" -> malformed "T3"
100 (* proof processing *)
102 let typeof st = function
104 | t -> K.whd_typeof st.c t
108 n = ""; s = [1]; c = [];
111 let push st n = {st with
112 n = n; s = 1 :: st.s;
115 let next st f = {st with
117 n = ""; s = match st.s with [] -> failwith "hd" | i :: tl -> succ i :: tl
121 X.rev_map_concat string_of_int "." "" (L.tl st.s)
124 if st.n <> "" || L.tl st.s = [] then ris else
125 T.free (scope st) :: T.Macro "EXIT" :: ris
128 if st.n = "" then ris else
129 T.free (scope st) :: T.free (mk_ptr st st.n) :: T.arg st.n :: T.Macro "OPEN" :: ris
131 let mk_dec st kind w s ris =
132 let w = if !G.no_types then [] else w in
133 T.Group w :: T.free (mk_ptr st s) :: T.arg s :: T.Macro kind :: ris
135 let mk_inferred st t ris =
136 let u = typeof st t in
137 let is_u = proc_term st [] u in
138 mk_dec st "DECL" is_u st.n ris
140 let rec proc_proof st ris t = match t with
145 | C.Prod _ -> malformed "P1"
147 | C.Rel _ -> proc_proof st ris (C.Appl [t])
148 | C.Lambda (s, w, t) ->
149 let is_w = proc_term st [] w in
150 let ris = mk_open st ris in
151 proc_proof (next st (K.add_dec s w)) (mk_dec st "PRIM" is_w s ris) t
152 | C.Appl (t0 :: ts) ->
153 let rts = X.rev_neg_filter (K.not_prop2 st.c) [t0] ts in
154 let ris = T.Macro "STEP" :: mk_inferred st t ris in
155 let tts = L.rev_map (proc_term st []) rts in
156 mk_exit st (T.rev_mk_args tts ris)
157 | C.Match (w, u, v, ts) ->
158 let rts = X.rev_neg_filter (K.not_prop2 st.c) [v] ts in
159 let ris = T.Macro "DEST" :: mk_inferred st t ris in
160 let tts = L.rev_map (proc_term st []) rts in
161 mk_exit st (T.rev_mk_args tts ris)
162 | C.LetIn (s, w, v, t) ->
163 let is_w = proc_term st [] w in
164 let ris = mk_open st ris in
165 if K.not_prop1 st.c w then
166 let is_v = proc_term st [] v in
167 let ris = T.Group is_v :: T.Macro "BODY" :: mk_dec st "DECL" is_w s ris in
168 proc_proof (next st (K.add_def s w v)) ris t
170 let ris_v = proc_proof (push st s) ris v in
171 proc_proof (next st (K.add_def s w v)) ris_v t
173 let proc_proof st rs t = try proc_proof st rs t with
175 | Invalid_argument "List.nth"
177 | Failure "name_of_reference" -> malformed "P2"
178 | V.TypeCheckerFailure s
179 | V.AssertFailure s -> malformed (Lazy.force s)
181 | Failure "tl" -> internal "P2"
183 (* top level processing *)
185 let note = T.Note "This file was automatically generated by MaTeX: do not edit"
187 let proc_item item s ss t =
189 let tt = N.process_top_term s t in (* alpha-conversion *)
190 let is = [T.Macro "end"; T.arg item] in
191 note :: T.Macro "begin" :: T.arg item :: T.arg s :: T.free ss :: proc_term st is tt
193 let proc_top_proof s ss t =
195 let t0 = A.process_top_term s t in (* anticipation *)
196 let tt = N.process_top_term s t0 in (* alpha-conversion *)
197 let ris = [T.free ss; T.arg s; T.arg "proof"; T.Macro "begin"; note] in
198 L.rev (T.arg "proof" :: T.Macro "end" :: proc_proof st ris tt)
201 let fname = s ^ T.file_ext in
202 begin match !G.list_och with
204 | Some och -> P.fprintf och "%s\n" fname
206 open_out (F.concat !G.out_dir fname)
208 let proc_pair s ss u = function
210 let name = X.rev_map_concat X.id "." "type" ss in
211 let och = open_out_tex name in
212 O.out_text och (proc_item "axiom" s name u);
216 if K.not_prop1 [] u then proc_item "declaration", proc_item "definition"
217 else proc_item "proposition", proc_top_proof
219 let name = X.rev_map_concat X.id "." "type" ss in
220 let och = open_out_tex name in
221 O.out_text och (text_u s name u);
223 let name = X.rev_map_concat X.id "." "body" ss in
224 let och = open_out_tex name in
225 O.out_text och (text_t s name t);
228 let proc_fun ss (r, s, i, u, t) =
229 proc_pair s (s :: ss) u (Some t)
231 let proc_constructor ss (r, s, u) =
232 proc_pair s (s :: ss) u None
234 let proc_type ss (r, s, u, cs) =
235 proc_pair s (s :: ss) u None;
236 L.iter (proc_constructor ss) cs
239 let ss = K.segments_of_uri u in
240 let _, _, _, _, obj = E.get_checked_obj G.status u in
242 | C.Constant (_, s, xt, u, _) -> proc_pair s ss u xt
243 | C.Fixpoint (_, fs, _) -> L.iter (proc_fun ss) fs
244 | C.Inductive (_, _, ts, _) -> L.iter (proc_type ss) ts
246 (* interface functions ******************************************************)
248 let process = proc_obj