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 exception NotImplemented;;
29 {annsynthesized : Cic.annterm ; annexpected : Cic.annterm option}
32 let fresh_id seed ids_to_terms ids_to_father_ids =
34 let res = "i" ^ string_of_int !seed in
36 Hashtbl.add ids_to_father_ids res father ;
37 Hashtbl.add ids_to_terms res t ;
41 exception NotEnoughElements;;
42 exception NameExpected;;
44 (*CSC: cut&paste da cicPp.ml *)
45 (* get_nth l n returns the nth element of the list l if it exists or *)
46 (* raises NotEnoughElements if l has less than n elements *)
50 | (n, he::tail) when n > 1 -> get_nth tail (n-1)
51 | (_,_) -> raise NotEnoughElements
54 let acic_of_cic_context' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
55 ids_to_inner_types metasenv context t expectedty
57 let module D = DoubleTypeInference in
58 let module T = CicTypeChecker in
60 let fresh_id' = fresh_id seed ids_to_terms ids_to_father_ids in
62 D.double_type_of metasenv context t expectedty
64 let rec aux computeinnertypes father context tt =
65 let fresh_id'' = fresh_id' father tt in
66 (*CSC: computeinnertypes era true, il che e' proprio sbagliato, no? *)
67 let aux' = aux computeinnertypes (Some fresh_id'') in
68 (* First of all we compute the inner type and the inner sort *)
69 (* of the term. They may be useful in what follows. *)
70 (*CSC: This is a very inefficient way of computing inner types *)
71 (*CSC: and inner sorts: very deep terms have their types/sorts *)
72 (*CSC: computed again and again. *)
75 C.Sort C.Prop -> "Prop"
76 | C.Sort C.Set -> "Set"
77 | C.Sort C.Type -> "Type"
80 let ainnertypes,innertype,innersort,expected_available =
81 (*CSC: Here we need the algorithm for Coscoy's double type-inference *)
82 (*CSC: (expected type + inferred type). Just for now we use the usual *)
83 (*CSC: type-inference, but the result is very poor. As a very weak *)
84 (*CSC: patch, I apply whd to the computed type. Full beta *)
85 (*CSC: reduction would be a much better option. *)
86 let {D.synthesized = synthesized; D.expected = expected} =
87 if computeinnertypes then
88 D.CicHash.find terms_to_types tt
90 (* We are already in an inner-type and Coscoy's double *)
91 (* type inference algorithm has not been applied. *)
93 CicReduction.whd context (T.type_of_aux' metasenv context tt) ;
96 let innersort = T.type_of_aux' metasenv context synthesized in
97 let ainnertypes,expected_available =
98 if computeinnertypes then
99 let annexpected,expected_available =
102 | Some expectedty' ->
103 Some (aux false (Some fresh_id'') context expectedty'),true
107 aux false (Some fresh_id'') context synthesized ;
108 annexpected = annexpected
109 }, expected_available
113 ainnertypes,synthesized, string_of_sort innersort, expected_available
115 let add_inner_type id =
116 match ainnertypes with
118 | Some ainnertypes -> Hashtbl.add ids_to_inner_types id ainnertypes
123 match get_nth context n with
124 (Some (C.Name s,_)) -> s
125 | _ -> raise NameExpected
127 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
128 C.ARel (fresh_id'', n, id)
130 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
131 C.AVar (fresh_id'', uri)
133 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
134 C.AMeta (fresh_id'', n,
136 (function None -> None | Some t -> Some (aux' context t)) l))
137 | C.Sort s -> C.ASort (fresh_id'', s)
138 | C.Implicit -> C.AImplicit (fresh_id'')
140 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
141 if innersort = "Prop" then
142 add_inner_type fresh_id'' ;
143 C.ACast (fresh_id'', aux' context v, aux' context t)
145 Hashtbl.add ids_to_inner_sorts fresh_id''
146 (string_of_sort innertype) ;
148 (fresh_id'', n, aux' context s,
149 aux' ((Some (n, C.Decl s))::context) t)
150 | C.Lambda (n,s,t) ->
151 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
152 if innersort = "Prop" then
154 let father_is_lambda =
158 match Hashtbl.find ids_to_terms father' with
162 if (not father_is_lambda) || expected_available then
163 add_inner_type fresh_id''
166 (fresh_id'',n, aux' context s,
167 aux' ((Some (n, C.Decl s)::context)) t)
169 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
171 (fresh_id'', n, aux' context s,
172 aux' ((Some (n, C.Def s))::context) t)
174 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
175 if innersort = "Prop" then
176 add_inner_type fresh_id'' ;
177 C.AAppl (fresh_id'', List.map (aux' context) l)
178 | C.Const (uri,cn) ->
179 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
180 C.AConst (fresh_id'', uri, cn)
181 | C.MutInd (uri,cn,tyno) -> C.AMutInd (fresh_id'', uri, cn, tyno)
182 | C.MutConstruct (uri,cn,tyno,consno) ->
183 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
184 C.AMutConstruct (fresh_id'', uri, cn, tyno, consno)
185 | C.MutCase (uri, cn, tyno, outty, term, patterns) ->
186 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
187 if innersort = "Prop" then
188 add_inner_type fresh_id'' ;
189 C.AMutCase (fresh_id'', uri, cn, tyno, aux' context outty,
190 aux' context term, List.map (aux' context) patterns)
191 | C.Fix (funno, funs) ->
193 List.map (fun (name,_,ty,_) -> Some (C.Name name, C.Decl ty)) funs
195 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
196 if innersort = "Prop" then
197 add_inner_type fresh_id'' ;
198 C.AFix (fresh_id'', funno,
200 (fun (name, indidx, ty, bo) ->
201 (name, indidx, aux' context ty, aux' (tys@context) bo)
204 | C.CoFix (funno, funs) ->
206 List.map (fun (name,ty,_) -> Some (C.Name name, C.Decl ty)) funs
208 Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
209 if innersort = "Prop" then
210 add_inner_type fresh_id'' ;
211 C.ACoFix (fresh_id'', funno,
213 (fun (name, ty, bo) ->
214 (name, aux' context ty, aux' (tys@context) bo)
218 aux true None context t
221 let acic_of_cic_context metasenv context t =
222 let ids_to_terms = Hashtbl.create 503 in
223 let ids_to_father_ids = Hashtbl.create 503 in
224 let ids_to_inner_sorts = Hashtbl.create 503 in
225 let ids_to_inner_types = Hashtbl.create 503 in
227 acic_of_cic_context' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
228 ids_to_inner_types metasenv context t,
229 ids_to_terms, ids_to_father_ids, ids_to_inner_sorts, ids_to_inner_types
232 let acic_object_of_cic_object obj =
233 let module C = Cic in
234 let ids_to_terms = Hashtbl.create 503 in
235 let ids_to_father_ids = Hashtbl.create 503 in
236 let ids_to_inner_sorts = Hashtbl.create 503 in
237 let ids_to_inner_types = Hashtbl.create 503 in
238 let ids_to_conjectures = Hashtbl.create 11 in
239 let ids_to_hypotheses = Hashtbl.create 127 in
240 let hypotheses_seed = ref 0 in
241 let conjectures_seed = ref 0 in
243 let acic_term_of_cic_term_context' =
244 acic_of_cic_context' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
245 ids_to_inner_types in
246 let acic_term_of_cic_term' = acic_term_of_cic_term_context' [] [] in
249 C.Definition (id,bo,ty,params) ->
250 let abo = acic_term_of_cic_term' bo (Some ty) in
251 let aty = acic_term_of_cic_term' ty None in
252 C.ADefinition ("mettereaposto",id,abo,aty,(Cic.Actual params))
253 | C.Axiom (id,ty,params) -> raise NotImplemented
254 | C.Variable (id,bo,ty) -> raise NotImplemented
255 | C.CurrentProof (id,conjectures,bo,ty) ->
258 (function (i,canonical_context,term) as conjecture ->
259 let cid = "c" ^ string_of_int !conjectures_seed in
260 Hashtbl.add ids_to_conjectures cid conjecture ;
261 incr conjectures_seed ;
262 let acanonical_context =
267 let hid = "h" ^ string_of_int !hypotheses_seed in
268 Hashtbl.add ids_to_hypotheses hid hyp ;
269 incr hypotheses_seed ;
271 (Some (n,C.Decl t)) ->
273 acic_term_of_cic_term_context' conjectures tl t None
275 (hid,Some (n,C.ADecl at))::(aux tl)
276 | (Some (n,C.Def t)) ->
278 acic_term_of_cic_term_context' conjectures tl t None
280 (hid,Some (n,C.ADef at))::(aux tl)
281 | None -> (hid,None)::(aux tl)
283 aux canonical_context
286 acic_term_of_cic_term_context' conjectures canonical_context
289 (cid,i,acanonical_context,aterm)
291 let abo = acic_term_of_cic_term_context' conjectures [] bo (Some ty) in
292 let aty = acic_term_of_cic_term_context' conjectures [] ty None in
293 C.ACurrentProof ("mettereaposto",id,aconjectures,abo,aty)
294 | C.InductiveDefinition (tys,params,paramsno) -> raise NotImplemented
296 aobj,ids_to_terms,ids_to_father_ids,ids_to_inner_sorts,ids_to_inner_types,
297 ids_to_conjectures,ids_to_hypotheses