F.fprintf f "@[<hov 1>";
aux ~toplevel:true ctx s;
F.fprintf f "@;→ ";
- aux ~toplevel ("_"::ctx) t;
+ aux ~toplevel:true ("_"::ctx) t;
F.fprintf f "@]";
if not toplevel then F.fprintf f ")";
| C.Prod (name,s,t) ->
F.fprintf f "@[<hov 2>∀%s:@;" name;
aux ~toplevel:true ctx s;
F.fprintf f "@].@;";
- aux ~toplevel (name::ctx) t;
+ aux ~toplevel:true (name::ctx) t;
F.fprintf f "@]";
if not toplevel then F.fprintf f ")";
| C.Lambda (name,s,t) ->
F.fprintf f "λ%s:" name;
aux ~toplevel:true ctx s;
F.fprintf f ".@;";
- aux ~toplevel (name::ctx) t;
+ aux ~toplevel:true (name::ctx) t;
F.fprintf f "@]";
if not toplevel then F.fprintf f ")";
| C.LetIn (name,ty,t,b) ->
F.fprintf f "@;≝ ";
aux ~toplevel:true ctx t;
F.fprintf f "@;in@;";
- (aux ~toplevel (name::ctx) b);
+ (aux ~toplevel:true (name::ctx) b);
F.fprintf f "@]";
if not toplevel then F.fprintf f ")";
| C.Match (r,oty,t,pl) ->
| (u,_,metasenv,subst,NCic.Fixpoint (b, fl, _)) ->
"{"^NUri.string_of_uri u^"}\n"^
"let rec "^
- String.concat "\nand " (fst
- (List.fold_right (fun (_,name,n,ty,bo) (l,i) ->
- ((name^
- " on " ^ string_of_int n ^ " : " ^
+ String.concat "\nand "
+ (List.map (fun (_,name,n,ty,bo) ->
+ name^ " on " ^ string_of_int n ^ " : " ^
ppterm ~metasenv ~subst ~context:[] ty ^ " :=\n"^
- ppterm ~metasenv ~subst ~context:[] ~inside_fix:true bo) :: l),i-1) fl
- ([],List.length fl)))
- | (u,_,_,_,NCic.Inductive (b, _,tyl, _)) -> "inductive"
+ ppterm ~metasenv ~subst ~context:[] ~inside_fix:true bo) fl)
+ | (u,_,metasenv,subst,NCic.Inductive (b, leftno,tyl, _)) ->
+ "{"^NUri.string_of_uri u^"}\n"^
+ "inductive ("^string_of_int leftno^") "^
+ 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, _)) ->
"axiom " ^ name ^ " : " ^
ppterm ~metasenv ~subst ~context:[] ty ^ "\n"