1 (* Copyright (C) 2004-2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://helm.cs.unibo.it/
30 module Ast = CicNotationPt
31 module Env = CicNotationEnv
33 (* when set to true debugging information, not in sync with input syntax, will
34 * be added to the output of pp_term.
35 * set to false if you need, for example, cut and paste from matitac output to
37 let debug_printing = true
39 let pp_binder = function
46 if debug_printing then
47 (function (* debugging version *)
48 | `Symbol s -> sprintf "symbol(%s)" s
49 | `Keyword s -> sprintf "keyword(%s)" s
50 | `Number s -> sprintf "number(%s)" s)
59 (* `None -> "`None" *)
66 | `IdRef id -> sprintf "x(%s)" id
70 (List.map (fun (_, n, v) -> sprintf "%s=%s" n v) attrs))
71 | `Level (prec) -> sprintf "L(%d)" prec
74 | `ChildPos p -> sprintf "P(%s)" (pp_pos p)
76 let pp_capture_variable pp_term =
78 | term, None -> pp_term (* ~pp_parens:false *) term
79 | term, Some typ -> "(" ^ pp_term (* ~pp_parens:false *) term ^ ": " ^ pp_term typ ^ ")"
81 let rec pp_term ?(pp_parens = true) t =
84 | Ast.AttributedTerm (attr, term) when debug_printing ->
85 sprintf "%s[%s]" (pp_attribute attr) (pp_term ~pp_parens:false term)
86 | Ast.AttributedTerm (`Raw text, _) -> text
87 | Ast.AttributedTerm (_, term) -> pp_term ~pp_parens:false term
89 sprintf "%s" (String.concat " " (List.map pp_term terms))
90 | Ast.Binder (`Forall, (Ast.Ident ("_", None), typ), body)
91 | Ast.Binder (`Pi, (Ast.Ident ("_", None), typ), body) ->
93 (match typ with None -> "?" | Some typ -> pp_term typ)
94 (pp_term ~pp_parens:true body)
95 | Ast.Binder (kind, var, body) ->
96 sprintf "\\%s %s.%s" (pp_binder kind) (pp_capture_variable pp_term var)
97 (pp_term ~pp_parens:true body)
98 | Ast.Case (term, indtype, typ, patterns) ->
99 sprintf "match %s%s%s with %s"
103 | Some (ty, href_opt) ->
104 sprintf " in %s%s" ty
105 (match debug_printing, href_opt with
107 sprintf "(i.e.%s)" (UriManager.string_of_uri uri)
109 (match typ with None -> "" | Some t -> sprintf " return %s" (pp_term t))
110 (pp_patterns patterns)
111 | Ast.Cast (t1, t2) -> sprintf "(%s: %s)" (pp_term ~pp_parens:true t1) (pp_term ~pp_parens:true t2)
112 | Ast.LetIn ((var,t2), t1, t3) ->
113 (* let t2 = match t2 with None -> Ast.Implicit | Some t -> t in *)
114 sprintf "let %s \\def %s in %s" (pp_term var)
115 (* (pp_term ~pp_parens:true t2) *)
116 (pp_term ~pp_parens:true t1)
117 (pp_term ~pp_parens:true t3)
118 | Ast.LetRec (kind, definitions, term) ->
119 let rec get_guard i = function
120 | [] -> (*assert false*) Ast.Implicit
121 | [term, _] when i = 1 -> term
122 | _ :: tl -> get_guard (pred i) tl
124 let map (params, (id,typ), body, i) =
130 sprintf "%s %s on %s: %s \\def %s"
131 (pp_term ~pp_parens:false term)
132 (String.concat " " (List.map (pp_capture_variable pp_term) params))
133 (pp_term ~pp_parens:false (get_guard i params))
134 (pp_term typ) (pp_term body)
136 sprintf "let %s %s in %s"
137 (match kind with `Inductive -> "rec" | `CoInductive -> "corec")
138 (String.concat " and " (List.map map definitions))
140 | Ast.Ident (name, Some []) | Ast.Ident (name, None)
141 | Ast.Uri (name, Some []) | Ast.Uri (name, None) ->
143 | Ast.Ident (name, Some substs)
144 | Ast.Uri (name, Some substs) ->
145 sprintf "%s \\subst [%s]" name (pp_substs substs)
146 | Ast.Implicit -> "?"
147 | Ast.Meta (index, substs) ->
148 sprintf "%d[%s]" index
150 (List.map (function None -> "_" | Some t -> pp_term t) substs))
151 | Ast.Num (num, _) -> num
152 | Ast.Sort `Set -> "Set"
153 | Ast.Sort `Prop -> "Prop"
154 | Ast.Sort (`Type _) -> "Type"
155 | Ast.Sort (`CProp _)-> "CProp"
156 | Ast.Sort (`NType s)-> "Type[" ^ s ^ "]"
157 | Ast.Symbol (name, _) -> "'" ^ name
159 | Ast.UserInput -> ""
161 | Ast.Literal l -> pp_literal l
162 | Ast.Layout l -> pp_layout l
163 | Ast.Magic m -> pp_magic m
164 | Ast.Variable v -> pp_variable v
166 match pp_parens, t with
170 | true, Ast.Ident (_, Some [])
171 | true, Ast.Ident (_, None) -> t_pp
172 | _ -> sprintf "(%s)" t_pp
174 and pp_subst (name, term) = sprintf "%s \\Assign %s" name (pp_term term)
175 and pp_substs substs = String.concat "; " (List.map pp_subst substs)
179 Ast.Pattern (head, href, vars), term ->
182 (match debug_printing, href with
183 | true, Some uri -> sprintf "(i.e.%s)" (UriManager.string_of_uri uri)
186 sprintf "%s \\Rightarrow %s"
190 sprintf "(%s %s)" head_pp
191 (String.concat " " (List.map (pp_capture_variable pp_term) vars)))
193 | Ast.Wildcard, term ->
194 sprintf "_ \\Rightarrow %s" (pp_term term)
196 and pp_patterns patterns =
197 sprintf "[%s]" (String.concat " | " (List.map pp_pattern patterns))
199 and pp_box_spec (kind, spacing, indent) =
200 let int_of_bool b = if b then 1 else 0 in
203 Ast.H -> "H" | Ast.V -> "V" | Ast.HV -> "HV" | Ast.HOV -> "HOV"
205 sprintf "%sBOX%d%d" kind_string (int_of_bool spacing) (int_of_bool indent)
207 and pp_layout = function
208 | Ast.Sub (t1, t2) -> sprintf "%s \\SUB %s" (pp_term t1) (pp_term t2)
209 | Ast.Sup (t1, t2) -> sprintf "%s \\SUP %s" (pp_term t1) (pp_term t2)
210 | Ast.Below (t1, t2) -> sprintf "%s \\BELOW %s" (pp_term t1) (pp_term t2)
211 | Ast.Above (t1, t2) -> sprintf "%s \\ABOVE %s" (pp_term t1) (pp_term t2)
212 | Ast.Over (t1, t2) -> sprintf "[%s \\OVER %s]" (pp_term t1) (pp_term t2)
213 | Ast.Atop (t1, t2) -> sprintf "[%s \\ATOP %s]" (pp_term t1) (pp_term t2)
214 | Ast.Frac (t1, t2) -> sprintf "\\FRAC %s %s" (pp_term t1) (pp_term t2)
215 | Ast.InfRule (t1, t2, t3) -> sprintf "\\INFRULE %s %s %s" (pp_term t1) (pp_term t2) (pp_term t3)
216 | Ast.Sqrt t -> sprintf "\\SQRT %s" (pp_term t)
217 | Ast.Root (arg, index) ->
218 sprintf "\\ROOT %s \\OF %s" (pp_term index) (pp_term arg)
219 | Ast.Break -> "\\BREAK"
220 (* | Space -> "\\SPACE" *)
221 | Ast.Box (box_spec, terms) ->
222 sprintf "\\%s [%s]" (pp_box_spec box_spec)
223 (String.concat " " (List.map pp_term terms))
225 sprintf "\\GROUP [%s]" (String.concat " " (List.map pp_term terms))
226 | Ast.Mstyle (l,terms) ->
227 sprintf "\\MSTYLE %s [%s]"
228 (String.concat " " (List.map (fun (k,v) -> k^"="^v) l))
229 (String.concat " " (List.map pp_term terms))
230 | Ast.Mpadded (l,terms) ->
231 sprintf "\\MSTYLE %s [%s]"
232 (String.concat " " (List.map (fun (k,v) -> k^"="^v) l))
233 (String.concat " " (List.map pp_term terms))
235 and pp_magic = function
236 | Ast.List0 (t, sep_opt) ->
237 sprintf "list0 %s%s" (pp_term t) (pp_sep_opt sep_opt)
238 | Ast.List1 (t, sep_opt) ->
239 sprintf "list1 %s%s" (pp_term t) (pp_sep_opt sep_opt)
240 | Ast.Opt t -> sprintf "opt %s" (pp_term t)
241 | Ast.Fold (kind, p_base, names, p_rec) ->
242 let acc = match names with acc :: _ -> acc | _ -> assert false in
243 sprintf "fold %s %s rec %s %s"
244 (pp_fold_kind kind) (pp_term p_base) acc (pp_term p_rec)
245 | Ast.Default (p_some, p_none) ->
246 sprintf "default %s %s" (pp_term p_some) (pp_term p_none)
247 | Ast.If (p_test, p_true, p_false) ->
248 sprintf "if %s then %s else %s"
249 (pp_term p_test) (pp_term p_true) (pp_term p_false)
252 and pp_fold_kind = function
256 and pp_sep_opt = function
258 | Some sep -> sprintf " sep %s" (pp_literal sep)
260 and pp_variable = function
261 | Ast.NumVar s -> "number " ^ s
262 | Ast.IdentVar s -> "ident " ^ s
263 | Ast.TermVar (s,Ast.Self _) -> s
264 | Ast.TermVar (s,Ast.Level l) -> "term " ^string_of_int l
265 | Ast.Ascription (t, n) -> assert false
266 | Ast.FreshVar n -> "fresh " ^ n
268 let _pp_term = ref (pp_term ~pp_parens:false)
269 let pp_term t = !_pp_term t
270 let set_pp_term f = _pp_term := f
272 let pp_params pp_term = function
274 | params -> " " ^ String.concat " " (List.map (pp_capture_variable pp_term) params)
276 let pp_flavour = function
277 | `Definition -> "definition"
278 | `MutualDefinition -> assert false
282 | `Remark -> "remark"
283 | `Theorem -> "theorem"
284 | `Variant -> "variant"
287 let pp_fields pp_term fields =
288 (if fields <> [] then "\n" else "") ^
291 (fun (name,ty,coercion,arity) ->
293 if coercion then (":" ^
294 if arity > 0 then string_of_int arity else "" ^ ">") else ": " ^
297 let pp_obj pp_term = function
298 | Ast.Inductive (params, types) ->
299 let pp_constructors constructors =
301 (List.map (fun (name, typ) -> sprintf "| %s: %s" name (pp_term typ))
304 let pp_type (name, _, typ, constructors) =
305 sprintf "\nwith %s: %s \\def\n%s" name (pp_term typ)
306 (pp_constructors constructors)
310 | (name, inductive, typ, constructors) :: tl ->
312 sprintf "%sinductive %s%s: %s \\def\n%s"
313 (if inductive then "" else "co") name (pp_params pp_term params)
314 (pp_term typ) (pp_constructors constructors)
316 fst_typ_pp ^ String.concat "" (List.map pp_type tl))
317 | Ast.Theorem (`MutualDefinition, name, typ, body) ->
318 sprintf "<<pretty printing of mutual definitions not implemented yet>>"
319 | Ast.Theorem (flavour, name, typ, body) ->
320 sprintf "%s %s:\n %s\n%s"
326 | Some body -> "\\def\n " ^ pp_term body)
327 | Ast.Record (params,name,ty,fields) ->
328 "record " ^ name ^ " " ^ pp_params pp_term params ^ ": " ^ pp_term ty ^
329 " \\def {" ^ pp_fields pp_term fields ^ "\n}"
331 let rec pp_value = function
332 | Env.TermValue t -> sprintf "$%s$" (pp_term t)
333 | Env.StringValue s -> sprintf "\"%s\"" s
334 | Env.NumValue n -> n
335 | Env.OptValue (Some v) -> "Some " ^ pp_value v
336 | Env.OptValue None -> "None"
337 | Env.ListValue l -> sprintf "[%s]" (String.concat "; " (List.map pp_value l))
339 let rec pp_value_type =
341 | Env.TermType l -> "Term "^string_of_int l
342 | Env.StringType -> "String"
343 | Env.NumType -> "Number"
344 | Env.OptType t -> "Maybe " ^ pp_value_type t
345 | Env.ListType l -> "List " ^ pp_value_type l
350 (fun (name, (ty, value)) ->
351 sprintf "%s : %s = %s" name (pp_value_type ty) (pp_value value))
354 let rec pp_cic_appl_pattern = function
355 | Ast.UriPattern uri -> UriManager.string_of_uri uri
356 | Ast.VarPattern name -> name
357 | Ast.ImplicitPattern -> "_"
358 | Ast.ApplPattern aps ->
359 sprintf "(%s)" (String.concat " " (List.map pp_cic_appl_pattern aps))