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 s = if debug then prerr_endline (Lazy.force s) else ()
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; *)
65 debug_print (lazy (sprintf "TEST_INTERPRETATION: %s" (CicPp.ppterm term)));
67 let term', _, metasenv',ugraph1 =
68 CicRefine.type_of_aux' metasenv context term ugraph in
69 (Ok (term', metasenv')),ugraph1
71 | CicRefine.Uncertain s ->
72 debug_print (lazy ("UNCERTAIN!!! [" ^ (Lazy.force s) ^ "] " ^ CicPp.ppterm term)) ;
74 | CicRefine.RefineFailure msg ->
75 debug_print (lazy (sprintf "PRUNED!!!\nterm%s\nmessage:%s"
76 (CicPp.ppterm term) (Lazy.force msg)));
79 let refine_obj metasenv context uri obj ugraph =
80 assert (context = []);
81 debug_print (lazy (sprintf "TEST_INTERPRETATION: %s" (CicPp.ppobj obj))) ;
83 let obj', metasenv,ugraph = CicRefine.typecheck metasenv uri obj in
84 (Ok (obj', metasenv)),ugraph
86 | CicRefine.Uncertain s ->
87 debug_print (lazy ("UNCERTAIN!!! [" ^ (Lazy.force s) ^ "] " ^ CicPp.ppobj obj)) ;
89 | CicRefine.RefineFailure msg ->
90 debug_print (lazy (sprintf "PRUNED!!!\nterm%s\nmessage:%s"
91 (CicPp.ppobj obj) (Lazy.force msg))) ;
94 let resolve (env: codomain_item Environment.t) (item: domain_item) ?(num = "") ?(args = []) () =
96 snd (Environment.find item env) env num args
98 failwith ("Domain item not found: " ^
99 (DisambiguateTypes.string_of_domain_item item))
101 (* TODO move it to Cic *)
102 let find_in_context name (context: Cic.name list) =
103 let rec aux acc = function
104 | [] -> raise Not_found
105 | Cic.Name hd :: tl when hd = name -> acc
106 | _ :: tl -> aux (acc + 1) tl
110 let interpretate_term ~(context: Cic.name list) ~env ~uri ~is_path ast =
112 let rec aux loc (context: Cic.name list) = function
113 | CicNotationPt.AttributedTerm (`Loc loc, term) ->
115 | CicNotationPt.AttributedTerm (_, term) -> aux loc context term
116 | CicNotationPt.Appl (CicNotationPt.Symbol (symb, i) :: args) ->
117 let cic_args = List.map (aux loc context) args in
118 resolve env (Symbol (symb, i)) ~args:cic_args ()
119 | CicNotationPt.Appl terms -> Cic.Appl (List.map (aux loc context) terms)
120 | CicNotationPt.Binder (binder_kind, (var, typ), body) ->
121 let cic_type = aux_option loc context (Some `Type) typ in
122 let cic_name = CicNotationUtil.cic_name_of_name var in
123 let cic_body = aux loc (cic_name :: context) body in
124 (match binder_kind with
125 | `Lambda -> Cic.Lambda (cic_name, cic_type, cic_body)
127 | `Forall -> Cic.Prod (cic_name, cic_type, cic_body)
129 resolve env (Symbol ("exists", 0))
130 ~args:[ cic_type; Cic.Lambda (cic_name, cic_type, cic_body) ] ())
131 | CicNotationPt.Case (term, indty_ident, outtype, branches) ->
132 let cic_term = aux loc context term in
133 let cic_outtype = aux_option loc context None outtype in
134 let do_branch ((head, _, args), term) =
135 let rec do_branch' context = function
136 | [] -> aux loc context term
137 | (name, typ) :: tl ->
138 let cic_name = CicNotationUtil.cic_name_of_name name in
139 let cic_body = do_branch' (cic_name :: context) tl in
142 | None -> Cic.Implicit (Some `Type)
143 | Some typ -> aux loc context typ
145 Cic.Lambda (cic_name, typ, cic_body)
147 do_branch' context args
149 let (indtype_uri, indtype_no) =
150 match indty_ident with
151 | Some (indty_ident, _) ->
152 (match resolve env (Id indty_ident) () with
153 | Cic.MutInd (uri, tyno, _) -> (uri, tyno)
154 | Cic.Implicit _ -> raise Try_again
155 | _ -> raise Invalid_choice)
157 let fst_constructor =
159 | ((head, _, _), _) :: _ -> head
160 | [] -> raise Invalid_choice
162 (match resolve env (Id fst_constructor) () with
163 | Cic.MutConstruct (indtype_uri, indtype_no, _, _) ->
164 (indtype_uri, indtype_no)
165 | Cic.Implicit _ -> raise Try_again
166 | _ -> raise Invalid_choice)
168 Cic.MutCase (indtype_uri, indtype_no, cic_outtype, cic_term,
169 (List.map do_branch branches))
170 | CicNotationPt.Cast (t1, t2) ->
171 let cic_t1 = aux loc context t1 in
172 let cic_t2 = aux loc context t2 in
173 Cic.Cast (cic_t1, cic_t2)
174 | CicNotationPt.LetIn ((name, typ), def, body) ->
175 let cic_def = aux loc context def in
176 let cic_name = CicNotationUtil.cic_name_of_name name in
180 | Some t -> Cic.Cast (cic_def, aux loc context t)
182 let cic_body = aux loc (cic_name :: context) body in
183 Cic.LetIn (cic_name, cic_def, cic_body)
184 | CicNotationPt.LetRec (kind, defs, body) ->
187 (fun acc ((name, _), _, _) ->
188 CicNotationUtil.cic_name_of_name name :: acc)
191 let cic_body = aux loc context' body in
194 (fun ((name, typ), body, decr_idx) ->
195 let cic_body = aux loc context' body in
196 let cic_type = aux_option loc context (Some `Type) typ in
198 match CicNotationUtil.cic_name_of_name name with
200 CicNotationPt.fail loc
201 "Recursive functions cannot be anonymous"
202 | Cic.Name name -> name
204 (name, decr_idx, cic_type, cic_body))
207 let counter = ref ~-1 in
208 let build_term funs =
209 (* this is the body of the fold_right function below. Rationale: Fix
210 * and CoFix cases differs only in an additional index in the
211 * inductiveFun list, see Cic.term *)
214 (fun (var, _, _, _) cic ->
216 let fix = Cic.Fix (!counter,funs) in
219 | (Cic.Appl (Cic.Rel 1::l)) -> Cic.Appl (fix::l)
220 | _ -> Cic.LetIn (Cic.Name var, fix, cic))
223 List.map (fun (name, _, typ, body) -> (name, typ, body)) funs
225 (fun (var, _, _, _) cic ->
227 let cofix = Cic.CoFix (!counter,funs) in
230 | (Cic.Appl (Cic.Rel 1::l)) -> Cic.Appl (cofix::l)
231 | _ -> Cic.LetIn (Cic.Name var, cofix, cic))
233 List.fold_right (build_term inductiveFuns) inductiveFuns cic_body
234 | CicNotationPt.Ident _
235 | CicNotationPt.Uri _ when is_path -> raise PathNotWellFormed
236 | CicNotationPt.Ident (name, subst)
237 | CicNotationPt.Uri (name, subst) as ast ->
238 let is_uri = function CicNotationPt.Uri _ -> true | _ -> false in
240 if is_uri ast then raise Not_found;(* don't search the env for URIs *)
241 let index = find_in_context name context in
242 if subst <> None then
243 CicNotationPt.fail loc "Explicit substitutions not allowed here";
247 if is_uri ast then (* we have the URI, build the term out of it *)
249 CicUtil.term_of_uri (UriManager.uri_of_string name)
250 with UriManager.IllFormedUri _ ->
251 CicNotationPt.fail loc "Ill formed URI"
253 resolve env (Id name) ()
257 List.map (fun uri -> UriManager.name_of_uri uri, uri) uris
264 List.assoc s ids_to_uris, aux loc context term
266 raise Invalid_choice))
268 | None -> List.map (fun uri -> uri, Cic.Implicit None) uris)
272 | Cic.Const (uri, []) ->
273 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
274 let uris = CicUtil.params_of_obj o in
275 Cic.Const (uri, mk_subst uris)
276 | Cic.Var (uri, []) ->
277 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
278 let uris = CicUtil.params_of_obj o in
279 Cic.Var (uri, mk_subst uris)
280 | Cic.MutInd (uri, i, []) ->
282 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
283 let uris = CicUtil.params_of_obj o in
284 Cic.MutInd (uri, i, mk_subst uris)
286 CicEnvironment.Object_not_found _ ->
287 (* if we are here it is probably the case that during the
288 definition of a mutual inductive type we have met an
289 occurrence of the type in one of its constructors.
290 However, the inductive type is not yet in the environment
292 (*here the explicit_named_substituion is assumed to be of length 0 *)
293 Cic.MutInd (uri,i,[]))
294 | Cic.MutConstruct (uri, i, j, []) ->
295 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
296 let uris = CicUtil.params_of_obj o in
297 Cic.MutConstruct (uri, i, j, mk_subst uris)
298 | Cic.Meta _ | Cic.Implicit _ as t ->
300 debug_print (lazy (sprintf
301 "Warning: %s must be instantiated with _[%s] but we do not enforce it"
305 (fun (s, term) -> s ^ " := " ^ CicNotationPtPp.pp_term term)
312 CicEnvironment.CircularDependency _ ->
313 raise Invalid_choice))
314 | CicNotationPt.Implicit -> Cic.Implicit None
315 | CicNotationPt.UserInput -> Cic.Implicit (Some `Hole)
316 | CicNotationPt.Num (num, i) -> resolve env (Num i) ~num ()
317 | CicNotationPt.Meta (index, subst) ->
320 (function None -> None | Some term -> Some (aux loc context term))
323 Cic.Meta (index, cic_subst)
324 | CicNotationPt.Sort `Prop -> Cic.Sort Cic.Prop
325 | CicNotationPt.Sort `Set -> Cic.Sort Cic.Set
326 | CicNotationPt.Sort (`Type u) -> Cic.Sort (Cic.Type u)
327 | CicNotationPt.Sort `CProp -> Cic.Sort Cic.CProp
328 | CicNotationPt.Symbol (symbol, instance) ->
329 resolve env (Symbol (symbol, instance)) ()
330 | _ -> assert false (* god bless Bologna *)
331 and aux_option loc (context: Cic.name list) annotation = function
332 | None -> Cic.Implicit annotation
333 | Some term -> aux loc context term
336 | CicNotationPt.AttributedTerm (`Loc loc, term) -> aux loc context term
337 | term -> aux dummy_floc context term
339 let interpretate_path ~context path =
340 interpretate_term ~context ~env:Environment.empty ~uri:None ~is_path:true path
342 let interpretate_obj ~context ~env ~uri ~is_path obj =
343 assert (context = []);
344 assert (is_path = false);
346 | GrafiteAst.Inductive (params,tyl) ->
347 let uri = match uri with Some uri -> uri | None -> assert false in
351 (fun (context,res) (name,t) ->
352 Cic.Name name :: context,
353 (name, interpretate_term context env None false t)::res
356 context,List.rev res in
359 (fun (name,ty) t -> Cic.Prod (Cic.Name name,ty,t)) params in
363 (*here the explicit_named_substituion is assumed to be of length 0 *)
364 (fun (i,res) (name,_,_,_) ->
365 i + 1,(name,name,Cic.MutInd (uri,i,[]))::res
367 let con_env = DisambiguateTypes.env_of_list name_to_uris env in
371 (fun (name,_,_,_) (i,t) ->
372 (*here the explicit_named_substituion is assumed to be of length 0 *)
373 let t' = Cic.MutInd (uri,i,[]) in
374 let t = CicSubstitution.subst t' t in
376 ) tyl (List.length tyl - 1,t)) in
379 (fun (name,b,ty,cl) ->
380 let ty' = add_params (interpretate_term context env None false ty) in
385 add_params (interpretate_term context con_env None false ty)
393 Cic.InductiveDefinition (tyl,[],List.length params,[])
394 | GrafiteAst.Record (params,name,ty,fields) ->
395 let uri = match uri with Some uri -> uri | None -> assert false in
399 (fun (context,res) (name,t) ->
400 (Cic.Name name :: context),
401 (name, interpretate_term context env None false t)::res
404 context,List.rev res in
407 (fun (name,ty) t -> Cic.Prod (Cic.Name name,ty,t)) params in
408 let ty' = add_params (interpretate_term context env None false ty) in
412 (fun (context,res) (name,ty) ->
413 let context' = Cic.Name name :: context in
414 context',(name,interpretate_term context env None false ty)::res
415 ) (context,[]) fields) in
417 (*here the explicit_named_substituion is assumed to be of length 0 *)
418 let mutind = Cic.MutInd (uri,0,[]) in
419 if params = [] then mutind
422 (mutind::CicUtil.mk_rels (List.length params) (List.length fields)) in
425 (fun t (name,ty) -> Cic.Prod (Cic.Name name,ty,t))
427 let con' = add_params con in
428 let tyl = [name,true,ty',["mk_" ^ name,con']] in
429 let field_names = List.map fst fields in
430 Cic.InductiveDefinition
431 (tyl,[],List.length params,[`Class (`Record field_names)])
432 | GrafiteAst.Theorem (flavour, name, ty, bo) ->
433 let attrs = [`Flavour flavour] in
434 let ty' = interpretate_term [] env None false ty in
437 Cic.CurrentProof (name,[],Cic.Implicit None,ty',[],attrs)
439 let bo' = Some (interpretate_term [] env None false bo) in
440 Cic.Constant (name,bo',ty',[],attrs))
443 (* e.g. [5;1;1;1;2;3;4;1;2] -> [2;1;4;3;5] *)
445 let module SortedItem =
447 type t = DisambiguateTypes.domain_item
448 let compare = Pervasives.compare
451 let module Set = Set.Make (SortedItem) in
453 let rev_l = List.rev l in
454 let (_, uniq_rev_l) =
456 (fun (members, rev_l) elt ->
457 if Set.mem elt members then
460 Set.add elt members, elt :: rev_l)
461 (Set.empty, []) rev_l
465 (* "aux" keeps domain in reverse order and doesn't care about duplicates.
466 * Domain item more in deep in the list will be processed first.
468 let rec domain_rev_of_term ?(loc = dummy_floc) context = function
469 | CicNotationPt.AttributedTerm (`Loc loc, term) ->
470 domain_rev_of_term ~loc context term
471 | CicNotationPt.AttributedTerm (_, term) ->
472 domain_rev_of_term ~loc context term
473 | CicNotationPt.Appl terms ->
475 (fun dom term -> domain_rev_of_term ~loc context term @ dom) [] terms
476 | CicNotationPt.Binder (kind, (var, typ), body) ->
479 | `Exists -> [ Symbol ("exists", 0) ]
482 let type_dom = domain_rev_of_term_option loc context typ in
484 domain_rev_of_term ~loc
485 (CicNotationUtil.cic_name_of_name var :: context) body
487 body_dom @ type_dom @ kind_dom
488 | CicNotationPt.Case (term, indty_ident, outtype, branches) ->
489 let term_dom = domain_rev_of_term ~loc context term in
490 let outtype_dom = domain_rev_of_term_option loc context outtype in
491 let get_first_constructor = function
493 | ((head, _, _), _) :: _ -> [ Id head ]
495 let do_branch ((head, _, args), term) =
496 let (term_context, args_domain) =
498 (fun (cont, dom) (name, typ) ->
499 (CicNotationUtil.cic_name_of_name name :: cont,
502 | Some typ -> domain_rev_of_term ~loc cont typ @ dom)))
505 args_domain @ domain_rev_of_term ~loc term_context term
508 List.fold_left (fun dom branch -> do_branch branch @ dom) [] branches
510 branches_dom @ outtype_dom @ term_dom @
511 (match indty_ident with
512 | None -> get_first_constructor branches
513 | Some (ident, _) -> [ Id ident ])
514 | CicNotationPt.Cast (term, ty) ->
515 let term_dom = domain_rev_of_term ~loc context term in
516 let ty_dom = domain_rev_of_term ~loc context ty in
518 | CicNotationPt.LetIn ((var, typ), body, where) ->
519 let body_dom = domain_rev_of_term ~loc context body in
520 let type_dom = domain_rev_of_term_option loc context typ in
522 domain_rev_of_term ~loc
523 (CicNotationUtil.cic_name_of_name var :: context) where
525 where_dom @ type_dom @ body_dom
526 | CicNotationPt.LetRec (kind, defs, where) ->
529 (fun acc ((var, typ), _, _) ->
530 CicNotationUtil.cic_name_of_name var :: acc)
533 let where_dom = domain_rev_of_term ~loc context' where in
536 (fun dom ((_, typ), body, _) ->
537 domain_rev_of_term ~loc context' body @
538 domain_rev_of_term_option loc context typ)
542 | CicNotationPt.Ident (name, subst) ->
544 let index = find_in_context name context in
545 if subst <> None then
546 CicNotationPt.fail loc "Explicit substitutions not allowed here"
554 (fun dom (_, term) ->
555 let dom' = domain_rev_of_term ~loc context term in
558 | CicNotationPt.Uri _ -> []
559 | CicNotationPt.Implicit -> []
560 | CicNotationPt.Num (num, i) -> [ Num i ]
561 | CicNotationPt.Meta (index, local_context) ->
563 (fun dom term -> domain_rev_of_term_option loc context term @ dom) []
565 | CicNotationPt.Sort _ -> []
566 | CicNotationPt.Symbol (symbol, instance) -> [ Symbol (symbol, instance) ]
567 | CicNotationPt.UserInput
568 | CicNotationPt.Literal _
569 | CicNotationPt.Layout _
570 | CicNotationPt.Magic _
571 | CicNotationPt.Variable _ -> assert false
573 and domain_rev_of_term_option loc context = function
575 | Some t -> domain_rev_of_term ~loc context t
577 let domain_of_term ~context ast = rev_uniq (domain_rev_of_term context ast)
579 let domain_of_obj ~context ast =
580 assert (context = []);
583 | GrafiteAst.Theorem (_,_,ty,bo) ->
586 | Some bo -> domain_rev_of_term [] bo) @
588 | GrafiteAst.Inductive (params,tyl) ->
595 (fun (_,ty) -> domain_rev_of_term [] ty) cl) @
596 domain_rev_of_term [] ty) tyl) in
600 domain_rev_of_term [] ty @ dom
605 not ( List.exists (fun (name',_) -> name = Id name') params
606 || List.exists (fun (name',_,_,_) -> name = Id name') tyl)
608 | GrafiteAst.Record (params,_,ty,fields) ->
611 (List.rev_map (fun (_,ty) -> domain_rev_of_term [] ty) fields) in
615 not ( List.exists (fun (name',_) -> name = Id name') params
616 || List.exists (fun (name',_) -> name = Id name') fields)
621 domain_rev_of_term [] ty @ dom
622 ) (dom @ domain_rev_of_term [] ty) params
627 let domain_diff dom1 dom2 =
628 (* let domain_diff = Domain.diff *)
630 List.fold_left (fun pred elt -> (fun elt' -> elt' = elt || pred elt'))
631 (fun _ -> false) dom2
633 List.filter (fun elt -> not (is_in_dom2 elt)) dom1
635 module type Disambiguator =
637 val disambiguate_term :
638 ?fresh_instances:bool ->
640 context:Cic.context ->
641 metasenv:Cic.metasenv ->
642 ?initial_ugraph:CicUniv.universe_graph ->
643 aliases:DisambiguateTypes.environment ->(* previous interpretation status *)
644 universe:DisambiguateTypes.multiple_environment option ->
645 CicNotationPt.term ->
646 ((DisambiguateTypes.domain_item * DisambiguateTypes.codomain_item) list *
647 Cic.metasenv * (* new metasenv *)
649 CicUniv.universe_graph) list * (* disambiguated term *)
652 val disambiguate_obj :
653 ?fresh_instances:bool ->
655 aliases:DisambiguateTypes.environment ->(* previous interpretation status *)
656 universe:DisambiguateTypes.multiple_environment option ->
657 uri:UriManager.uri option -> (* required only for inductive types *)
659 ((DisambiguateTypes.domain_item * DisambiguateTypes.codomain_item) list *
660 Cic.metasenv * (* new metasenv *)
662 CicUniv.universe_graph) list * (* disambiguated obj *)
666 module Make (C: Callbacks) =
668 let choices_of_id dbd id =
669 let uris = MetadataQuery.locate ~dbd id in
673 [(C.input_or_locate_uri
674 ~title:("URI matching \"" ^ id ^ "\" unknown.") ~id ())]
677 C.interactive_user_uri_choice ~selection_mode:`MULTIPLE
678 ~ok:"Try selected." ~enable_button_for_non_vars:true
679 ~title:"Ambiguous input." ~id
680 ~msg: ("Ambiguous input \"" ^ id ^
681 "\". Please, choose one or more interpretations:")
686 (UriManager.string_of_uri uri,
689 CicUtil.term_of_uri uri
691 debug_print (lazy (UriManager.string_of_uri uri));
692 debug_print (lazy (Printexc.to_string exn));
698 let refine_profiler = HExtlib.profile "disambiguate_thing.refine_thing"
700 let disambiguate_thing ~dbd ~context ~metasenv
701 ?(initial_ugraph = CicUniv.empty_ugraph) ~aliases ~universe
702 ~uri ~pp_thing ~domain_of_thing ~interpretate_thing ~refine_thing thing
704 debug_print (lazy "DISAMBIGUATE INPUT");
705 let disambiguate_context = (* cic context -> disambiguate context *)
707 (function None -> Cic.Anonymous | Some (name, _) -> name)
710 debug_print (lazy ("TERM IS: " ^ (pp_thing thing)));
711 let thing_dom = domain_of_thing ~context:disambiguate_context thing in
712 debug_print (lazy (sprintf "DISAMBIGUATION DOMAIN: %s"
713 (string_of_domain thing_dom)));
715 debug_print (lazy (sprintf "DISAMBIGUATION ENVIRONMENT: %s"
716 (DisambiguatePp.pp_environment aliases)));
717 debug_print (lazy (sprintf "DISAMBIGUATION UNIVERSE: %s"
718 (match universe with None -> "None" | Some _ -> "Some _")));
721 Environment.fold (fun item _ dom -> item :: dom) aliases []
723 let todo_dom = domain_diff thing_dom current_dom in
724 (* (2) lookup function for any item (Id/Symbol/Num) *)
726 let id_choices = Hashtbl.create 1023 in
729 let lookup_in_library () =
731 | Id id -> choices_of_id dbd id
732 | Symbol (symb, _) ->
733 List.map DisambiguateChoices.mk_choice
734 (CicNotationRew.lookup_interpretations symb)
736 DisambiguateChoices.lookup_num_choices ()
739 | None -> lookup_in_library ()
742 Environment.find item e
743 with Not_found -> lookup_in_library ())
745 if choices = [] then raise (No_choices item);
751 if benchmark then begin
752 let per_item_choices =
756 let len = List.length (lookup_choices dom_item) in
757 debug_print (lazy (sprintf "BENCHMARK %s: %d"
758 (string_of_domain_item dom_item) len));
760 with No_choices _ -> 0)
763 max_refinements := List.fold_left ( * ) 1 per_item_choices;
764 actual_refinements := 0;
765 domain_size := List.length thing_dom;
767 (float_of_int !max_refinements) ** (1. /. float_of_int !domain_size)
773 (* (3) test an interpretation filling with meta uninterpreted identifiers
775 let test_env aliases todo_dom ugraph =
782 | Id _ | Num _ -> (fun _ _ _ -> Cic.Implicit (Some `Closed))
783 | Symbol _ -> (fun _ _ _ -> Cic.Implicit None))) env)
788 interpretate_thing ~context:disambiguate_context ~env:filled_env
789 ~uri ~is_path:false thing
792 let k,ugraph1 = refine_thing metasenv context uri cic_thing ugraph in
794 in refine_profiler.HExtlib.profile foo ()
796 | Try_again -> Uncertain, ugraph
797 | Invalid_choice -> Ko, ugraph
799 (* (4) build all possible interpretations *)
800 let rec aux aliases diff lookup_in_todo_dom todo_dom base_univ =
803 assert (lookup_in_todo_dom = None);
804 (match test_env aliases [] base_univ with
805 | Ok (thing, metasenv),new_univ ->
806 [ aliases, diff, metasenv, thing, new_univ ]
807 | Ko,_ | Uncertain,_ -> [])
808 | item :: remaining_dom ->
809 debug_print (lazy (sprintf "CHOOSED ITEM: %s"
810 (string_of_domain_item item)));
812 match lookup_in_todo_dom with
813 None -> lookup_choices item
814 | Some choices -> choices in
818 (* just one choice. We perform a one-step look-up and
819 if the next set of choices is also a singleton we
820 skip this refinement step *)
821 debug_print(lazy (sprintf "%s CHOSEN" (fst codomain_item)));
822 let new_env = Environment.add item codomain_item aliases in
823 let new_diff = (item,codomain_item)::diff in
824 let lookup_in_todo_dom,next_choice_is_single =
825 match remaining_dom with
828 let choices = lookup_choices he in
829 Some choices,List.length choices = 1
831 if next_choice_is_single then
832 aux new_env new_diff lookup_in_todo_dom remaining_dom
835 (match test_env new_env remaining_dom base_univ with
836 | Ok (thing, metasenv),new_univ ->
837 (match remaining_dom with
838 | [] -> [ new_env, new_diff, metasenv, thing, new_univ ]
840 aux new_env new_diff lookup_in_todo_dom
841 remaining_dom new_univ)
842 | Uncertain,new_univ ->
843 (match remaining_dom with
846 aux new_env new_diff lookup_in_todo_dom
847 remaining_dom new_univ)
850 let rec filter univ = function
852 | codomain_item :: tl ->
853 debug_print(lazy (sprintf "%s CHOSEN" (fst codomain_item)));
854 let new_env = Environment.add item codomain_item aliases in
855 let new_diff = (item,codomain_item)::diff in
856 (match test_env new_env remaining_dom univ with
857 | Ok (thing, metasenv),new_univ ->
858 (match remaining_dom with
859 | [] -> [ new_env, new_diff, metasenv, thing, new_univ ]
860 | _ -> aux new_env new_diff None remaining_dom new_univ
863 | Uncertain,new_univ ->
864 (match remaining_dom with
866 | _ -> aux new_env new_diff None remaining_dom new_univ
869 | Ko,_ -> filter univ tl)
871 filter base_univ choices
873 let base_univ = initial_ugraph in
876 match aux aliases [] None todo_dom base_univ with
877 | [] -> raise NoWellTypedInterpretation
878 | [_,diff,metasenv,t,ugraph] ->
879 debug_print (lazy "SINGLE INTERPRETATION");
880 [diff,metasenv,t,ugraph], false
882 debug_print (lazy (sprintf "MANY INTERPRETATIONS (%d)" (List.length l)));
885 (fun (env, _, _, _, _) ->
889 fst (Environment.find domain_item env)
891 (descr_of_domain_item domain_item, description))
895 let choosed = C.interactive_interpretation_choice choices in
896 (List.map (fun n->let _,d,m,t,u= List.nth l n in d,m,t,u) choosed),
901 CicEnvironment.CircularDependency s ->
902 failwith "Disambiguate: circular dependency"
904 let disambiguate_term ?(fresh_instances=false) ~dbd ~context ~metasenv
905 ?(initial_ugraph = CicUniv.empty_ugraph) ~aliases ~universe term
908 if fresh_instances then CicNotationUtil.freshen_term term else term
910 disambiguate_thing ~dbd ~context ~metasenv ~initial_ugraph ~aliases
911 ~universe ~uri:None ~pp_thing:CicNotationPp.pp_term
912 ~domain_of_thing:domain_of_term ~interpretate_thing:interpretate_term
913 ~refine_thing:refine_term term
915 let disambiguate_obj ?(fresh_instances=false) ~dbd ~aliases ~universe ~uri
919 if fresh_instances then CicNotationUtil.freshen_obj obj else obj
921 disambiguate_thing ~dbd ~context:[] ~metasenv:[] ~aliases ~universe ~uri
922 ~pp_thing:GrafiteAstPp.pp_obj ~domain_of_thing:domain_of_obj
923 ~interpretate_thing:interpretate_obj ~refine_thing:refine_obj
929 exception Ambiguous_term of string Lazy.t
933 let interactive_user_uri_choice ~selection_mode ?ok
934 ?(enable_button_for_non_vars = true) ~title ~msg ~id uris =
936 let interactive_interpretation_choice interp = raise Exit
937 let input_or_locate_uri ~(title:string) ?id = raise Exit
939 module Disambiguator = Make (Callbacks)
940 let disambiguate_string ~dbd ?(context = []) ?(metasenv = []) ?initial_ugraph
941 ?(aliases = DisambiguateTypes.Environment.empty) term
944 CicNotationParser.parse_level2_ast (Ulexing.from_utf8_string term)
947 fst (Disambiguator.disambiguate_term ~dbd ~context ~metasenv ast
948 ?initial_ugraph ~aliases ~universe:None)
949 with Exit -> raise (Ambiguous_term (lazy term))