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
33 exception PathNotWellFormed
35 (** raised when an environment is not enough informative to decide *)
38 type aliases = bool * DisambiguateTypes.environment
41 let debug_print = if debug then prerr_endline else ignore
44 (** print benchmark information *)
46 let max_refinements = ref 0 (* benchmarking is not thread safe *)
47 let actual_refinements = ref 0
48 let domain_size = ref 0
49 let choices_avg = ref 0.
52 let descr_of_domain_item = function
55 | Num i -> string_of_int i
58 | Ok of 'a * Cic.metasenv
62 let refine_term metasenv context uri term ugraph =
63 (* if benchmark then incr actual_refinements; *)
66 CicMkImplicit.expand_implicits metasenv [] context term in
67 debug_print (sprintf "TEST_INTERPRETATION: %s" (CicPp.ppterm term));
69 let term', _, metasenv',ugraph1 =
70 CicRefine.type_of_aux' metasenv context term ugraph in
71 (Ok (term', metasenv')),ugraph1
73 | CicRefine.Uncertain s ->
74 debug_print ("UNCERTAIN!!! [" ^ s ^ "] " ^ CicPp.ppterm term) ;
76 | CicRefine.RefineFailure msg ->
77 debug_print (sprintf "PRUNED!!!\nterm%s\nmessage:%s"
78 (CicPp.ppterm term) (CicRefine.explain_error msg));
81 let refine_obj metasenv context uri obj ugraph =
82 assert (context = []);
83 let metasenv, obj = CicMkImplicit.expand_implicits_in_obj metasenv [] obj in
84 debug_print (sprintf "TEST_INTERPRETATION: %s" (CicPp.ppobj obj));
86 let obj', metasenv,ugraph = CicRefine.typecheck metasenv uri obj in
87 (Ok (obj', metasenv)),ugraph
89 | CicRefine.Uncertain s ->
90 debug_print ("UNCERTAIN!!! [" ^ s ^ "] " ^ CicPp.ppobj obj) ;
92 | CicRefine.RefineFailure msg ->
93 debug_print (sprintf "PRUNED!!!\nterm%s\nmessage:%s"
94 (CicPp.ppobj obj) (CicRefine.explain_error msg));
97 let resolve (env: codomain_item Environment.t) (item: domain_item) ?(num = "") ?(args = []) () =
99 snd (Environment.find item env) env num args
101 failwith ("Domain item not found: " ^
102 (DisambiguateTypes.string_of_domain_item item))
104 (* TODO move it to Cic *)
105 let find_in_environment name (context: Cic.name list) =
106 let rec aux acc = function
107 | [] -> raise Not_found
108 | Cic.Name hd :: tl when hd = name -> acc
109 | _ :: tl -> aux (acc + 1) tl
113 let interpretate_term ~(context: Cic.name list) ~env ~uri ~is_path ast =
115 let rec aux loc (context: Cic.name list) = function
116 | CicNotationPt.AttributedTerm (`Loc loc, term) ->
118 | CicNotationPt.AttributedTerm (_, term) -> aux loc context term
119 | CicNotationPt.Appl (CicNotationPt.Symbol (symb, i) :: args) ->
120 let cic_args = List.map (aux loc context) args in
121 resolve env (Symbol (symb, i)) ~args:cic_args ()
122 | CicNotationPt.Appl terms -> Cic.Appl (List.map (aux loc context) terms)
123 | CicNotationPt.Binder (binder_kind, (var, typ), body) ->
124 let cic_type = aux_option loc context (Some `Type) typ in
125 let cic_name = CicNotationUtil.cic_name_of_name var in
126 let cic_body = aux loc (cic_name :: context) body in
127 (match binder_kind with
128 | `Lambda -> Cic.Lambda (cic_name, cic_type, cic_body)
130 | `Forall -> Cic.Prod (cic_name, cic_type, cic_body)
132 resolve env (Symbol ("exists", 0))
133 ~args:[ cic_type; Cic.Lambda (cic_name, cic_type, cic_body) ] ())
134 | CicNotationPt.Case (term, indty_ident, outtype, branches) ->
135 let cic_term = aux loc context term in
136 let cic_outtype = aux_option loc context None outtype in
137 let do_branch ((head, _, args), term) =
138 let rec do_branch' context = function
139 | [] -> aux loc context term
140 | (name, typ) :: tl ->
141 let cic_name = CicNotationUtil.cic_name_of_name name in
142 let cic_body = do_branch' (cic_name :: context) tl in
145 | None -> Cic.Implicit (Some `Type)
146 | Some typ -> aux loc context typ
148 Cic.Lambda (cic_name, typ, cic_body)
150 do_branch' context args
152 let (indtype_uri, indtype_no) =
153 match indty_ident with
154 | Some (indty_ident, _) ->
155 (match resolve env (Id indty_ident) () with
156 | Cic.MutInd (uri, tyno, _) -> (uri, tyno)
157 | Cic.Implicit _ -> raise Try_again
158 | _ -> raise Invalid_choice)
160 let fst_constructor =
162 | ((head, _, _), _) :: _ -> head
163 | [] -> raise Invalid_choice
165 (match resolve env (Id fst_constructor) () with
166 | Cic.MutConstruct (indtype_uri, indtype_no, _, _) ->
167 (indtype_uri, indtype_no)
168 | Cic.Implicit _ -> raise Try_again
169 | _ -> raise Invalid_choice)
171 Cic.MutCase (indtype_uri, indtype_no, cic_outtype, cic_term,
172 (List.map do_branch branches))
173 | CicNotationPt.Cast (t1, t2) ->
174 let cic_t1 = aux loc context t1 in
175 let cic_t2 = aux loc context t2 in
176 Cic.Cast (cic_t1, cic_t2)
177 | CicNotationPt.LetIn ((name, typ), def, body) ->
178 let cic_def = aux loc context def in
179 let cic_name = CicNotationUtil.cic_name_of_name name in
183 | Some t -> Cic.Cast (cic_def, aux loc context t)
185 let cic_body = aux loc (cic_name :: context) body in
186 Cic.LetIn (cic_name, cic_def, cic_body)
187 | CicNotationPt.LetRec (kind, defs, body) ->
190 (fun acc ((name, _), _, _) ->
191 CicNotationUtil.cic_name_of_name name :: acc)
194 let cic_body = aux loc context' body in
197 (fun ((name, typ), body, decr_idx) ->
198 let cic_body = aux loc context' body in
199 let cic_type = aux_option loc context (Some `Type) typ in
201 match CicNotationUtil.cic_name_of_name name with
203 CicNotationPt.fail loc
204 "Recursive functions cannot be anonymous"
205 | Cic.Name name -> name
207 (name, decr_idx, cic_type, cic_body))
210 let counter = ref ~-1 in
211 let build_term funs =
212 (* this is the body of the fold_right function below. Rationale: Fix
213 * and CoFix cases differs only in an additional index in the
214 * inductiveFun list, see Cic.term *)
217 (fun (var, _, _, _) cic ->
219 Cic.LetIn (Cic.Name var, Cic.Fix (!counter, funs), cic))
222 List.map (fun (name, _, typ, body) -> (name, typ, body)) funs
224 (fun (var, _, _, _) cic ->
226 Cic.LetIn (Cic.Name var, Cic.CoFix (!counter, funs), cic))
228 List.fold_right (build_term inductiveFuns) inductiveFuns cic_body
229 | CicNotationPt.Ident _
230 | CicNotationPt.Uri _ when is_path -> raise PathNotWellFormed
231 | CicNotationPt.Ident (name, subst)
232 | CicNotationPt.Uri (name, subst) as ast ->
233 let is_uri = function CicNotationPt.Uri _ -> true | _ -> false in
235 if is_uri ast then raise Not_found;(* don't search the env for URIs *)
236 let index = find_in_environment name context in
237 if subst <> None then
238 CicNotationPt.fail loc "Explicit substitutions not allowed here";
242 if is_uri ast then (* we have the URI, build the term out of it *)
244 CicUtil.term_of_uri (UriManager.uri_of_string name)
245 with UriManager.IllFormedUri _ ->
246 CicNotationPt.fail loc "Ill formed URI"
248 resolve env (Id name) ()
252 List.map (fun uri -> UriManager.name_of_uri uri, uri) uris
259 List.assoc s ids_to_uris, aux loc context term
261 raise Invalid_choice))
263 | None -> List.map (fun uri -> uri, Cic.Implicit None) uris)
267 | Cic.Const (uri, []) ->
268 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
269 let uris = CicUtil.params_of_obj o in
270 Cic.Const (uri, mk_subst uris)
271 | Cic.Var (uri, []) ->
272 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
273 let uris = CicUtil.params_of_obj o in
274 Cic.Var (uri, mk_subst uris)
275 | Cic.MutInd (uri, i, []) ->
277 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
278 let uris = CicUtil.params_of_obj o in
279 Cic.MutInd (uri, i, mk_subst uris)
281 CicEnvironment.Object_not_found _ ->
282 (* if we are here it is probably the case that during the
283 definition of a mutual inductive type we have met an
284 occurrence of the type in one of its constructors.
285 However, the inductive type is not yet in the environment
287 (*here the explicit_named_substituion is assumed to be of length 0 *)
288 Cic.MutInd (uri,i,[]))
289 | Cic.MutConstruct (uri, i, j, []) ->
290 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
291 let uris = CicUtil.params_of_obj o in
292 Cic.MutConstruct (uri, i, j, mk_subst uris)
293 | Cic.Meta _ | Cic.Implicit _ as t ->
296 "Warning: %s must be instantiated with _[%s] but we do not enforce it"
300 (fun (s, term) -> s ^ " := " ^ CicNotationPtPp.pp_term term)
307 CicEnvironment.CircularDependency _ ->
308 raise Invalid_choice))
309 | CicNotationPt.Implicit -> Cic.Implicit None
310 | CicNotationPt.UserInput -> Cic.Implicit (Some `Hole)
311 | CicNotationPt.Num (num, i) -> resolve env (Num i) ~num ()
312 | CicNotationPt.Meta (index, subst) ->
315 (function None -> None | Some term -> Some (aux loc context term))
318 Cic.Meta (index, cic_subst)
319 | CicNotationPt.Sort `Prop -> Cic.Sort Cic.Prop
320 | CicNotationPt.Sort `Set -> Cic.Sort Cic.Set
321 | CicNotationPt.Sort `Type -> Cic.Sort (Cic.Type (CicUniv.fresh())) (* TASSI *)
322 | CicNotationPt.Sort `CProp -> Cic.Sort Cic.CProp
323 | CicNotationPt.Symbol (symbol, instance) ->
324 resolve env (Symbol (symbol, instance)) ()
325 | _ -> assert false (* god bless Bologna *)
326 and aux_option loc (context: Cic.name list) annotation = function
327 | None -> Cic.Implicit annotation
328 | Some term -> aux loc context term
331 | CicNotationPt.AttributedTerm (`Loc loc, term) -> aux loc context term
332 | term -> aux dummy_floc context term
334 let interpretate_path ~context path =
335 interpretate_term ~context ~env:Environment.empty ~uri:None ~is_path:true path
337 let interpretate_obj ~context ~env ~uri ~is_path obj =
338 assert (context = []);
339 assert (is_path = false);
341 | GrafiteAst.Inductive (params,tyl) ->
342 let uri = match uri with Some uri -> uri | None -> assert false in
346 (fun (context,res) (name,t) ->
347 Cic.Name name :: context,
348 (name, interpretate_term context env None false t)::res
351 context,List.rev res in
354 (fun (name,ty) t -> Cic.Prod (Cic.Name name,ty,t)) params in
358 (*here the explicit_named_substituion is assumed to be of length 0 *)
359 (fun (i,res) (name,_,_,_) ->
360 i + 1,(name,name,Cic.MutInd (uri,i,[]))::res
362 let con_env = DisambiguateTypes.env_of_list name_to_uris env in
366 (fun (name,_,_,_) (i,t) ->
367 (*here the explicit_named_substituion is assumed to be of length 0 *)
368 let t' = Cic.MutInd (uri,i,[]) in
369 let t = CicSubstitution.subst t' t in
371 ) tyl (List.length tyl - 1,t)) in
374 (fun (name,b,ty,cl) ->
375 let ty' = add_params (interpretate_term context env None false ty) in
380 add_params (interpretate_term context con_env None false ty)
388 Cic.InductiveDefinition (tyl,[],List.length params,[])
389 | GrafiteAst.Record (params,name,ty,fields) ->
390 let uri = match uri with Some uri -> uri | None -> assert false in
394 (fun (context,res) (name,t) ->
395 (Cic.Name name :: context),
396 (name, interpretate_term context env None false t)::res
399 context,List.rev res in
402 (fun (name,ty) t -> Cic.Prod (Cic.Name name,ty,t)) params in
403 let ty' = add_params (interpretate_term context env None false ty) in
407 (fun (context,res) (name,ty) ->
408 let context' = Cic.Name name :: context in
409 context',(name,interpretate_term context env None false ty)::res
410 ) (context,[]) fields) in
412 (*here the explicit_named_substituion is assumed to be of length 0 *)
413 let mutind = Cic.MutInd (uri,0,[]) in
414 if params = [] then mutind
417 (mutind::CicUtil.mk_rels (List.length params) (List.length fields)) in
420 (fun t (name,ty) -> Cic.Prod (Cic.Name name,ty,t))
422 let con' = add_params con in
423 let tyl = [name,true,ty',["mk_" ^ name,con']] in
424 let field_names = List.map fst fields in
425 Cic.InductiveDefinition
426 (tyl,[],List.length params,[`Class (`Record field_names)])
427 | GrafiteAst.Theorem (flavour, name, ty, bo) ->
428 let attrs = [`Flavour flavour] in
429 let ty' = interpretate_term [] env None false ty in
432 Cic.CurrentProof (name,[],Cic.Implicit None,ty',[],attrs)
434 let bo' = Some (interpretate_term [] env None false bo) in
435 Cic.Constant (name,bo',ty',[],attrs))
438 (* e.g. [5;1;1;1;2;3;4;1;2] -> [2;1;4;3;5] *)
440 let module SortedItem =
442 type t = DisambiguateTypes.domain_item
443 let compare = Pervasives.compare
446 let module Set = Set.Make (SortedItem) in
448 let rev_l = List.rev l in
449 let (_, uniq_rev_l) =
451 (fun (members, rev_l) elt ->
452 if Set.mem elt members then
455 Set.add elt members, elt :: rev_l)
456 (Set.empty, []) rev_l
460 (* "aux" keeps domain in reverse order and doesn't care about duplicates.
461 * Domain item more in deep in the list will be processed first.
463 let rec domain_rev_of_term ?(loc = dummy_floc) context = function
464 | CicNotationPt.AttributedTerm (`Loc loc, term) ->
465 domain_rev_of_term ~loc context term
466 | CicNotationPt.AttributedTerm (_, term) ->
467 domain_rev_of_term ~loc context term
468 | CicNotationPt.Appl terms ->
470 (fun dom term -> domain_rev_of_term ~loc context term @ dom) [] terms
471 | CicNotationPt.Binder (kind, (var, typ), body) ->
474 | `Exists -> [ Symbol ("exists", 0) ]
477 let type_dom = domain_rev_of_term_option loc context typ in
479 domain_rev_of_term ~loc
480 (CicNotationUtil.cic_name_of_name var :: context) body
482 body_dom @ type_dom @ kind_dom
483 | CicNotationPt.Case (term, indty_ident, outtype, branches) ->
484 let term_dom = domain_rev_of_term ~loc context term in
485 let outtype_dom = domain_rev_of_term_option loc context outtype in
486 let get_first_constructor = function
488 | ((head, _, _), _) :: _ -> [ Id head ]
490 let do_branch ((head, _, args), term) =
491 let (term_context, args_domain) =
493 (fun (cont, dom) (name, typ) ->
494 (CicNotationUtil.cic_name_of_name name :: cont,
497 | Some typ -> domain_rev_of_term ~loc cont typ @ dom)))
500 args_domain @ domain_rev_of_term ~loc term_context term
503 List.fold_left (fun dom branch -> do_branch branch @ dom) [] branches
505 branches_dom @ outtype_dom @ term_dom @
506 (match indty_ident with
507 | None -> get_first_constructor branches
508 | Some (ident, _) -> [ Id ident ])
509 | CicNotationPt.Cast (term, ty) ->
510 let term_dom = domain_rev_of_term ~loc context term in
511 let ty_dom = domain_rev_of_term ~loc context ty in
513 | CicNotationPt.LetIn ((var, typ), body, where) ->
514 let body_dom = domain_rev_of_term ~loc context body in
515 let type_dom = domain_rev_of_term_option loc context typ in
517 domain_rev_of_term ~loc
518 (CicNotationUtil.cic_name_of_name var :: context) where
520 where_dom @ type_dom @ body_dom
521 | CicNotationPt.LetRec (kind, defs, where) ->
524 (fun acc ((var, typ), _, _) ->
525 CicNotationUtil.cic_name_of_name var :: acc)
528 let where_dom = domain_rev_of_term ~loc context' where in
531 (fun dom ((_, typ), body, _) ->
532 domain_rev_of_term ~loc context' body @
533 domain_rev_of_term_option loc context typ)
537 | CicNotationPt.Ident (name, subst) ->
539 let index = find_in_environment name context in
540 if subst <> None then
541 CicNotationPt.fail loc "Explicit substitutions not allowed here"
549 (fun dom (_, term) ->
550 let dom' = domain_rev_of_term ~loc context term in
553 | CicNotationPt.Uri _ -> []
554 | CicNotationPt.Implicit -> []
555 | CicNotationPt.Num (num, i) -> [ Num i ]
556 | CicNotationPt.Meta (index, local_context) ->
558 (fun dom term -> domain_rev_of_term_option loc context term @ dom) []
560 | CicNotationPt.Sort _ -> []
561 | CicNotationPt.Symbol (symbol, instance) -> [ Symbol (symbol, instance) ]
562 | CicNotationPt.UserInput
563 | CicNotationPt.Literal _
564 | CicNotationPt.Layout _
565 | CicNotationPt.Magic _
566 | CicNotationPt.Variable _ -> assert false
568 and domain_rev_of_term_option loc context = function
570 | Some t -> domain_rev_of_term ~loc context t
572 let domain_of_term ~context ast = rev_uniq (domain_rev_of_term context ast)
574 let domain_of_obj ~context ast =
575 assert (context = []);
578 | GrafiteAst.Theorem (_,_,ty,bo) ->
581 | Some bo -> domain_rev_of_term [] bo) @
583 | GrafiteAst.Inductive (params,tyl) ->
590 (fun (_,ty) -> domain_rev_of_term [] ty) cl) @
591 domain_rev_of_term [] ty) tyl) in
595 domain_rev_of_term [] ty @ dom
600 not ( List.exists (fun (name',_) -> name = Id name') params
601 || List.exists (fun (name',_,_,_) -> name = Id name') tyl)
603 | GrafiteAst.Record (params,_,ty,fields) ->
606 (List.rev_map (fun (_,ty) -> domain_rev_of_term [] ty) fields) in
610 not ( List.exists (fun (name',_) -> name = Id name') params
611 || List.exists (fun (name',_) -> name = Id name') fields)
616 domain_rev_of_term [] ty @ dom
617 ) (dom @ domain_rev_of_term [] ty) params
622 let domain_diff dom1 dom2 =
623 (* let domain_diff = Domain.diff *)
625 List.fold_left (fun pred elt -> (fun elt' -> elt' = elt || pred elt'))
626 (fun _ -> false) dom2
628 List.filter (fun elt -> not (is_in_dom2 elt)) dom1
630 module type Disambiguator =
632 val disambiguate_term :
633 ?fresh_instances:bool ->
635 context:Cic.context ->
636 metasenv:Cic.metasenv ->
637 ?initial_ugraph:CicUniv.universe_graph ->
638 aliases:DisambiguateTypes.environment ->(* previous interpretation status *)
639 universe:DisambiguateTypes.multiple_environment option ->
640 CicNotationPt.term ->
641 (environment * (* new interpretation status *)
642 Cic.metasenv * (* new metasenv *)
644 CicUniv.universe_graph) list * (* disambiguated term *)
647 val disambiguate_obj :
648 ?fresh_instances:bool ->
650 aliases:DisambiguateTypes.environment ->(* previous interpretation status *)
651 universe:DisambiguateTypes.multiple_environment option ->
652 uri:UriManager.uri option -> (* required only for inductive types *)
654 (environment * (* new interpretation status *)
655 Cic.metasenv * (* new metasenv *)
657 CicUniv.universe_graph) list * (* disambiguated obj *)
661 module Make (C: Callbacks) =
663 let choices_of_id dbd id =
664 let uris = MetadataQuery.locate ~dbd id in
668 [(C.input_or_locate_uri
669 ~title:("URI matching \"" ^ id ^ "\" unknown.") ~id ())]
672 C.interactive_user_uri_choice ~selection_mode:`MULTIPLE
673 ~ok:"Try selected." ~enable_button_for_non_vars:true
674 ~title:"Ambiguous input." ~id
675 ~msg: ("Ambiguous input \"" ^ id ^
676 "\". Please, choose one or more interpretations:")
681 (UriManager.string_of_uri uri,
684 CicUtil.term_of_uri uri
686 debug_print (UriManager.string_of_uri uri);
687 debug_print (Printexc.to_string exn);
693 let disambiguate_thing ~dbd ~context ~metasenv
694 ?(initial_ugraph = CicUniv.empty_ugraph) ~aliases ~universe
695 ~uri ~pp_thing ~domain_of_thing ~interpretate_thing ~refine_thing thing
697 debug_print "DISAMBIGUATE INPUT";
698 let disambiguate_context = (* cic context -> disambiguate context *)
700 (function None -> Cic.Anonymous | Some (name, _) -> name)
703 debug_print ("TERM IS: " ^ (pp_thing thing));
704 let thing_dom = domain_of_thing ~context:disambiguate_context thing in
705 debug_print (sprintf "DISAMBIGUATION DOMAIN: %s"
706 (string_of_domain thing_dom));
707 debug_print (sprintf "DISAMBIGUATION ENVIRONMENT: %s"
708 (DisambiguatePp.pp_environment aliases));
709 debug_print (sprintf "DISAMBIGUATION UNIVERSE: %s"
710 (match universe with None -> "None" | Some _ -> "Some _"));
712 Environment.fold (fun item _ dom -> item :: dom) aliases []
714 let todo_dom = domain_diff thing_dom current_dom in
715 (* (2) lookup function for any item (Id/Symbol/Num) *)
717 let id_choices = Hashtbl.create 1023 in
720 let lookup_in_library () =
722 | Id id -> choices_of_id dbd id
723 | Symbol (symb, _) ->
724 List.map DisambiguateChoices.mk_choice
725 (CicNotationRew.lookup_interpretations symb)
727 DisambiguateChoices.lookup_num_choices ()
730 | None -> lookup_in_library ()
733 Environment.find item e
734 with Not_found -> lookup_in_library ())
736 if choices = [] then raise (No_choices item);
742 if benchmark then begin
743 let per_item_choices =
747 let len = List.length (lookup_choices dom_item) in
748 debug_print (sprintf "BENCHMARK %s: %d"
749 (string_of_domain_item dom_item) len);
751 with No_choices _ -> 0)
754 max_refinements := List.fold_left ( * ) 1 per_item_choices;
755 actual_refinements := 0;
756 domain_size := List.length thing_dom;
758 (float_of_int !max_refinements) ** (1. /. float_of_int !domain_size)
764 (* (3) test an interpretation filling with meta uninterpreted identifiers
766 let test_env aliases todo_dom ugraph =
773 | Id _ | Num _ -> (fun _ _ _ -> Cic.Implicit (Some `Closed))
774 | Symbol _ -> (fun _ _ _ -> Cic.Implicit None))) env)
779 interpretate_thing ~context:disambiguate_context ~env:filled_env
780 ~uri ~is_path:false thing
782 let k,ugraph1 = refine_thing metasenv context uri cic_thing ugraph in
785 | Try_again -> Uncertain, ugraph
786 | Invalid_choice -> Ko, ugraph
788 (* (4) build all possible interpretations *)
789 let rec aux aliases todo_dom base_univ =
792 (match test_env aliases [] base_univ with
793 | Ok (thing, metasenv),new_univ ->
794 [ aliases, metasenv, thing, new_univ ]
795 | Ko,_ | Uncertain,_ -> [])
796 | item :: remaining_dom ->
797 debug_print (sprintf "CHOOSED ITEM: %s"
798 (string_of_domain_item item));
799 let choices = lookup_choices item in
800 let rec filter univ = function
802 | codomain_item :: tl ->
803 debug_print (sprintf "%s CHOSEN" (fst codomain_item)) ;
805 Environment.add item codomain_item aliases
807 (match test_env new_env remaining_dom univ with
808 | Ok (thing, metasenv),new_univ ->
809 (match remaining_dom with
810 | [] -> [ new_env, metasenv, thing, new_univ ]
811 | _ -> aux new_env remaining_dom new_univ )@
813 | Uncertain,new_univ ->
814 (match remaining_dom with
816 | _ -> aux new_env remaining_dom new_univ )@
818 | Ko,_ -> filter univ tl)
820 filter base_univ choices
822 let base_univ = initial_ugraph in
825 match aux aliases todo_dom base_univ with
826 | [] -> raise NoWellTypedInterpretation
828 debug_print "SINGLE INTERPRETATION";
831 debug_print (sprintf "MANY INTERPRETATIONS (%d)" (List.length l));
834 (fun (env, _, _, _) ->
838 fst (Environment.find domain_item env)
840 (descr_of_domain_item domain_item, description))
844 let choosed = C.interactive_interpretation_choice choices in
845 (List.map (List.nth l) choosed), true
849 let res_size = List.length res in
851 ("BENCHMARK: %d/%d refinements performed, domain size %d, interps %d, k %.2f\n" ^^
852 "BENCHMARK: estimated %.2f")
853 !actual_refinements !max_refinements !domain_size res_size
855 (float_of_int (!domain_size - 1) *. !choices_avg *. (float_of_int res_size) +. !choices_avg)));
857 let choices, b = res in
859 (fun (env, metasenv, t, ugraph) ->
860 Environment.fold Environment.add env aliases,
865 CicEnvironment.CircularDependency s ->
866 failwith "Disambiguate: circular dependency"
868 let disambiguate_term ?(fresh_instances=false) ~dbd ~context ~metasenv
869 ?(initial_ugraph = CicUniv.empty_ugraph) ~aliases ~universe term
872 if fresh_instances then CicNotationUtil.freshen_term term else term
874 disambiguate_thing ~dbd ~context ~metasenv ~initial_ugraph ~aliases
875 ~universe ~uri:None ~pp_thing:CicNotationPp.pp_term
876 ~domain_of_thing:domain_of_term ~interpretate_thing:interpretate_term
877 ~refine_thing:refine_term term
879 let disambiguate_obj ?(fresh_instances=false) ~dbd ~aliases ~universe ~uri
883 if fresh_instances then CicNotationUtil.freshen_obj obj else obj
885 disambiguate_thing ~dbd ~context:[] ~metasenv:[] ~aliases ~universe ~uri
886 ~pp_thing:GrafiteAstPp.pp_obj ~domain_of_thing:domain_of_obj
887 ~interpretate_thing:interpretate_obj ~refine_thing:refine_obj
893 exception Ambiguous_term of string
897 let interactive_user_uri_choice ~selection_mode ?ok
898 ?(enable_button_for_non_vars = true) ~title ~msg ~id uris =
900 let interactive_interpretation_choice interp = raise Exit
901 let input_or_locate_uri ~(title:string) ?id = raise Exit
903 module Disambiguator = Make (Callbacks)
904 let disambiguate_string ~dbd ?(context = []) ?(metasenv = []) ?initial_ugraph
905 ?(aliases = DisambiguateTypes.Environment.empty) term
907 let ast = CicNotationParser.parse_level2_ast (Stream.of_string term) in
909 fst (Disambiguator.disambiguate_term ~dbd ~context ~metasenv ast
910 ?initial_ugraph ~aliases ~universe:None)
911 with Exit -> raise (Ambiguous_term term)