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 -> "(" ^ n ^ ":" ^ pp s l ^ ")" ^ pp t ((Some b)::l)
99 | C.Anonymous -> "(" ^ pp s l ^ "->" ^ 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 "[" ^ ppname b ^ ":=" ^ pp s l ^ "]" ^ 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 _ -> UriManager.string_of_uri uri ^ "#1/" ^ string_of_int (n + 1)
124 | C.MutConstruct (uri,n1,n2,exp_named_subst) ->
126 match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
127 C.InductiveDefinition (dl,_,_,_) ->
128 let (_,_,_,cons) = get_nth dl (n1+1) in
129 let (id,_) = get_nth cons n2 in
130 id ^ pp_exp_named_subst exp_named_subst l
131 | _ -> raise CicPpInternalError
134 UriManager.string_of_uri uri ^ "#1/" ^ string_of_int (n1 + 1) ^ "/" ^
137 | C.MutCase (uri,n1,ty,te,patterns) ->
139 (match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
140 C.InductiveDefinition (dl,_,_,_) ->
141 let (_,_,_,cons) = get_nth dl (n1+1) in
142 List.map (fun (id,_) -> id) cons
143 | _ -> raise CicPpInternalError
146 let connames_and_patterns =
150 | [],l -> List.map (fun x -> "???",Some x) l
151 | l,[] -> List.map (fun x -> x,None) l
152 | x::tlx,y::tly -> (x,Some y)::(combine (tlx,tly))
154 combine (connames,patterns)
156 "\n<" ^ pp ty l ^ ">Cases " ^ pp te l ^ " of " ^
158 (fun (x,y) i -> "\n " ^ x ^ " => " ^
159 (match y with None -> "" | Some y -> pp y l) ^ i)
160 connames_and_patterns "" ^
162 | C.Fix (no, funs) ->
163 let snames = List.map (fun (name,_,_,_) -> name) funs in
165 List.rev (List.map (function name -> Some (C.Name name)) snames)
167 "\nFix " ^ get_nth snames (no + 1) ^ " {" ^
169 (fun (name,ind,ty,bo) i -> "\n" ^ name ^ " / " ^ string_of_int ind ^
170 " : " ^ pp ty l ^ " := \n" ^
174 | C.CoFix (no,funs) ->
175 let snames = List.map (fun (name,_,_) -> name) funs in
177 List.rev (List.map (function name -> Some (C.Name name)) snames)
179 "\nCoFix " ^ get_nth snames (no + 1) ^ " {" ^
181 (fun (name,ty,bo) i -> "\n" ^ name ^
182 " : " ^ pp ty l ^ " := \n" ^
186 and pp_exp_named_subst exp_named_subst l =
187 if exp_named_subst = [] then "" else
189 String.concat " ; " (
191 (function (uri,t) -> UriManager.name_of_uri uri ^ " \\Assign " ^ pp t l)
200 (* ppinductiveType (typename, inductive, arity, cons) *)
201 (* pretty-prints a single inductive definition *)
202 (* (typename, inductive, arity, cons) *)
203 let ppinductiveType (typename, inductive, arity, cons) =
204 (if inductive then "\nInductive " else "\nCoInductive ") ^ typename ^ ": " ^
205 pp arity [] ^ " =\n " ^
207 (fun (id,ty) i -> id ^ " : " ^ pp ty [] ^
208 (if i = "" then "\n" else "\n | ") ^ i)
212 let ppcontext ?(sep = "\n") context =
213 let separate s = if s = "" then "" else s ^ sep in
215 (fun context_entry (i,name_context) ->
216 match context_entry with
217 Some (n,Cic.Decl t) ->
218 Printf.sprintf "%s%s : %s" (separate i) (ppname n)
219 (pp t name_context), (Some n)::name_context
220 | Some (n,Cic.Def (bo,ty)) ->
221 Printf.sprintf "%s%s : %s := %s" (separate i) (ppname n)
224 | Some ty -> pp ty name_context)
225 (pp bo name_context), (Some n)::name_context
227 Printf.sprintf "%s_ :? _" (separate i), None::name_context
230 (* ppobj obj returns a string with describing the cic object obj in a syntax *)
231 (* similar to the one used by Coq *)
233 let module C = Cic in
234 let module U = UriManager in
236 C.Constant (name, Some t1, t2, params, _) ->
237 "Definition of " ^ name ^
238 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
239 ")" ^ ":\n" ^ pp t1 [] ^ " : " ^ pp t2 []
240 | C.Constant (name, None, ty, params, _) ->
242 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
244 | C.Variable (name, bo, ty, params, _) ->
246 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
249 (match bo with None -> "" | Some bo -> ":= " ^ pp bo [])
250 | C.CurrentProof (name, conjectures, value, ty, params, _) ->
251 "Current Proof of " ^ name ^
252 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
254 let separate s = if s = "" then "" else s ^ " ; " in
256 (fun (n, context, t) i ->
257 let conjectures',name_context =
259 (fun context_entry (i,name_context) ->
260 (match context_entry with
261 Some (n,C.Decl at) ->
263 ppname n ^ ":" ^ pp at name_context ^ " ",
264 (Some n)::name_context
265 | Some (n,C.Def (at,None)) ->
267 ppname n ^ ":= " ^ pp at name_context ^ " ",
268 (Some n)::name_context
270 (separate i) ^ "_ :? _ ", None::name_context
274 conjectures' ^ " |- " ^ "?" ^ (string_of_int n) ^ ": " ^
275 pp t name_context ^ "\n" ^ i
277 "\n" ^ pp value [] ^ " : " ^ pp ty []
278 | C.InductiveDefinition (l, params, nparams, _) ->
280 String.concat ";" (List.map UriManager.string_of_uri params) ^ "\n" ^
281 "NParams = " ^ string_of_int nparams ^ "\n" ^
282 List.fold_right (fun x i -> ppinductiveType x ^ i) l ""
285 let ppsort = function
288 | Cic.Type _ -> "Type"
289 | Cic.CProp -> "CProp"
292 (* MATITA NAMING CONVENTION *)
294 let is_prefix prefix string =
295 let len = String.length prefix in
296 let len1 = String.length string in
299 let head = String.sub string 0 len in
301 (String.compare (String.lowercase head) (String.lowercase prefix)=0) then
303 let diff = len1-len in
304 let tail = String.sub string len diff in
305 if ((diff > 0) && (String.rcontains_from tail 0 '_')) then
306 Some (String.sub tail 1 (diff-1))
313 let remove_prefix prefix (last,string) =
314 if prefix="append" then
317 prerr_endline string;
319 if string = "" then (last,string)
321 match is_prefix prefix string with
324 match is_prefix last prefix with
325 None -> (last,string)
327 (match is_prefix prefix (last^string) with
328 None -> (last,string)
329 | Some tail -> (prefix,tail))
331 | Some tail -> (prefix, tail)
333 let legal_suffix string =
334 if string = "" then true else
336 let legal_s = Str.regexp "_?\\([0-9]+\\|r\\|l\\|'\\|\"\\)" in
337 (Str.string_match legal_s string 0) && (Str.matched_string string = string)
340 (** check if a prefix of string_name is legal for term and returns the tail.
341 chec_rec cannot fail: at worst it return string_name.
342 The algorithm is greedy, but last contains the last name matched, providing
344 string_name is here a pair (last,string_name).*)
346 let rec check_rec ctx string_name =
349 (match List.nth ctx (m-1) with
351 remove_prefix name string_name
352 | Cic.Anonymous -> string_name)
353 | Cic.Meta _ -> string_name
354 | Cic.Sort sort -> remove_prefix (ppsort sort) string_name
355 | Cic.Implicit _ -> string_name
356 | Cic.Cast (te,ty) -> check_rec ctx string_name te
357 | Cic.Prod (name,so,dest) ->
358 let l_string_name = check_rec ctx string_name so in
359 check_rec (name::ctx) string_name dest
360 | Cic.Lambda (name,so,dest) ->
363 Cic.Anonymous -> string_name
364 | Cic.Name name -> remove_prefix name string_name in
365 let l_string_name = check_rec ctx string_name so in
366 check_rec (name::ctx) l_string_name dest
367 | Cic.LetIn (name,so,dest) ->
368 let string_name = check_rec ctx string_name so in
369 check_rec (name::ctx) string_name dest
371 List.fold_left (check_rec ctx) string_name l
372 | Cic.Var (uri,exp_named_subst) ->
373 let name = UriManager.name_of_uri uri in
374 remove_prefix name string_name
375 | Cic.Const (uri,exp_named_subst) ->
376 let name = UriManager.name_of_uri uri in
377 remove_prefix name string_name
378 | Cic.MutInd (uri,_,exp_named_subst) ->
379 let name = UriManager.name_of_uri uri in
380 remove_prefix name string_name
381 | Cic.MutConstruct (uri,n,m,exp_named_subst) ->
383 (match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
384 Cic.InductiveDefinition (dl,_,_,_) ->
385 let (_,_,_,cons) = get_nth dl (n+1) in
386 let (id,_) = get_nth cons m in
388 | _ -> assert false) in
389 remove_prefix name string_name
390 | Cic.MutCase (_,_,_,te,pl) ->
391 let strig_name = remove_prefix "match" string_name in
392 let string_name = check_rec ctx string_name te in
393 List.fold_right (fun t s -> check_rec ctx s t) pl string_name
395 let strig_name = remove_prefix "fix" string_name in
396 let names = List.map (fun (name,_,_,_) -> name) fl in
398 List.rev (List.map (function name -> Cic.Name name) names)
401 (fun (_,_,_,bo) s -> check_rec (onames@ctx) s bo) fl string_name
402 | Cic.CoFix (_,fl) ->
403 let strig_name = remove_prefix "cofix" string_name in
404 let names = List.map (fun (name,_,_) -> name) fl in
406 List.rev (List.map (function name -> Cic.Name name) names)
409 (fun (_,_,bo) s -> check_rec (onames@ctx) s bo) fl string_name
411 let check_name ?(allow_suffix=false) ctx name term =
412 let (_,tail) = check_rec ctx ("",name) term in
413 if (not allow_suffix) then (String.length tail = 0)
414 else legal_suffix tail
416 let check_elim ctx conclusion_name =
417 let elim = Str.regexp "_elim\\|_case" in
418 if (Str.string_match elim conclusion_name 0) then
419 let len = String.length conclusion_name in
420 let tail = String.sub conclusion_name 5 (len-5) in
424 let rec check_names ctx hyp_names conclusion_name t =
426 | Cic.Prod (name,s,t) ->
427 (match hyp_names with
428 [] -> check_names (name::ctx) hyp_names conclusion_name t
430 if check_name ctx hd s then
431 check_names (name::ctx) tl conclusion_name t
433 check_names (name::ctx) hyp_names conclusion_name t)
434 | Cic.Appl ((Cic.Rel n)::args) ->
435 (match hyp_names with
437 (check_name ~allow_suffix:true ctx conclusion_name t) ||
438 (check_elim ctx conclusion_name)
440 (* what to elim could be an argument
441 of the predicate: e.g. leb_elim *)
443 List.fold_left (check_rec ctx) ("",what_to_elim) args in
444 (tail = "" && check_elim ctx conclusion_name)
446 | Cic.MutCase (_,_,Cic.Lambda(name,so,ty),te,_) ->
447 (match hyp_names with
449 (match is_prefix "match" conclusion_name with
450 None -> check_name ~allow_suffix:true ctx conclusion_name t
451 | Some tail -> check_name ~allow_suffix:true ctx tail t)
453 (* what to match could be the term te or its type so; in this case the
454 conclusion name should match ty *)
455 check_name ~allow_suffix:true (name::ctx) conclusion_name ty &&
456 (check_name ctx what_to_match te || check_name ctx what_to_match so)
459 hyp_names=[] && check_name ~allow_suffix:true ctx conclusion_name t
461 let check name term =
462 (* prerr_endline name;
463 prerr_endline (ppterm term); *)
464 let names = Str.split (Str.regexp_string "_to_") name in
465 let hyp_names,conclusion_name =
466 match List.rev names with
469 let elim = Str.regexp "_elim\\|_case" in
470 let len = String.length hd in
472 let pos = Str.search_backward elim hd len in
473 let hyp = String.sub hd 0 pos in
474 let concl = String.sub hd pos (len-pos) in
475 List.rev (hyp::tl),concl
476 with Not_found -> (List.rev tl),hd in
477 check_names [] hyp_names conclusion_name term