X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Fng_kernel%2FnCicPp.ml;h=00ea9f24e32e5a79b2a71877d6361c9e13cd9a49;hb=01001c883a8151edba81cd03a6f254d24a81c867;hp=b21274fea109915daca66ea3d1aab10f3501b9d2;hpb=08e9d02504942642a917c0d3e4b4795e65172d89;p=helm.git diff --git a/helm/software/components/ng_kernel/nCicPp.ml b/helm/software/components/ng_kernel/nCicPp.ml index b21274fea..00ea9f24e 100644 --- a/helm/software/components/ng_kernel/nCicPp.ml +++ b/helm/software/components/ng_kernel/nCicPp.ml @@ -1,50 +1,191 @@ +(* + ||M|| This file is part of HELM, an Hypertextual, Electronic + ||A|| Library of Mathematics, developed at the Computer Science + ||T|| Department, University of Bologna, Italy. + ||I|| + ||T|| HELM is free software; you can redistribute it and/or + ||A|| modify it under the terms of the GNU General Public License + \ / version 2 or (at your option) any later version. + \ / This software is distributed as is, NO WARRANTY. + V_______________________________________________________________ *) + +(* $Id$ *) + let ppterm = - ref (fun ~context ~subst ~metasenv t -> "Please, set a pp callback") + ref (fun ~context:_ ~subst:_ ~metasenv:_ ?inside_fix _ -> + ignore (inside_fix) ; "Please, set a pp callback") ;; let set_ppterm f = ppterm := f;; -let ppterm ?(context=[]) ?(subst=[]) ?(metasenv=[]) t = - !ppterm ~context ~subst ~metasenv t +let ppterm ~context ~subst ~metasenv ?inside_fix t = + !ppterm ~context ~subst ~metasenv ?inside_fix t ;; module C = NCic module R = NReference -let trivial_pp_term ~context ~subst ~metasenv = - let rec aux ctx = function +let r2s pp_fix_name r = + try + match r with + | R.Ref (u,R.Ind (_,i,_)) -> + (match NCicLibrary.get_obj u with + | _,_,_,_, C.Inductive (_,_,itl,_) -> + let _,name,_,_ = List.nth itl i in name + | _ -> assert false) + | R.Ref (u,R.Con (i,j,_)) -> + (match NCicLibrary.get_obj u with + | _,_,_,_, C.Inductive (_,_,itl,_) -> + let _,_,_,cl = List.nth itl i in + let _,name,_ = List.nth cl (j-1) in name + | _ -> assert false) + | R.Ref (u,(R.Decl | R.Def _)) -> + (match NCicLibrary.get_obj u with + | _,_,_,_, C.Constant (_,name,_,_,_) -> name + | _ -> assert false) + | R.Ref (u,(R.Fix (i,_,_)|R.CoFix i)) -> + (match NCicLibrary.get_obj u with + | _,_,_,_, C.Fixpoint (_,fl,_) -> + if pp_fix_name then + let _,name,_,_,_ = List.nth fl i in name + else + NUri.name_of_uri u ^"("^ string_of_int i ^ ")" + | _ -> assert false) + with NCicLibrary.ObjectNotFound _ -> R.string_of_reference r +;; + +let trivial_pp_term ~context ~subst:_ ~metasenv:_ ?(inside_fix=false) t = + let buff = Buffer.create 100 in + let f = Format.formatter_of_buffer buff in + let module F = Format in + let rec aux ?(toplevel=false) ctx = function | C.Rel m -> - (try List.nth ctx (m-1) - with Failure _ -> " -" ^ string_of_int (m - List.length context)) - | C.Const r -> R.string_of_reference r - | C.Prod (name,s,t) -> "(\Pi "^name^":"^aux ctx s^"."^aux (name::ctx) t^")" + (try + let name = List.nth ctx (m-1) in + F.fprintf f "%s" (if name = "_" then "__"^string_of_int m else name) + with Failure _ -> F.fprintf f " -%d" (m - List.length ctx)) + | C.Const r -> F.fprintf f "%s" (r2s inside_fix r) + | C.Prod ("_",s,t) -> + if not toplevel then F.fprintf f "("; + F.fprintf f "@["; + (match s with + | C.Prod ("_",_,_) -> aux ~toplevel:false ctx s + | _ -> aux ~toplevel:true ctx s); + F.fprintf f "@;→ "; + aux ~toplevel:true ("_"::ctx) t; + F.fprintf f "@]"; + if not toplevel then F.fprintf f ")"; + | C.Prod (name,s,t) -> + if not toplevel then F.fprintf f "("; + F.fprintf f "@["; + F.fprintf f "@[∀%s:@;" name; + aux ~toplevel:true ctx s; + F.fprintf f "@].@;"; + aux ~toplevel:true (name::ctx) t; + F.fprintf f "@]"; + if not toplevel then F.fprintf f ")"; | C.Lambda (name,s,t) -> - "(\lambda "^name^":"^aux ctx s^"."^aux (name::ctx) t^")" + if not toplevel then F.fprintf f "("; + F.fprintf f "@["; + F.fprintf f "λ%s:" name; + aux ~toplevel:true ctx s; + F.fprintf f ".@;"; + aux ~toplevel:true (name::ctx) t; + F.fprintf f "@]"; + if not toplevel then F.fprintf f ")"; | C.LetIn (name,ty,t,b) -> - "(let "^name^":"^aux ctx ty^":="^aux ctx t^" in "^aux (name::ctx) b^")" - | C.Match (_,oty,t,pl) -> - " match " ^ aux ctx t ^ " return " ^ aux ctx oty ^ "[" ^ - String.concat "|" (List.map (aux ctx) pl) ^ "]" - | C.Appl l -> "("^String.concat " " (List.map (aux ctx) l) ^")" - | C.Implicit _ -> "?" - | C.Meta (n,_) -> "?"^string_of_int n - | C.Sort C.Prop -> "Prop" - | C.Sort C.CProp -> "CProp" - | C.Sort (C.Type n) -> "Type"^string_of_int n + if not toplevel then F.fprintf f "("; + F.fprintf f "@["; + F.fprintf f "let %s:@;" name; + aux ~toplevel:true ctx ty; + F.fprintf f "@;≝ "; + aux ~toplevel:true ctx t; + F.fprintf f "@;in@;"; + (aux ~toplevel:true (name::ctx) b); + F.fprintf f "@]"; + if not toplevel then F.fprintf f ")"; + | C.Match (r,oty,t,pl) -> + F.fprintf f "@[match "; + aux ~toplevel:true ctx t; + F.fprintf f "@;return "; + aux ~toplevel:true ctx oty; + F.fprintf f "@; @[[ "; + if pl <> [] then + begin + F.fprintf f "@[%s ⇒@;" (r2s inside_fix (R.mk_constructor 1 r)); + aux ~toplevel:true ctx (List.hd pl); + F.fprintf f "@]"; + ignore(List.fold_left + (fun i t -> + F.fprintf f "@;| @[%s ⇒@;" (r2s inside_fix (R.mk_constructor i r)); + aux ~toplevel:true ctx t; + F.fprintf f "@]"; + i+1) + 2 (List.tl pl)); + end; + F.fprintf f "]@] @]"; + | C.Appl l -> + F.fprintf f "@["; + if not toplevel then F.fprintf f "("; + aux ctx (List.hd l); + List.iter (fun x -> F.fprintf f "@;";aux ctx x) (List.tl l); + if not toplevel then F.fprintf f ")"; + F.fprintf f "@]" + | C.Implicit _ -> F.fprintf f "?" + | C.Meta (n,_) -> F.fprintf f "?%d" n + | C.Sort C.Prop -> F.fprintf f "Prop" + | C.Sort (C.Type []) -> F.fprintf f "IllFormedUniverse" + | C.Sort (C.Type [false, u]) -> F.fprintf f "%s" (NUri.name_of_uri u) + | C.Sort (C.Type [true, u]) -> F.fprintf f "S(%s)" (NUri.name_of_uri u) + | C.Sort (C.Type l) -> + F.fprintf f "Max("; + aux ctx (C.Sort (C.Type [List.hd l])); + List.iter (fun x -> F.fprintf f ",";aux ctx (C.Sort (C.Type [x]))) + (List.tl l); + F.fprintf f ")" in - aux (List.map fst context) + aux ~toplevel:true (List.map fst context) t; + F.fprintf f "@?"; + Buffer.contents buff ;; let ppobj = function - | (u,_,_,_,NCic.Fixpoint (b, fl, _)) -> - "let rec "^NUri.string_of_uri u^"\n"^ - String.concat "\nand " + | (u,_,metasenv,subst,NCic.Fixpoint (b, fl, _)) -> + "{"^NUri.string_of_uri u^"}\n"^ + (if b then "let rec " else "let corec ") ^ + String.concat "\nand " (List.map (fun (_,name,n,ty,bo) -> - name ^ " on " ^ string_of_int n ^ " : " ^ ppterm ty ^ " :=\n"^ - ppterm bo) fl) - | (u,_,_,_,NCic.Inductive (b, _,tl, _)) -> "inductive" - | (u,_,_,_,NCic.Constant (_,_,_, _, _)) -> "constant" + name^ " on " ^ string_of_int n ^ " : " ^ + ppterm ~metasenv ~subst ~context:[] ty ^ " :=\n"^ + ppterm ~metasenv ~subst ~context:[] ~inside_fix:true bo) fl) + | (u,_,metasenv,subst,NCic.Inductive (b, leftno,tyl, _)) -> + "{"^NUri.string_of_uri u^"} with "^string_of_int leftno^" fixed params\n"^ + (if b then "inductive " else "coinductive ")^ + String.concat "\nand " + (List.map (fun (_,name,ty,cl) -> + name^": "^ppterm ~metasenv ~subst ~context:[] ty^ " :=\n"^ + String.concat "\n" + (List.map (fun (_,name,ty) -> + " | "^name^": "^ppterm ~metasenv ~subst ~context:[] ty) + cl)) tyl) ^ "." + | (u,_,metasenv,subst,NCic.Constant (_,name,None,ty, _)) -> + "{"^NUri.string_of_uri u^"}\n"^ + "axiom " ^ name ^ " : " ^ + ppterm ~metasenv ~subst ~context:[] ty ^ "\n" + | (u,_,metasenv,subst,NCic.Constant (_,name,Some bo,ty, _)) -> + "{"^NUri.string_of_uri u^"}\n"^ + "definition " ^ name ^ " : " ^ + ppterm ~metasenv ~subst ~context:[] ty ^ " := \n"^ + ppterm ~metasenv ~subst ~context:[] bo ^ "\n" ;; - - +let rec ppcontext ~subst ~metasenv = function + | [] -> "" + | (name, NCic.Decl t) :: tl -> + ppcontext ~subst ~metasenv tl ^ + name ^ ": " ^ ppterm ~subst ~metasenv ~context:tl t ^ "\n" + | (name, NCic.Def (bo,ty)) :: tl-> + ppcontext ~subst ~metasenv tl ^ + name ^ ": " ^ ppterm ~subst ~metasenv ~context:tl ty ^ + " := " ^ ppterm ~subst ~metasenv ~context:tl bo ^ "\n" +;;