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 (* Claudio Sacerdoti Coen <sacerdot@cs.unibo.it> *)
33 (* This module implements a very simple Coq-like pretty printer that, given *)
34 (* an object of cic (internal representation) returns a string describing the *)
35 (* object in a syntax similar to that of coq *)
37 (******************************************************************************)
39 exception CicPpInternalError;;
40 exception NotEnoughElements;;
42 (* Utility functions *)
47 | Cic.Anonymous -> "_"
50 (* get_nth l n returns the nth element of the list l if it exists or *)
51 (* raises NotEnoughElements if l has less than n elements *)
55 | (n, he::tail) when n > 1 -> get_nth tail (n-1)
56 | (_,_) -> raise NotEnoughElements
60 (* pretty-prints a term t of cic in an environment l where l is a list of *)
61 (* identifier names used to resolve DeBrujin indexes. The head of l is the *)
62 (* name associated to the greatest DeBrujin index in t *)
69 (match get_nth l n with
71 | Some C.Anonymous -> "__" ^ string_of_int n
72 | None -> "_hidden_" ^ string_of_int n
75 NotEnoughElements -> string_of_int (List.length l - n)
77 | C.Var (uri,exp_named_subst) ->
78 UriManager.string_of_uri (*UriManager.name_of_uri*) uri ^ pp_exp_named_subst exp_named_subst l
80 "?" ^ (string_of_int n) ^ "[" ^
82 (List.rev_map (function None -> "_" | Some t -> pp t l) l1) ^
89 (*| C.Type u -> ("Type" ^ CicUniv.string_of_universe u)*)
92 | C.Implicit (Some `Hole) -> "%"
96 C.Name n -> "(" ^ n ^ ":" ^ pp s l ^ ")" ^ pp t ((Some b)::l)
97 | C.Anonymous -> "(" ^ pp s l ^ "->" ^ pp t ((Some b)::l) ^ ")"
99 | C.Cast (v,t) -> "(" ^ pp v l ^ ":" ^ pp t l ^ ")"
100 | C.Lambda (b,s,t) ->
101 "[" ^ ppname b ^ ":" ^ pp s l ^ "]" ^ pp t ((Some b)::l)
103 "[" ^ ppname b ^ ":=" ^ pp s l ^ "]" ^ pp t ((Some b)::l)
107 (fun x i -> pp x l ^ (match i with "" -> "" | _ -> " ") ^ i)
110 | C.Const (uri,exp_named_subst) ->
111 UriManager.name_of_uri uri ^ pp_exp_named_subst exp_named_subst l
112 | C.MutInd (uri,n,exp_named_subst) ->
114 match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
115 C.InductiveDefinition (dl,_,_,_) ->
116 let (name,_,_,_) = get_nth dl (n+1) in
117 name ^ pp_exp_named_subst exp_named_subst l
118 | _ -> raise CicPpInternalError
120 _ -> UriManager.string_of_uri uri ^ "#1/" ^ string_of_int (n + 1)
122 | C.MutConstruct (uri,n1,n2,exp_named_subst) ->
124 match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
125 C.InductiveDefinition (dl,_,_,_) ->
126 let (_,_,_,cons) = get_nth dl (n1+1) in
127 let (id,_) = get_nth cons n2 in
128 id ^ pp_exp_named_subst exp_named_subst l
129 | _ -> raise CicPpInternalError
132 UriManager.string_of_uri uri ^ "#1/" ^ string_of_int (n1 + 1) ^ "/" ^
135 | C.MutCase (uri,n1,ty,te,patterns) ->
137 (match fst(CicEnvironment.get_obj CicUniv.empty_ugraph uri) with
138 C.InductiveDefinition (dl,_,_,_) ->
139 let (_,_,_,cons) = get_nth dl (n1+1) in
140 List.map (fun (id,_) -> id) cons
141 | _ -> raise CicPpInternalError
144 "\n<" ^ pp ty l ^ ">Cases " ^ pp te l ^ " of " ^
145 List.fold_right (fun (x,y) i -> "\n " ^ x ^ " => " ^ pp y l ^ i)
146 (List.combine connames patterns) "" ^
148 | C.Fix (no, funs) ->
149 let snames = List.map (fun (name,_,_,_) -> name) funs in
151 List.rev (List.map (function name -> Some (C.Name name)) snames)
153 "\nFix " ^ get_nth snames (no + 1) ^ " {" ^
155 (fun (name,ind,ty,bo) i -> "\n" ^ name ^ " / " ^ string_of_int ind ^
156 " : " ^ pp ty l ^ " := \n" ^
160 | C.CoFix (no,funs) ->
161 let snames = List.map (fun (name,_,_) -> name) funs in
163 List.rev (List.map (function name -> Some (C.Name name)) snames)
165 "\nCoFix " ^ get_nth snames (no + 1) ^ " {" ^
167 (fun (name,ty,bo) i -> "\n" ^ name ^
168 " : " ^ pp ty l ^ " := \n" ^
172 and pp_exp_named_subst exp_named_subst l =
173 if exp_named_subst = [] then "" else
175 String.concat " ; " (
177 (function (uri,t) -> UriManager.name_of_uri uri ^ ":=" ^ pp t l)
186 (* ppinductiveType (typename, inductive, arity, cons) *)
187 (* pretty-prints a single inductive definition *)
188 (* (typename, inductive, arity, cons) *)
189 let ppinductiveType (typename, inductive, arity, cons) =
190 (if inductive then "\nInductive " else "\nCoInductive ") ^ typename ^ ": " ^
191 pp arity [] ^ " =\n " ^
193 (fun (id,ty) i -> id ^ " : " ^ pp ty [] ^
194 (if i = "" then "\n" else "\n | ") ^ i)
198 let ppcontext ?(sep = "\n") context =
199 let separate s = if s = "" then "" else s ^ sep in
201 (fun context_entry (i,name_context) ->
202 match context_entry with
203 Some (n,Cic.Decl t) ->
204 Printf.sprintf "%s%s : %s" (separate i) (ppname n)
205 (pp t name_context), (Some n)::name_context
206 | Some (n,Cic.Def (bo,ty)) ->
207 Printf.sprintf "%s%s : %s := %s" (separate i) (ppname n)
210 | Some ty -> pp ty name_context)
211 (pp bo name_context), (Some n)::name_context
213 Printf.sprintf "%s_ :? _" (separate i), None::name_context
216 (* ppobj obj returns a string with describing the cic object obj in a syntax *)
217 (* similar to the one used by Coq *)
219 let module C = Cic in
220 let module U = UriManager in
222 C.Constant (name, Some t1, t2, params, _) ->
223 "Definition of " ^ name ^
224 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
225 ")" ^ ":\n" ^ pp t1 [] ^ " : " ^ pp t2 []
226 | C.Constant (name, None, ty, params, _) ->
228 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
230 | C.Variable (name, bo, ty, params, _) ->
232 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
235 (match bo with None -> "" | Some bo -> ":= " ^ pp bo [])
236 | C.CurrentProof (name, conjectures, value, ty, params, _) ->
237 "Current Proof of " ^ name ^
238 "(" ^ String.concat ";" (List.map UriManager.string_of_uri params) ^
240 let separate s = if s = "" then "" else s ^ " ; " in
242 (fun (n, context, t) i ->
243 let conjectures',name_context =
245 (fun context_entry (i,name_context) ->
246 (match context_entry with
247 Some (n,C.Decl at) ->
249 ppname n ^ ":" ^ pp at name_context ^ " ",
250 (Some n)::name_context
251 | Some (n,C.Def (at,None)) ->
253 ppname n ^ ":= " ^ pp at name_context ^ " ",
254 (Some n)::name_context
256 (separate i) ^ "_ :? _ ", None::name_context
260 conjectures' ^ " |- " ^ "?" ^ (string_of_int n) ^ ": " ^
261 pp t name_context ^ "\n" ^ i
263 "\n" ^ pp value [] ^ " : " ^ pp ty []
264 | C.InductiveDefinition (l, params, nparams, _) ->
266 String.concat ";" (List.map UriManager.string_of_uri params) ^ "\n" ^
267 "NParams = " ^ string_of_int nparams ^ "\n" ^
268 List.fold_right (fun x i -> ppinductiveType x ^ i) l ""
271 let ppsort = function
274 | Cic.Type _ -> "Type"
275 | Cic.CProp -> "CProp"