1 (* Copyright (C) 2000, 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://cs.unibo.it/helm/.
26 (*****************************************************************************)
30 (* This module implements a very simple Coq-like pretty printer that, given *)
31 (* an object of cic (internal representation) returns a string describing *)
32 (* the object in a syntax similar to that of coq *)
34 (* It also contains the utility functions to check a name w.r.t the Matita *)
37 (*****************************************************************************)
41 exception CicPpInternalError;;
42 exception NotEnoughElements;;
44 (* Utility functions *)
49 | Cic.Anonymous -> "_"
52 (* get_nth l n returns the nth element of the list l if it exists or *)
53 (* raises NotEnoughElements if l has less than n elements *)
57 | (n, he::tail) when n > 1 -> get_nth tail (n-1)
58 | (_,_) -> raise NotEnoughElements
62 (* pretty-prints a term t of cic in an environment l where l is a list of *)
63 (* identifier names used to resolve DeBrujin indexes. The head of l is the *)
64 (* name associated to the greatest DeBrujin index in t *)
71 (match get_nth l n with
73 | Some C.Anonymous -> "__" ^ string_of_int n
74 | None -> "_hidden_" ^ string_of_int n
77 NotEnoughElements -> string_of_int (List.length l - n)
79 | C.Var (uri,exp_named_subst) ->
80 UriManager.string_of_uri (*UriManager.name_of_uri*) uri ^ pp_exp_named_subst exp_named_subst l
82 "?" ^ (string_of_int n) ^ "[" ^
84 (List.rev_map (function None -> "_" | Some t -> pp t l) l1) ^
91 (*| C.Type u -> ("Type" ^ CicUniv.string_of_universe u)*)
94 | C.Implicit (Some `Hole) -> "%"
98 C.Name n -> "(\\forall " ^ n ^ ":" ^ pp s l ^ "." ^ pp t ((Some b)::l) ^ ")"
99 | C.Anonymous -> "(" ^ pp s l ^ "\\to " ^ pp t ((Some b)::l) ^ ")"
101 | C.Cast (v,t) -> "(" ^ pp v l ^ ":" ^ pp t l ^ ")"
102 | C.Lambda (b,s,t) ->
103 "(\\lambda " ^ ppname b ^ ":" ^ pp s l ^ "." ^ pp t ((Some b)::l) ^ ")"
105 " let " ^ ppname b ^ " \\def " ^ pp s l ^ " in " ^ pp t ((Some b)::l)
109 (fun x i -> pp x l ^ (match i with "" -> "" | _ -> " ") ^ i)
112 | C.Const (uri,exp_named_subst) ->
113 UriManager.name_of_uri uri ^ pp_exp_named_subst exp_named_subst l
114 | C.MutInd (uri,n,exp_named_subst) ->
116 match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
117 C.InductiveDefinition (dl,_,_,_) ->
118 let (name,_,_,_) = get_nth dl (n+1) in
119 name ^ pp_exp_named_subst exp_named_subst l
120 | _ -> raise CicPpInternalError
122 Sys.Break as exn -> raise exn
123 | _ -> UriManager.string_of_uri uri ^ "#1/" ^ string_of_int (n + 1)
125 | C.MutConstruct (uri,n1,n2,exp_named_subst) ->
127 match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
128 C.InductiveDefinition (dl,_,_,_) ->
129 let (_,_,_,cons) = get_nth dl (n1+1) in
130 let (id,_) = get_nth cons n2 in
131 id ^ pp_exp_named_subst exp_named_subst l
132 | _ -> raise CicPpInternalError
134 Sys.Break as exn -> raise exn
136 UriManager.string_of_uri uri ^ "#1/" ^ string_of_int (n1 + 1) ^ "/" ^
139 | C.MutCase (uri,n1,ty,te,patterns) ->
140 let connames_and_argsno =
141 (match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
142 C.InductiveDefinition (dl,_,_,_) ->
143 let (_,_,_,cons) = get_nth dl (n1+1) in
146 (* this is just an approximation since we do not have
148 let rec count_prods =
150 C.Prod (_,_,bo) -> 1 + count_prods bo
155 | _ -> raise CicPpInternalError
158 let connames_and_argsno_and_patterns =
162 | [],l -> List.map (fun x -> "???",0,Some x) l
163 | l,[] -> List.map (fun (x,no) -> x,no,None) l
164 | (x,no)::tlx,y::tly -> (x,no,Some y)::(combine (tlx,tly))
166 combine (connames_and_argsno,patterns)
168 "\nmatch " ^ pp te l ^ " return " ^ pp ty l ^ " with \n [ " ^
169 (String.concat "\n | "
172 let rec aux argsno l =
174 Cic.Lambda (name,ty,bo) when argsno > 0 ->
175 let args,res = aux (argsno - 1) (Some name::l) bo in
176 ("(" ^ (match name with C.Anonymous -> "_" | C.Name s -> s)^
177 ":" ^ pp ty l ^ ")")::args, res
178 | t when argsno = 0 -> [],pp t l
179 | t -> ["{" ^ string_of_int argsno ^ " args missing}"],pp t l
184 | Some y when argsno = 0 -> x,pp y l
186 let args,body = aux argsno l y in
187 "(" ^ x ^ " " ^ String.concat " " args ^ ")",body
189 pattern ^ " => " ^ body
190 ) connames_and_argsno_and_patterns)) ^
192 | C.Fix (no, funs) ->
193 let snames = List.map (fun (name,_,_,_) -> name) funs in
195 List.rev (List.map (function name -> Some (C.Name name)) snames)
197 "\nFix " ^ get_nth snames (no + 1) ^ " {" ^
199 (fun (name,ind,ty,bo) i -> "\n" ^ name ^ " / " ^ string_of_int ind ^
200 " : " ^ pp ty l ^ " := \n" ^
204 | C.CoFix (no,funs) ->
205 let snames = List.map (fun (name,_,_) -> name) funs in
207 List.rev (List.map (function name -> Some (C.Name name)) snames)
209 "\nCoFix " ^ get_nth snames (no + 1) ^ " {" ^
211 (fun (name,ty,bo) i -> "\n" ^ name ^
212 " : " ^ pp ty l ^ " := \n" ^
216 and pp_exp_named_subst exp_named_subst l =
217 if exp_named_subst = [] then "" else
219 String.concat " ; " (
221 (function (uri,t) -> UriManager.name_of_uri uri ^ " \\Assign " ^ pp t l)
230 (* ppinductiveType (typename, inductive, arity, cons) *)
231 (* pretty-prints a single inductive definition *)
232 (* (typename, inductive, arity, cons) *)
233 let ppinductiveType (typename, inductive, arity, cons) =
234 (if inductive then "\nInductive " else "\nCoInductive ") ^ typename ^ ": " ^
235 pp arity [] ^ " =\n " ^
237 (fun (id,ty) i -> id ^ " : " ^ pp ty [] ^
238 (if i = "" then "\n" else "\n | ") ^ i)
242 let ppcontext ?(sep = "\n") context =
243 let separate s = if s = "" then "" else s ^ sep in
245 (fun context_entry (i,name_context) ->
246 match context_entry with
247 Some (n,Cic.Decl t) ->
248 Printf.sprintf "%s%s : %s" (separate i) (ppname n)
249 (pp t name_context), (Some n)::name_context
250 | Some (n,Cic.Def (bo,ty)) ->
251 Printf.sprintf "%s%s : %s := %s" (separate i) (ppname n)
254 | Some ty -> pp ty name_context)
255 (pp bo name_context), (Some n)::name_context
257 Printf.sprintf "%s_ :? _" (separate i), None::name_context
260 (* ppobj obj returns a string with describing the cic object obj in a syntax *)
261 (* similar to the one used by Coq *)
263 let module C = Cic in
264 let module U = UriManager in
266 C.Constant (name, Some t1, t2, params, _) ->
267 "Definition of " ^ name ^
268 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
269 ")" ^ ":\n" ^ pp t1 [] ^ " : " ^ pp t2 []
270 | C.Constant (name, None, ty, params, _) ->
272 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
274 | C.Variable (name, bo, ty, params, _) ->
276 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
279 (match bo with None -> "" | Some bo -> ":= " ^ pp bo [])
280 | C.CurrentProof (name, conjectures, value, ty, params, _) ->
281 "Current Proof of " ^ name ^
282 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
284 let separate s = if s = "" then "" else s ^ " ; " in
286 (fun (n, context, t) i ->
287 let conjectures',name_context =
289 (fun context_entry (i,name_context) ->
290 (match context_entry with
291 Some (n,C.Decl at) ->
293 ppname n ^ ":" ^ pp at name_context ^ " ",
294 (Some n)::name_context
295 | Some (n,C.Def (at,None)) ->
297 ppname n ^ ":= " ^ pp at name_context ^ " ",
298 (Some n)::name_context
300 (separate i) ^ "_ :? _ ", None::name_context
304 conjectures' ^ " |- " ^ "?" ^ (string_of_int n) ^ ": " ^
305 pp t name_context ^ "\n" ^ i
307 "\n" ^ pp value [] ^ " : " ^ pp ty []
308 | C.InductiveDefinition (l, params, nparams, _) ->
310 String.concat ";" (List.map UriManager.string_of_uri params) ^ "\n" ^
311 "NParams = " ^ string_of_int nparams ^ "\n" ^
312 List.fold_right (fun x i -> ppinductiveType x ^ i) l ""
315 let ppsort = function
318 | Cic.Type _ -> "Type"
319 | Cic.CProp -> "CProp"
322 (* MATITA NAMING CONVENTION *)
324 let is_prefix prefix string =
325 let len = String.length prefix in
326 let len1 = String.length string in
329 let head = String.sub string 0 len in
331 (String.compare (String.lowercase head) (String.lowercase prefix)=0) then
333 let diff = len1-len in
334 let tail = String.sub string len diff in
335 if ((diff > 0) && (String.rcontains_from tail 0 '_')) then
336 Some (String.sub tail 1 (diff-1))
343 let remove_prefix prefix (last,string) =
344 if string = "" then (last,string)
346 match is_prefix prefix string with
349 match is_prefix last prefix with
350 None -> (last,string)
352 (match is_prefix prefix (last^string) with
353 None -> (last,string)
354 | Some tail -> (prefix,tail))
356 | Some tail -> (prefix, tail)
358 let legal_suffix string =
359 if string = "" then true else
361 let legal_s = Str.regexp "_?\\([0-9]+\\|r\\|l\\|'\\|\"\\)" in
362 (Str.string_match legal_s string 0) && (Str.matched_string string = string)
365 (** check if a prefix of string_name is legal for term and returns the tail.
366 chec_rec cannot fail: at worst it return string_name.
367 The algorithm is greedy, but last contains the last name matched, providing
369 string_name is here a pair (last,string_name).*)
371 let rec check_rec ctx string_name =
374 (match List.nth ctx (m-1) with
376 remove_prefix name string_name
377 | Cic.Anonymous -> string_name)
378 | Cic.Meta _ -> string_name
379 | Cic.Sort sort -> remove_prefix (ppsort sort) string_name
380 | Cic.Implicit _ -> string_name
381 | Cic.Cast (te,ty) -> check_rec ctx string_name te
382 | Cic.Prod (name,so,dest) ->
383 let l_string_name = check_rec ctx string_name so in
384 check_rec (name::ctx) string_name dest
385 | Cic.Lambda (name,so,dest) ->
388 Cic.Anonymous -> string_name
389 | Cic.Name name -> remove_prefix name string_name in
390 let l_string_name = check_rec ctx string_name so in
391 check_rec (name::ctx) l_string_name dest
392 | Cic.LetIn (name,so,dest) ->
393 let string_name = check_rec ctx string_name so in
394 check_rec (name::ctx) string_name dest
396 List.fold_left (check_rec ctx) string_name l
397 | Cic.Var (uri,exp_named_subst) ->
398 let name = UriManager.name_of_uri uri in
399 remove_prefix name string_name
400 | Cic.Const (uri,exp_named_subst) ->
401 let name = UriManager.name_of_uri uri in
402 remove_prefix name string_name
403 | Cic.MutInd (uri,_,exp_named_subst) ->
404 let name = UriManager.name_of_uri uri in
405 remove_prefix name string_name
406 | Cic.MutConstruct (uri,n,m,exp_named_subst) ->
408 (match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
409 Cic.InductiveDefinition (dl,_,_,_) ->
410 let (_,_,_,cons) = get_nth dl (n+1) in
411 let (id,_) = get_nth cons m in
413 | _ -> assert false) in
414 remove_prefix name string_name
415 | Cic.MutCase (_,_,_,te,pl) ->
416 let string_name = remove_prefix "match" string_name in
417 let string_name = check_rec ctx string_name te in
418 List.fold_right (fun t s -> check_rec ctx s t) pl string_name
420 let string_name = remove_prefix "fix" string_name in
421 let names = List.map (fun (name,_,_,_) -> name) fl in
423 List.rev (List.map (function name -> Cic.Name name) names)
426 (fun (_,_,_,bo) s -> check_rec (onames@ctx) s bo) fl string_name
427 | Cic.CoFix (_,fl) ->
428 let string_name = remove_prefix "cofix" string_name in
429 let names = List.map (fun (name,_,_) -> name) fl in
431 List.rev (List.map (function name -> Cic.Name name) names)
434 (fun (_,_,bo) s -> check_rec (onames@ctx) s bo) fl string_name
436 let check_name ?(allow_suffix=false) ctx name term =
437 let (_,tail) = check_rec ctx ("",name) term in
438 if (not allow_suffix) then (String.length tail = 0)
439 else legal_suffix tail
441 let check_elim ctx conclusion_name =
442 let elim = Str.regexp "_elim\\|_case" in
443 if (Str.string_match elim conclusion_name 0) then
444 let len = String.length conclusion_name in
445 let tail = String.sub conclusion_name 5 (len-5) in
449 let rec check_names ctx hyp_names conclusion_name t =
451 | Cic.Prod (name,s,t) ->
452 (match hyp_names with
453 [] -> check_names (name::ctx) hyp_names conclusion_name t
455 if check_name ctx hd s then
456 check_names (name::ctx) tl conclusion_name t
458 check_names (name::ctx) hyp_names conclusion_name t)
459 | Cic.Appl ((Cic.Rel n)::args) ->
460 (match hyp_names with
462 (check_name ~allow_suffix:true ctx conclusion_name t) ||
463 (check_elim ctx conclusion_name)
465 (* what to elim could be an argument
466 of the predicate: e.g. leb_elim *)
468 List.fold_left (check_rec ctx) ("",what_to_elim) args in
469 (tail = "" && check_elim ctx conclusion_name)
471 | Cic.MutCase (_,_,Cic.Lambda(name,so,ty),te,_) ->
472 (match hyp_names with
474 (match is_prefix "match" conclusion_name with
475 None -> check_name ~allow_suffix:true ctx conclusion_name t
476 | Some tail -> check_name ~allow_suffix:true ctx tail t)
478 (* what to match could be the term te or its type so; in this case the
479 conclusion name should match ty *)
480 check_name ~allow_suffix:true (name::ctx) conclusion_name ty &&
481 (check_name ctx what_to_match te || check_name ctx what_to_match so)
484 hyp_names=[] && check_name ~allow_suffix:true ctx conclusion_name t
486 let check name term =
487 let names = Str.split (Str.regexp_string "_to_") name in
488 let hyp_names,conclusion_name =
489 match List.rev names with
492 let elim = Str.regexp "_elim\\|_case" in
493 let len = String.length hd in
495 let pos = Str.search_backward elim hd len in
496 let hyp = String.sub hd 0 pos in
497 let concl = String.sub hd pos (len-pos) in
498 List.rev (hyp::tl),concl
499 with Not_found -> (List.rev tl),hd in
500 check_names [] hyp_names conclusion_name term