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.Anonimous -> "_"
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 | _ -> raise CicPpInternalError
74 NotEnoughElements -> string_of_int (List.length l - n)
76 | C.Var uri -> UriManager.name_of_uri uri
78 "?" ^ (string_of_int n) ^ "[" ^
80 (List.map (function None -> "_" | Some t -> pp t l) l1) ^
91 C.Name n -> "(" ^ n ^ ":" ^ pp s l ^ ")" ^ pp t ((Some b)::l)
92 | C.Anonimous -> "(" ^ pp s l ^ "->" ^ pp t ((Some b)::l) ^ ")"
94 | C.Cast (v,t) -> pp v l
96 "[" ^ string_of_name b ^ ":" ^ pp s l ^ "]" ^ pp t ((Some b)::l)
98 "[" ^ string_of_name b ^ ":=" ^ pp s l ^ "]" ^ pp t ((Some b)::l)
102 (fun x i -> pp x l ^ (match i with "" -> "" | _ -> " ") ^ i)
105 | C.Const (uri,_) -> UriManager.name_of_uri uri
106 | C.MutInd (uri,_,n) ->
107 (match CicEnvironment.get_obj uri with
108 C.InductiveDefinition (dl,_,_) ->
109 let (name,_,_,_) = get_nth dl (n+1) in
111 | _ -> raise CicPpInternalError
113 | C.MutConstruct (uri,_,n1,n2) ->
114 (match CicEnvironment.get_obj uri with
115 C.InductiveDefinition (dl,_,_) ->
116 let (_,_,_,cons) = get_nth dl (n1+1) in
117 let (id,_,_) = get_nth cons n2 in
119 | _ -> raise CicPpInternalError
121 | C.MutCase (uri,_,n1,ty,te,patterns) ->
123 (match CicEnvironment.get_obj uri with
124 C.InductiveDefinition (dl,_,_) ->
125 let (_,_,_,cons) = get_nth dl (n1+1) in
126 List.map (fun (id,_,_) -> id) cons
127 | _ -> raise CicPpInternalError
130 "\n<" ^ pp ty l ^ ">Cases " ^ pp te l ^ " of " ^
131 List.fold_right (fun (x,y) i -> "\n " ^ x ^ " => " ^ pp y l ^ i)
132 (List.combine connames patterns) "" ^
134 | C.Fix (no, funs) ->
135 let snames = List.map (fun (name,_,_,_) -> name) funs in
137 List.rev (List.map (function name -> Some (C.Name name)) snames)
139 "\nFix " ^ get_nth snames (no + 1) ^ " {" ^
141 (fun (name,ind,ty,bo) i -> "\n" ^ name ^ " / " ^ string_of_int ind ^
142 " : " ^ pp ty l ^ " := \n" ^
146 | C.CoFix (no,funs) ->
147 let snames = List.map (fun (name,_,_) -> name) funs in
149 List.rev (List.map (function name -> Some (C.Name name)) snames)
151 "\nCoFix " ^ get_nth snames (no + 1) ^ " {" ^
153 (fun (name,ty,bo) i -> "\n" ^ name ^
154 " : " ^ pp ty l ^ " := \n" ^
164 (* ppinductiveType (typename, inductive, arity, cons) names *)
165 (* pretty-prints a single inductive definition (typename, inductive, arity, *)
166 (* cons) where the cic terms in the inductive definition need to be *)
167 (* evaluated in the environment names that is the list of typenames of the *)
168 (* mutual inductive definitions defined in the block of mutual inductive *)
169 (* definitions to which this one belongs to *)
170 let ppinductiveType (typename, inductive, arity, cons) names =
171 (if inductive then "\nInductive " else "\nCoInductive ") ^ typename ^ ": " ^
172 (*CSC: bug found: was pp arity names ^ " =\n " ^*)
173 pp arity [] ^ " =\n " ^
175 (fun (id,ty,_) i -> id ^ " : " ^ pp ty names ^
176 (if i = "" then "\n" else "\n | ") ^ i)
180 (* ppobj obj returns a string with describing the cic object obj in a syntax *)
181 (* similar to the one used by Coq *)
183 let module C = Cic in
184 let module U = UriManager in
186 C.Definition (id, t1, t2, params) ->
187 "Definition of " ^ id ^
193 U.string_of_uri x ^ match i with "" -> "" | i' -> " " ^ i'
194 ) x "" ^ match i with "" -> "" | i' -> " " ^ i'
196 ":\n" ^ pp t1 [] ^ " : " ^ pp t2 []
197 | C.Axiom (id, ty, params) ->
198 "Axiom " ^ id ^ "(" ^
203 U.string_of_uri x ^ match i with "" -> "" | i' -> " " ^ i'
204 ) x "" ^ match i with "" -> "" | i' -> " " ^ i'
207 | C.Variable (name, bo, ty) ->
208 "Variable " ^ name ^ ":\n" ^ pp ty [] ^ "\n" ^
209 (match bo with None -> "" | Some bo -> ":= " ^ pp bo [])
210 | C.CurrentProof (name, conjectures, value, ty) ->
212 let separate s = if s = "" then "" else s ^ " ; " in
214 (fun (n, context, t) i ->
215 let conjectures',name_context =
217 (fun context_entry (i,name_context) ->
218 (match context_entry with
219 Some (n,C.Decl at) ->
221 string_of_name n ^ ":" ^ pp at name_context ^ " ",
222 (Some n)::name_context
223 | Some (n,C.Def at) ->
225 string_of_name n ^ ":= " ^ pp at name_context ^ " ",
226 (Some n)::name_context
228 (separate i) ^ "_ :? _ ", None::name_context)
231 conjectures' ^ " |- " ^ "?" ^ (string_of_int n) ^ ": " ^
232 pp t name_context ^ "\n" ^ i
234 "\n" ^ pp value [] ^ " : " ^ pp ty []
235 | C.InductiveDefinition (l, params, nparams) ->
241 U.string_of_uri x ^ match i with "" -> "" | i' -> " " ^ i'
242 ) x "" ^ match i with "" -> "" | i' -> " " ^ i'
244 "NParams = " ^ string_of_int nparams ^ "\n" ^
245 let names = List.rev (List.map (fun (n,_,_,_) -> Some (C.Name n)) l) in
246 List.fold_right (fun x i -> ppinductiveType x names ^ i) l ""