X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fcomponents%2Fbinaries%2Fmatex%2Fengine.ml;h=e9ec76e86b1198dabbdeaf3179c7eeb4e995af8b;hb=348f1670b30f52db99187b2e92b45348e18ebbbe;hp=30d833317935253508fb550517c058f4c07b766d;hpb=2ffd7e47f1872878f6af4084074655da5cf3b23e;p=helm.git

diff --git a/matita/components/binaries/matex/engine.ml b/matita/components/binaries/matex/engine.ml
index 30d833317..e9ec76e86 100644
--- a/matita/components/binaries/matex/engine.ml
+++ b/matita/components/binaries/matex/engine.ml
@@ -11,118 +11,257 @@
 
 module F = Filename
 module L = List
+module P = Printf
 module S = String
 
 module U = NUri
 module R = NReference
 module C = NCic
-module P = NCicPp
 module E = NCicEnvironment
+module V = NCicTypeChecker
 
+module X = Ground
 module G = Options
+module K = Kernel
 module T = TeX
 module O = TeXOutput
+module A = Anticipate
+module N = Alpha
 
-let status = new P.status
+type status = {
+   i: string;   (* item name *)
+   n: string;   (* reference name *)
+   s: int list; (* scope *)
+   c: C.context (* context for kernel calls *)
+} 
 
 (* internal functions *******************************************************)
 
-let rec segments_of_string ss l s =
-   match try Some (S.index s '/') with Not_found -> None with
-      | None   -> s :: ss
-      | Some i -> segments_of_string (S.sub s 0 i :: ss) (l-i-1) (S.sub s (i+1) (l-i-1))
+let internal s =
+   X.error ("engine: malformed stack: " ^ s)
 
-let segments_of_uri u =
-   let s = U.string_of_uri u in
-   let s = F.chop_extension s in
-   let l = S.length s in
-   let i = S.index s ':' in
-   let s = S.sub s (i+2) (l-i-2) in
-   segments_of_string [] (l-i-2) s
+let malformed s =
+   X.error ("engine: malformed term: " ^ s)
 
-let rec mk_string sep r = function
-   | []      -> r 
-   | s :: ss -> mk_string sep (s ^ sep ^ r) ss 
+let missing s =
+   X.log ("engine: missing macro for " ^ s)
 
-let alpha c s = s
+(* generic term processing *)
 
-let malformed s =
-   failwith ("MaTeX: malformed term: " ^ s)
+let mk_ptr st name = 
+   if G.is_global_id name then P.sprintf "%s.%s" st.i name else ""
 
-let not_supported () =
-   failwith "MaTeX: object not supported"
+let get_macro s =
+   let rec aux = function
+      | []                        -> "", G.nan
+      | (r, m, a) :: _ when r = s -> m, a
+      | _ :: tl                   -> aux tl
+   in
+   aux !G.macro
 
-let proc_sort = function
-   | C.Prop             -> [T.Macro "Prop"]
-   | C.Type [`Type, u]  -> [T.Macro "Type"; T.arg (U.string_of_uri u)]
-   | C.Type [`CProp, u] -> [T.Macro "Crop"; T.arg (U.string_of_uri u)]
-   | C.Type _           -> malformed "1"
+let get_head = function
+   | C.Const c :: ts ->
+      let s, _ = K.resolve_reference c in
+      let macro, arity = get_macro s in
+      if arity = L.length ts then  Some (macro, ts) else begin missing s; None end 
+   | _               -> None
 
-let proc_gref r = T.Macro "GRef"
+let proc_sort st is = function
+   | C.Prop             -> T.Macro "PROP" :: is
+   | C.Type [`Type, u]  -> T.Macro "TYPE" :: T.arg (U.string_of_uri u) :: is
+   | C.Type [`CProp, u] -> T.Macro "CROP" :: T.arg (U.string_of_uri u) :: is
+   | C.Type _           -> malformed "T1"
 
-let rec proc_term c = function
+let rec proc_term st is = function
    | C.Appl []
    | C.Meta _
-   | C.Implicit _         -> malformed "2" 
-   | C.Rel m              ->
-      let name = L.nth c (m-1) in
-      [T.Macro "LRef"; T.arg name]
-   | C.Appl ts            ->
-      let riss = L.rev_map (proc_term c) ts in
-      T.Macro "Appl" :: T.mk_rev_args riss
-  | C.Prod (s, w, t)      ->
-      let s = alpha c s in
-      let is_w = proc_term c w in
-      let is_t = proc_term (s::c) t in
-      T.Macro "Prod" :: T.arg s :: T.Group is_w :: is_t
-  | C.Lambda (s, w, t)    -> 
-      let s = alpha c s in
-      let is_w = proc_term c w in
-      let is_t = proc_term (s::c) t in
-      T.Macro "Abst" :: T.arg s :: T.Group is_w :: is_t
-  | C.LetIn (s, w, v, t)  -> 
-      let s = alpha c s in
-      let is_w = proc_term c w in
-      let is_v = proc_term c v in
-      let is_t = proc_term (s::c) t in
-      T.Macro "Abbr" :: T.arg s :: T.Group is_w :: T.Group is_v :: is_t
-  | C.Sort s              ->
-      proc_sort s
-  | C.Const r             ->
-      [proc_gref r]
-  | C.Match (w, u, v, ts) ->
-      let is_w = [proc_gref w] in
-      let is_u = proc_term c u in
-      let is_v = proc_term c v in
-      let riss = L.rev_map (proc_term c) ts in
-      T.Macro "Case" :: T.Group is_w :: T.Group is_u :: T.Group is_v :: T.mk_rev_args riss
-
-let proc_term c t = try proc_term c t with
+   | C.Implicit _           -> malformed "T2" 
+   | C.Rel m                ->
+      let name = K.resolve_lref st.c m in
+      T.Macro "LREF" :: T.arg name :: T.free (mk_ptr st name) :: is
+   | C.Appl ts              ->
+      let macro, ts = match get_head ts with
+         | Some (macro, ts) -> macro, ts
+         | None             -> "APPL", ts
+      in
+      let riss = L.rev_map (proc_term st []) ts in
+      T.Macro macro :: T.mk_rev_args riss is
+   | C.Prod (s, w, t)       ->
+      let is_w = proc_term st [] w in
+      let is_t = proc_term {st with c=K.add_dec s w st.c} is t in
+      T.Macro "PROD" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
+   | C.Lambda (s, w, t)     -> 
+      let is_w = proc_term st [] w in
+      let is_t = proc_term {st with c=K.add_dec s w st.c} is t in
+      T.Macro "ABST" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: is_t
+   | C.LetIn (s, w, v, t)   ->
+      let is_w = proc_term st [] w in
+      let is_v = proc_term st [] v in
+      let is_t = proc_term {st with c=K.add_def s w v st.c} is t in
+      T.Macro "ABBR" :: T.arg s :: T.free (mk_ptr st s) :: T.Group is_w :: T.Group is_v :: is_t
+   | C.Sort s               ->
+      proc_sort st is s
+   | C.Const c              ->
+      let s, name = K.resolve_reference c in
+      T.Macro "GREF" :: T.arg name :: T.free s :: is
+   | C.Match (w, u, v, ts)  ->
+      let is_w = proc_term st [] (C.Const w) in
+      let is_u = proc_term st [] u in
+      let is_v = proc_term st [] v in
+      let riss = L.rev_map (proc_term st []) ts in
+      T.Macro "CASE" :: T.Group is_w :: T.Group is_u :: T.Group is_v :: T.mk_rev_args riss is
+
+let proc_term st is t = try proc_term st is t with
    | E.ObjectNotFound _ 
+   | Invalid_argument "List.nth"
    | Failure "nth" 
-   | Invalid_argument "List.nth" -> malformed "3"
+   | Failure "name_of_reference" -> malformed "T3"
+
+(* proof processing *)
+
+let typeof st = function
+   | C.Appl [t]
+   | t          -> K.whd_typeof st.c t
+
+let init i = {
+   i = i;
+   n =  ""; s = [1]; c = [];
+}
+
+let push st n = {st with
+   n = n; s = 1 :: st.s;
+}
+
+let next st f = {st with
+   c = f st.c;
+   n = ""; s = match st.s with [] -> failwith "hd" | i :: tl -> succ i :: tl
+}
+
+let scope st =
+   X.rev_map_concat string_of_int "." "" (L.tl st.s)
+
+let mk_exit st ris =
+   if st.n <> "" || L.tl st.s = [] then ris else
+   T.free (scope st) :: T.Macro "EXIT" :: ris
+
+let mk_open st ris =
+   if st.n = "" then ris else
+   T.free (scope st) :: T.free (mk_ptr st st.n) :: T.arg st.n :: T.Macro "OPEN" :: ris
+
+let mk_dec st kind w s ris =
+   let w = if !G.no_types then [] else w in
+   T.Group w :: T.free (mk_ptr st s) :: T.arg s :: T.Macro kind :: ris
+
+let mk_inferred st t ris =
+   let u = typeof st t in
+   let is_u = proc_term st [] u in
+   mk_dec st "DECL" is_u st.n ris
+
+let rec proc_proof st ris t = match t with
+   | C.Appl []
+   | C.Meta _
+   | C.Implicit _  
+   | C.Sort _
+   | C.Prod _              -> malformed "P1"
+   | C.Const _
+   | C.Rel _               -> proc_proof st ris (C.Appl [t])
+   | C.Lambda (s, w, t)    ->
+      let is_w = proc_term st [] w in
+      let ris = mk_open st ris in
+      proc_proof (next st (K.add_dec s w)) (mk_dec st "PRIM" is_w s ris) t
+   | C.Appl (t0 :: ts)     ->
+      let rts = X.rev_neg_filter (K.not_prop2 st.c) [t0] ts in
+      let ris = T.Macro "STEP" :: mk_inferred st t ris in
+      let tts = L.rev_map (proc_term st []) rts in
+      mk_exit st (T.rev_mk_args tts ris)
+   | C.Match (w, u, v, ts) ->
+      let rts = X.rev_neg_filter (K.not_prop2 st.c) [v] ts in
+      let ris = T.Macro "DEST" :: mk_inferred st t ris in
+      let tts = L.rev_map (proc_term st []) rts in
+      mk_exit st (T.rev_mk_args tts ris)
+   | C.LetIn (s, w, v, t)  -> 
+      let is_w = proc_term st [] w in
+      let ris = mk_open st ris in
+      if K.not_prop1 st.c w then
+         let is_v = proc_term st [] v in
+         let ris = T.Group is_v :: T.Macro "BODY" :: mk_dec st "DECL" is_w s ris in
+         proc_proof (next st (K.add_def s w v)) ris t
+      else
+         let ris_v = proc_proof (push st s) ris v in
+         proc_proof (next st (K.add_def s w v)) ris_v t
+
+let proc_proof st rs t = try proc_proof st rs t with 
+   | E.ObjectNotFound _ 
+   | Invalid_argument "List.nth"
+   | Failure "nth"
+   | Failure "name_of_reference" -> malformed "P2"
+   | V.TypeCheckerFailure s
+   | V.AssertFailure s           -> malformed (Lazy.force s)
+   | Failure "hd"
+   | Failure "tl"                -> internal "P2"
+
+(* top level processing *)
+
+let note = T.Note "This file was automatically generated by MaTeX: do not edit"
+
+let proc_item item s ss t =
+   let st = init ss in
+   let tt = N.process_top_term s t in (* alpha-conversion *)
+   let is = [T.Macro "end"; T.arg item] in
+   note :: T.Macro "begin" :: T.arg item :: T.arg s :: T.free ss :: proc_term st is tt
+
+let proc_top_proof s ss t =
+   let st = init ss in
+   let t0 = A.process_top_term s t in  (* anticipation *)
+   let tt = N.process_top_term s t0 in (* alpha-conversion *)
+   let ris = [T.free ss; T.arg s; T.arg "proof"; T.Macro "begin"; note] in
+   L.rev (T.arg "proof" :: T.Macro "end" :: proc_proof st ris tt)
 
 let open_out_tex s =
-   open_out (F.concat !G.out_dir (s ^ T.file_ext))
+   let fname = s ^ T.file_ext in
+   begin match !G.list_och with
+      | None     -> ()
+      | Some och -> P.fprintf och "%s\n" fname
+   end;
+   open_out (F.concat !G.out_dir fname)
+
+let proc_pair s ss u = function
+   | None   -> 
+      let name = X.rev_map_concat X.id "." "type" ss in
+      let och = open_out_tex name in
+         O.out_text och (proc_item "axiom" s name u);
+      close_out och
+   | Some t ->
+      let text_u, text_t =
+         if K.not_prop1 [] u then proc_item "declaration", proc_item "definition"
+         else proc_item "proposition", proc_top_proof
+      in
+      let name = X.rev_map_concat X.id "." "type" ss in
+      let och = open_out_tex name in
+         O.out_text och (text_u s name u);
+      close_out och;
+      let name = X.rev_map_concat X.id "." "body" ss in
+      let och = open_out_tex name in
+         O.out_text och (text_t s name t);
+      close_out och
+
+let proc_fun ss (r, s, i, u, t) =
+   proc_pair s (s :: ss) u (Some t)
+
+let proc_constructor ss (r, s, u) =
+   proc_pair s (s :: ss) u None
+
+let proc_type ss (r, s, u, cs) =
+   proc_pair s (s :: ss) u None;
+   L.iter (proc_constructor ss) cs
 
 let proc_obj u =
-   let ss = segments_of_uri u in
-   let _, _, _, _, obj = E.get_checked_obj status u in 
-   match obj with
-      | C.Constant (_, _, None, u, _)   -> not_supported ()
-      | C.Constant (_, _, Some t, u, _) ->
-         let name = mk_string "." "body" ss in
-         let och = open_out_tex name in
-         O.out_text och (proc_term [] t);
-         O.out_text och T.newline;
-         close_out och;
-         let name = mk_string "." "type" ss in
-         let och = open_out_tex name in
-         O.out_text och (proc_term [] u);
-         O.out_text och T.newline;
-         close_out och
-      | C.Fixpoint (_, _, _)            -> not_supported ()
-      | C.Inductive (_, _, _, _)        -> not_supported ()
+   let ss = K.segments_of_uri u in
+   let _, _, _, _, obj = E.get_checked_obj G.status u in 
+   match obj with 
+      | C.Constant (_, s, xt, u, _) -> proc_pair s ss u xt
+      | C.Fixpoint (_, fs, _)       -> L.iter (proc_fun ss) fs
+      | C.Inductive (_, _, ts, _)   -> L.iter (proc_type ss) ts
 
 (* interface functions ******************************************************)