1 (* Copyright (C) 2004, 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://helm.cs.unibo.it/
28 open DisambiguateTypes
31 exception No_choices of domain_item
32 exception NoWellTypedInterpretation
34 (** raised when an environment is not enough informative to decide *)
38 let debug_print = if debug then prerr_endline else ignore
40 let descr_of_domain_item = function
43 | Num i -> string_of_int i
46 | Ok of Cic.term * Cic.metasenv
50 let refine metasenv context term =
51 let metasenv, term = CicMkImplicit.expand_implicits metasenv context term in
52 debug_print (sprintf "TEST_INTERPRETATION: %s" (CicPp.ppterm term));
54 let term', _, metasenv' = CicRefine.type_of_aux' metasenv context term in
57 | CicRefine.Uncertain _ ->
58 debug_print ("%%% UNCERTAIN!!! " ^ CicPp.ppterm term) ;
60 | CicRefine.RefineFailure _ ->
61 debug_print ("%%% PRUNED!!! " ^ CicPp.ppterm term) ;
64 let resolve (env: environment) (item: domain_item) ?(num = "") ?(args = []) () =
66 snd (Environment.find item env) env num args
67 with Not_found -> assert false
69 (* TODO move it to Cic *)
70 let find_in_environment name context =
71 let rec aux acc = function
72 | [] -> raise Not_found
73 | Cic.Name hd :: tl when hd = name -> acc
74 | _ :: tl -> aux (acc + 1) tl
78 let interpretate ~context ~env ast =
79 let rec aux loc context = function
80 | CicAst.AttributedTerm (`Loc loc, term) ->
82 | CicAst.AttributedTerm (_, term) -> aux loc context term
83 | CicAst.Appl (CicAst.Symbol (symb, i) :: args) ->
84 let cic_args = List.map (aux loc context) args in
85 resolve env (Symbol (symb, i)) ~args:cic_args ()
86 | CicAst.Appl terms -> Cic.Appl (List.map (aux loc context) terms)
87 | CicAst.Binder (binder_kind, (var, typ), body) ->
88 let cic_type = aux_option loc context typ in
89 let cic_body = aux loc (var :: context) body in
90 (match binder_kind with
91 | `Lambda -> Cic.Lambda (var, cic_type, cic_body)
92 | `Pi | `Forall -> Cic.Prod (var, cic_type, cic_body)
94 resolve env (Symbol ("exists", 0))
95 ~args:[ cic_type; Cic.Lambda (var, cic_type, cic_body) ] ())
96 | CicAst.Case (term, indty_ident, outtype, branches) ->
97 let cic_term = aux loc context term in
98 let cic_outtype = aux_option loc context outtype in
99 let do_branch ((head, args), term) =
100 let rec do_branch' context = function
101 | [] -> aux loc context term
102 | (name, typ) :: tl ->
103 let cic_body = do_branch' (name :: context) tl in
106 | None -> Cic.Implicit (Some `Type)
107 | Some typ -> aux loc context typ
109 Cic.Lambda (name, typ, cic_body)
111 do_branch' context args
113 let (indtype_uri, indtype_no) =
114 match indty_ident with
115 | Some indty_ident ->
116 (match resolve env (Id indty_ident) () with
117 | Cic.MutInd (uri, tyno, _) -> (uri, tyno)
118 | Cic.Implicit _ -> raise Try_again
119 | _ -> raise DisambiguateChoices.Invalid_choice)
121 let fst_constructor =
123 | ((head, _), _) :: _ -> head
124 | [] -> raise DisambiguateChoices.Invalid_choice
126 (match resolve env (Id fst_constructor) () with
127 | Cic.MutConstruct (indtype_uri, indtype_no, _, _) ->
128 (indtype_uri, indtype_no)
129 | Cic.Implicit _ -> raise Try_again
130 | _ -> raise DisambiguateChoices.Invalid_choice)
132 Cic.MutCase (indtype_uri, indtype_no, cic_outtype, cic_term,
133 (List.map do_branch branches))
134 | CicAst.LetIn ((name, typ), def, body) ->
135 let cic_def = aux loc context def in
139 | Some t -> Cic.Cast (cic_def, aux loc context t)
141 let cic_body = aux loc (name :: context) body in
142 Cic.LetIn (name, cic_def, cic_body)
143 | CicAst.LetRec (kind, defs, body) ->
145 List.fold_left (fun acc ((name, _), _, _) -> name :: acc)
148 let cic_body = aux loc context' body in
151 (fun ((name, typ), body, decr_idx) ->
152 let cic_body = aux loc context' body in
153 let cic_type = aux_option loc context typ in
157 CicTextualParser2.fail loc
158 "Recursive functions cannot be anonymous"
159 | Cic.Name name -> name
161 (name, decr_idx, cic_type, cic_body))
164 let counter = ref ~-1 in
165 let build_term funs =
166 (* this is the body of the fold_right function below. Rationale: Fix
167 * and CoFix cases differs only in an additional index in the
168 * inductiveFun list, see Cic.term *)
171 (fun (var, _, _, _) cic ->
173 Cic.LetIn (Cic.Name var, Cic.Fix (!counter, funs), cic))
176 List.map (fun (name, _, typ, body) -> (name, typ, body)) funs
178 (fun (var, _, _, _) cic ->
180 Cic.LetIn (Cic.Name var, Cic.CoFix (!counter, funs), cic))
182 List.fold_right (build_term inductiveFuns) inductiveFuns cic_body
183 | CicAst.Ident (name, subst) ->
185 let index = find_in_environment name context in
186 if subst <> None then
187 CicTextualParser2.fail loc
188 "Explicit substitutions not allowed here";
191 let cic = resolve env (Id name) () in
194 List.map (fun uri -> UriManager.name_of_uri uri, uri) uris
201 List.assoc s ids_to_uris, aux loc context term
203 raise DisambiguateChoices.Invalid_choice))
205 | None -> List.map (fun uri -> uri, Cic.Implicit None) uris)
209 | Cic.Const (uri, []) ->
211 (*match CicEnvironment.get_obj uri with*)
212 match CicTypeChecker.typecheck uri with
213 | Cic.Constant (_, _, _, uris) -> uris
216 Cic.Const (uri, mk_subst uris)
217 | Cic.Var (uri, []) ->
219 (*match CicEnvironment.get_obj uri with*)
220 match CicTypeChecker.typecheck uri with
221 | Cic.Variable (_, _, _, uris) -> uris
224 Cic.Var (uri, mk_subst uris)
225 | Cic.MutInd (uri, i, []) ->
227 (*match CicEnvironment.get_obj uri with*)
228 match CicTypeChecker.typecheck uri with
229 | Cic.InductiveDefinition (_, uris, _) -> uris
232 Cic.MutInd (uri, i, mk_subst uris)
233 | Cic.MutConstruct (uri, i, j, []) ->
235 (*match CicEnvironment.get_obj uri with*)
236 match CicTypeChecker.typecheck uri with
237 | Cic.InductiveDefinition (_, uris, _) -> uris
240 Cic.MutConstruct (uri, i, j, mk_subst uris)
241 | Cic.Meta _ | Cic.Implicit _ as t ->
243 prerr_endline (sprintf
244 "Warning: %s must be instantiated with _[%s] but we do not enforce it"
248 (fun (s, term) -> s ^ " := " ^ CicAstPp.pp_term term)
253 raise DisambiguateChoices.Invalid_choice
255 CicEnvironment.CircularDependency _ ->
256 raise DisambiguateChoices.Invalid_choice))
257 | CicAst.Implicit -> Cic.Implicit None
258 | CicAst.Num (num, i) -> resolve env (Num i) ~num ()
259 | CicAst.Meta (index, subst) ->
262 (function None -> None | Some term -> Some (aux loc context term))
265 Cic.Meta (index, cic_subst)
266 | CicAst.Sort `Prop -> Cic.Sort Cic.Prop
267 | CicAst.Sort `Set -> Cic.Sort Cic.Set
268 | CicAst.Sort `Type -> Cic.Sort (Cic.Type (CicUniv.fresh())) (* TASSI *)
269 | CicAst.Sort `CProp -> Cic.Sort Cic.CProp
270 | CicAst.Symbol (symbol, instance) ->
271 resolve env (Symbol (symbol, instance)) ()
272 and aux_option loc context = function
273 | None -> Cic.Implicit (Some `Type)
274 | Some term -> aux loc context term
277 | CicAst.AttributedTerm (`Loc loc, term) -> aux loc context term
278 | term -> aux (-1, -1) context term
280 let domain_of_term ~context ast =
281 (* "aux" keeps domain in reverse order and doesn't care about duplicates.
282 * Domain item more in deep in the list will be processed first.
284 let rec aux loc context = function
285 | CicAst.AttributedTerm (`Loc loc, term) -> aux loc context term
286 | CicAst.AttributedTerm (_, term) -> aux loc context term
287 | CicAst.Appl terms ->
288 List.fold_left (fun dom term -> aux loc context term @ dom) [] terms
289 | CicAst.Binder (kind, (var, typ), body) ->
292 | `Exists -> [ Symbol ("exists", 0) ]
295 let type_dom = aux_option loc context typ in
296 let body_dom = aux loc (var :: context) body in
297 body_dom @ type_dom @ kind_dom
298 | CicAst.Case (term, indty_ident, outtype, branches) ->
299 let term_dom = aux loc context term in
300 let outtype_dom = aux_option loc context outtype in
301 let do_branch ((head, args), term) =
302 let (term_context, args_domain) =
304 (fun (cont, dom) (name, typ) ->
308 | Some typ -> aux loc cont typ @ dom)))
311 args_domain @ aux loc term_context term
314 List.fold_left (fun dom branch -> do_branch branch @ dom) [] branches
316 branches_dom @ outtype_dom @ term_dom @
317 (match indty_ident with None -> [] | Some ident -> [ Id ident ])
318 | CicAst.LetIn ((var, typ), body, where) ->
319 let body_dom = aux loc context body in
320 let type_dom = aux_option loc context typ in
321 let where_dom = aux loc (var :: context) where in
322 where_dom @ type_dom @ body_dom
323 | CicAst.LetRec (kind, defs, where) ->
325 List.fold_left (fun acc ((var, typ), _, _) -> var :: acc)
328 let where_dom = aux loc context' where in
331 (fun dom ((_, typ), body, _) ->
332 aux loc context' body @ aux_option loc context typ)
336 | CicAst.Ident (name, subst) ->
338 let index = find_in_environment name context in
339 if subst <> None then
340 CicTextualParser2.fail loc
341 "Explicit substitutions not allowed here"
349 (fun dom (_, term) ->
350 let dom' = aux loc context term in
353 | CicAst.Implicit -> []
354 | CicAst.Num (num, i) -> [ Num i ]
355 | CicAst.Meta (index, local_context) ->
356 List.fold_left (fun dom term -> aux_option loc context term @ dom) []
358 | CicAst.Sort _ -> []
359 | CicAst.Symbol (symbol, instance) -> [ Symbol (symbol, instance) ]
361 and aux_option loc context = function
363 | Some t -> aux loc context t
366 (* e.g. [5;1;1;1;2;3;4;1;2] -> [2;1;4;3;5] *)
368 let module SortedItem =
370 type t = DisambiguateTypes.domain_item
371 let compare = Pervasives.compare
374 let module Set = Set.Make (SortedItem) in
376 let rev_l = List.rev l in
377 let (_, uniq_rev_l) =
379 (fun (members, rev_l) elt ->
380 if Set.mem elt members then
383 Set.add elt members, elt :: rev_l)
384 (Set.empty, []) rev_l
391 | CicAst.AttributedTerm (`Loc loc, term) -> aux loc context term
392 | term -> aux (-1, -1) context term)
396 let domain_diff dom1 dom2 =
397 (* let domain_diff = Domain.diff *)
399 List.fold_left (fun pred elt -> (fun elt' -> elt' = elt || pred elt'))
400 (fun _ -> false) dom2
402 List.filter (fun elt -> not (is_in_dom2 elt)) dom1
404 module Make (C: Callbacks) =
406 let choices_of_id mqi_handle id =
407 let query = MQueryGenerator.locate id in
408 let result = MQueryInterpreter.execute mqi_handle query in
412 MQueryMisc.wrong_xpointer_format_from_wrong_xpointer_format' uri
417 [UriManager.string_of_uri (C.input_or_locate_uri
418 ~title:("URI matching \"" ^ id ^ "\" unknown.") ~id ())]
421 C.interactive_user_uri_choice ~selection_mode:`MULTIPLE
422 ~ok:"Try selected." ~enable_button_for_non_vars:true
423 ~title:"Ambiguous input." ~id
424 ~msg: ("Ambiguous input \"" ^ id ^
425 "\". Please, choose one or more interpretations:")
433 HelmLibraryObjects.term_of_uri (UriManager.uri_of_string uri)
434 with _ -> assert false
439 let disambiguate_term mqi_handle context metasenv term ~aliases:current_env
441 debug_print "NEW DISAMBIGUATE INPUT";
442 let disambiguate_context = (* cic context -> disambiguate context *)
444 (function None -> Cic.Anonymous | Some (name, _) -> name)
447 let term_dom = domain_of_term ~context:disambiguate_context term in
448 debug_print (sprintf "DISAMBIGUATION DOMAIN: %s"
449 (string_of_domain term_dom));
451 Environment.fold (fun item _ dom -> item :: dom) current_env []
453 let todo_dom = domain_diff term_dom current_dom in
454 (* (2) lookup function for any item (Id/Symbol/Num) *)
456 let id_choices = Hashtbl.create 1023 in
462 Hashtbl.find id_choices id
464 let choices = choices_of_id mqi_handle id in
465 Hashtbl.add id_choices id choices;
467 | Symbol (symb, _) -> DisambiguateChoices.lookup_symbol_choices symb
468 | Num instance -> DisambiguateChoices.lookup_num_choices ()
470 if choices = [] then raise (No_choices item);
473 (* (3) test an interpretation filling with meta uninterpreted identifiers
475 let test_env current_env todo_dom univ =
482 | Id _ | Num _ -> (fun _ _ _ -> Cic.Implicit (Some `Closed))
483 | Symbol _ -> (fun _ _ _ -> Cic.Implicit None))) env)
487 CicUniv.set_working univ;
489 interpretate ~context:disambiguate_context ~env:filled_env term
491 let k = refine metasenv context cic_term in
492 let new_univ = CicUniv.get_working () in
495 | Try_again -> Uncertain,univ
496 | DisambiguateChoices.Invalid_choice -> Ko,univ
498 (* (4) build all possible interpretations *)
499 let rec aux current_env todo_dom base_univ =
502 (match test_env current_env [] base_univ with
503 | Ok (term, metasenv),new_univ ->
504 [ current_env, metasenv, term, new_univ ]
505 | Ko,_ | Uncertain,_ -> [])
506 | item :: remaining_dom ->
507 debug_print (sprintf "CHOOSED ITEM: %s"
508 (string_of_domain_item item));
509 let choices = lookup_choices item in
510 let rec filter univ = function
512 | codomain_item :: tl ->
513 debug_print (sprintf "%s CHOSEN" (fst codomain_item)) ;
515 Environment.add item codomain_item current_env
517 (match test_env new_env remaining_dom univ with
518 | Ok (term, metasenv),new_univ ->
519 (match remaining_dom with
520 | [] -> [ new_env, metasenv, term, new_univ ]
521 | _ -> aux new_env remaining_dom new_univ )@
523 | Uncertain,new_univ ->
524 (match remaining_dom with
526 | _ -> aux new_env remaining_dom new_univ )@
528 | Ko,_ -> filter univ tl)
530 filter base_univ choices
532 let base_univ = CicUniv.get_working () in
534 match aux current_env todo_dom base_univ with
535 | [] -> raise NoWellTypedInterpretation
536 | [ e,me,t,u ] as l ->
537 debug_print "UNA SOLA SCELTA";
538 CicUniv.set_working u;
541 debug_print (sprintf "PIU' SCELTE (%d)" (List.length l));
544 (fun (env, _, _, _) ->
548 fst (Environment.find domain_item env)
550 (descr_of_domain_item domain_item, description))
554 let choosed = C.interactive_interpretation_choice choices in
555 let l' = List.map (List.nth l) choosed in
559 CicUniv.set_working u;
560 (*CicUniv.print_working_graph ();*)
562 | hd::tl -> (* ok, testlibrary... cosi' stampa MANY... bah *)
563 List.map (fun (e,me,t,u) -> (e,me,t)) l'
565 CicEnvironment.CircularDependency s ->
566 raise (Failure "e chi la becca sta CircularDependency?");