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 Cic.LetIn (Cic.Name var, Cic.Fix (!counter, funs), cic))
219 List.map (fun (name, _, typ, body) -> (name, typ, body)) funs
221 (fun (var, _, _, _) cic ->
223 Cic.LetIn (Cic.Name var, Cic.CoFix (!counter, funs), cic))
225 List.fold_right (build_term inductiveFuns) inductiveFuns cic_body
226 | CicNotationPt.Ident _
227 | CicNotationPt.Uri _ when is_path -> raise PathNotWellFormed
228 | CicNotationPt.Ident (name, subst)
229 | CicNotationPt.Uri (name, subst) as ast ->
230 let is_uri = function CicNotationPt.Uri _ -> true | _ -> false in
232 if is_uri ast then raise Not_found;(* don't search the env for URIs *)
233 let index = find_in_context name context in
234 if subst <> None then
235 CicNotationPt.fail loc "Explicit substitutions not allowed here";
239 if is_uri ast then (* we have the URI, build the term out of it *)
241 CicUtil.term_of_uri (UriManager.uri_of_string name)
242 with UriManager.IllFormedUri _ ->
243 CicNotationPt.fail loc "Ill formed URI"
245 resolve env (Id name) ()
249 List.map (fun uri -> UriManager.name_of_uri uri, uri) uris
256 List.assoc s ids_to_uris, aux loc context term
258 raise Invalid_choice))
260 | None -> List.map (fun uri -> uri, Cic.Implicit None) uris)
264 | Cic.Const (uri, []) ->
265 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
266 let uris = CicUtil.params_of_obj o in
267 Cic.Const (uri, mk_subst uris)
268 | Cic.Var (uri, []) ->
269 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
270 let uris = CicUtil.params_of_obj o in
271 Cic.Var (uri, mk_subst uris)
272 | Cic.MutInd (uri, i, []) ->
274 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
275 let uris = CicUtil.params_of_obj o in
276 Cic.MutInd (uri, i, mk_subst uris)
278 CicEnvironment.Object_not_found _ ->
279 (* if we are here it is probably the case that during the
280 definition of a mutual inductive type we have met an
281 occurrence of the type in one of its constructors.
282 However, the inductive type is not yet in the environment
284 (*here the explicit_named_substituion is assumed to be of length 0 *)
285 Cic.MutInd (uri,i,[]))
286 | Cic.MutConstruct (uri, i, j, []) ->
287 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
288 let uris = CicUtil.params_of_obj o in
289 Cic.MutConstruct (uri, i, j, mk_subst uris)
290 | Cic.Meta _ | Cic.Implicit _ as t ->
292 debug_print (lazy (sprintf
293 "Warning: %s must be instantiated with _[%s] but we do not enforce it"
297 (fun (s, term) -> s ^ " := " ^ CicNotationPtPp.pp_term term)
304 CicEnvironment.CircularDependency _ ->
305 raise Invalid_choice))
306 | CicNotationPt.Implicit -> Cic.Implicit None
307 | CicNotationPt.UserInput -> Cic.Implicit (Some `Hole)
308 | CicNotationPt.Num (num, i) -> resolve env (Num i) ~num ()
309 | CicNotationPt.Meta (index, subst) ->
312 (function None -> None | Some term -> Some (aux loc context term))
315 Cic.Meta (index, cic_subst)
316 | CicNotationPt.Sort `Prop -> Cic.Sort Cic.Prop
317 | CicNotationPt.Sort `Set -> Cic.Sort Cic.Set
318 | CicNotationPt.Sort (`Type u) -> Cic.Sort (Cic.Type u)
319 | CicNotationPt.Sort `CProp -> Cic.Sort Cic.CProp
320 | CicNotationPt.Symbol (symbol, instance) ->
321 resolve env (Symbol (symbol, instance)) ()
322 | _ -> assert false (* god bless Bologna *)
323 and aux_option loc (context: Cic.name list) annotation = function
324 | None -> Cic.Implicit annotation
325 | Some term -> aux loc context term
328 | CicNotationPt.AttributedTerm (`Loc loc, term) -> aux loc context term
329 | term -> aux dummy_floc context term
331 let interpretate_path ~context path =
332 interpretate_term ~context ~env:Environment.empty ~uri:None ~is_path:true path
334 let interpretate_obj ~context ~env ~uri ~is_path obj =
335 assert (context = []);
336 assert (is_path = false);
338 | GrafiteAst.Inductive (params,tyl) ->
339 let uri = match uri with Some uri -> uri | None -> assert false in
343 (fun (context,res) (name,t) ->
344 Cic.Name name :: context,
345 (name, interpretate_term context env None false t)::res
348 context,List.rev res in
351 (fun (name,ty) t -> Cic.Prod (Cic.Name name,ty,t)) params in
355 (*here the explicit_named_substituion is assumed to be of length 0 *)
356 (fun (i,res) (name,_,_,_) ->
357 i + 1,(name,name,Cic.MutInd (uri,i,[]))::res
359 let con_env = DisambiguateTypes.env_of_list name_to_uris env in
363 (fun (name,_,_,_) (i,t) ->
364 (*here the explicit_named_substituion is assumed to be of length 0 *)
365 let t' = Cic.MutInd (uri,i,[]) in
366 let t = CicSubstitution.subst t' t in
368 ) tyl (List.length tyl - 1,t)) in
371 (fun (name,b,ty,cl) ->
372 let ty' = add_params (interpretate_term context env None false ty) in
377 add_params (interpretate_term context con_env None false ty)
385 Cic.InductiveDefinition (tyl,[],List.length params,[])
386 | GrafiteAst.Record (params,name,ty,fields) ->
387 let uri = match uri with Some uri -> uri | None -> assert false in
391 (fun (context,res) (name,t) ->
392 (Cic.Name name :: context),
393 (name, interpretate_term context env None false t)::res
396 context,List.rev res in
399 (fun (name,ty) t -> Cic.Prod (Cic.Name name,ty,t)) params in
400 let ty' = add_params (interpretate_term context env None false ty) in
404 (fun (context,res) (name,ty) ->
405 let context' = Cic.Name name :: context in
406 context',(name,interpretate_term context env None false ty)::res
407 ) (context,[]) fields) in
409 (*here the explicit_named_substituion is assumed to be of length 0 *)
410 let mutind = Cic.MutInd (uri,0,[]) in
411 if params = [] then mutind
414 (mutind::CicUtil.mk_rels (List.length params) (List.length fields)) in
417 (fun t (name,ty) -> Cic.Prod (Cic.Name name,ty,t))
419 let con' = add_params con in
420 let tyl = [name,true,ty',["mk_" ^ name,con']] in
421 let field_names = List.map fst fields in
422 Cic.InductiveDefinition
423 (tyl,[],List.length params,[`Class (`Record field_names)])
424 | GrafiteAst.Theorem (flavour, name, ty, bo) ->
425 let attrs = [`Flavour flavour] in
426 let ty' = interpretate_term [] env None false ty in
429 Cic.CurrentProof (name,[],Cic.Implicit None,ty',[],attrs)
431 let bo' = Some (interpretate_term [] env None false bo) in
432 Cic.Constant (name,bo',ty',[],attrs))
435 (* e.g. [5;1;1;1;2;3;4;1;2] -> [2;1;4;3;5] *)
437 let module SortedItem =
439 type t = DisambiguateTypes.domain_item
440 let compare = Pervasives.compare
443 let module Set = Set.Make (SortedItem) in
445 let rev_l = List.rev l in
446 let (_, uniq_rev_l) =
448 (fun (members, rev_l) elt ->
449 if Set.mem elt members then
452 Set.add elt members, elt :: rev_l)
453 (Set.empty, []) rev_l
457 (* "aux" keeps domain in reverse order and doesn't care about duplicates.
458 * Domain item more in deep in the list will be processed first.
460 let rec domain_rev_of_term ?(loc = dummy_floc) context = function
461 | CicNotationPt.AttributedTerm (`Loc loc, term) ->
462 domain_rev_of_term ~loc context term
463 | CicNotationPt.AttributedTerm (_, term) ->
464 domain_rev_of_term ~loc context term
465 | CicNotationPt.Appl terms ->
467 (fun dom term -> domain_rev_of_term ~loc context term @ dom) [] terms
468 | CicNotationPt.Binder (kind, (var, typ), body) ->
471 | `Exists -> [ Symbol ("exists", 0) ]
474 let type_dom = domain_rev_of_term_option loc context typ in
476 domain_rev_of_term ~loc
477 (CicNotationUtil.cic_name_of_name var :: context) body
479 body_dom @ type_dom @ kind_dom
480 | CicNotationPt.Case (term, indty_ident, outtype, branches) ->
481 let term_dom = domain_rev_of_term ~loc context term in
482 let outtype_dom = domain_rev_of_term_option loc context outtype in
483 let get_first_constructor = function
485 | ((head, _, _), _) :: _ -> [ Id head ]
487 let do_branch ((head, _, args), term) =
488 let (term_context, args_domain) =
490 (fun (cont, dom) (name, typ) ->
491 (CicNotationUtil.cic_name_of_name name :: cont,
494 | Some typ -> domain_rev_of_term ~loc cont typ @ dom)))
497 args_domain @ domain_rev_of_term ~loc term_context term
500 List.fold_left (fun dom branch -> do_branch branch @ dom) [] branches
502 branches_dom @ outtype_dom @ term_dom @
503 (match indty_ident with
504 | None -> get_first_constructor branches
505 | Some (ident, _) -> [ Id ident ])
506 | CicNotationPt.Cast (term, ty) ->
507 let term_dom = domain_rev_of_term ~loc context term in
508 let ty_dom = domain_rev_of_term ~loc context ty in
510 | CicNotationPt.LetIn ((var, typ), body, where) ->
511 let body_dom = domain_rev_of_term ~loc context body in
512 let type_dom = domain_rev_of_term_option loc context typ in
514 domain_rev_of_term ~loc
515 (CicNotationUtil.cic_name_of_name var :: context) where
517 where_dom @ type_dom @ body_dom
518 | CicNotationPt.LetRec (kind, defs, where) ->
521 (fun acc ((var, typ), _, _) ->
522 CicNotationUtil.cic_name_of_name var :: acc)
525 let where_dom = domain_rev_of_term ~loc context' where in
528 (fun dom ((_, typ), body, _) ->
529 domain_rev_of_term ~loc context' body @
530 domain_rev_of_term_option loc context typ)
534 | CicNotationPt.Ident (name, subst) ->
536 let index = find_in_context name context in
537 if subst <> None then
538 CicNotationPt.fail loc "Explicit substitutions not allowed here"
546 (fun dom (_, term) ->
547 let dom' = domain_rev_of_term ~loc context term in
550 | CicNotationPt.Uri _ -> []
551 | CicNotationPt.Implicit -> []
552 | CicNotationPt.Num (num, i) -> [ Num i ]
553 | CicNotationPt.Meta (index, local_context) ->
555 (fun dom term -> domain_rev_of_term_option loc context term @ dom) []
557 | CicNotationPt.Sort _ -> []
558 | CicNotationPt.Symbol (symbol, instance) -> [ Symbol (symbol, instance) ]
559 | CicNotationPt.UserInput
560 | CicNotationPt.Literal _
561 | CicNotationPt.Layout _
562 | CicNotationPt.Magic _
563 | CicNotationPt.Variable _ -> assert false
565 and domain_rev_of_term_option loc context = function
567 | Some t -> domain_rev_of_term ~loc context t
569 let domain_of_term ~context ast = rev_uniq (domain_rev_of_term context ast)
571 let domain_of_obj ~context ast =
572 assert (context = []);
575 | GrafiteAst.Theorem (_,_,ty,bo) ->
578 | Some bo -> domain_rev_of_term [] bo) @
580 | GrafiteAst.Inductive (params,tyl) ->
587 (fun (_,ty) -> domain_rev_of_term [] ty) cl) @
588 domain_rev_of_term [] ty) tyl) in
592 domain_rev_of_term [] ty @ dom
597 not ( List.exists (fun (name',_) -> name = Id name') params
598 || List.exists (fun (name',_,_,_) -> name = Id name') tyl)
600 | GrafiteAst.Record (params,_,ty,fields) ->
603 (List.rev_map (fun (_,ty) -> domain_rev_of_term [] ty) fields) in
607 not ( List.exists (fun (name',_) -> name = Id name') params
608 || List.exists (fun (name',_) -> name = Id name') fields)
613 domain_rev_of_term [] ty @ dom
614 ) (dom @ domain_rev_of_term [] ty) params
619 let domain_diff dom1 dom2 =
620 (* let domain_diff = Domain.diff *)
622 List.fold_left (fun pred elt -> (fun elt' -> elt' = elt || pred elt'))
623 (fun _ -> false) dom2
625 List.filter (fun elt -> not (is_in_dom2 elt)) dom1
627 module type Disambiguator =
629 val disambiguate_term :
630 ?fresh_instances:bool ->
632 context:Cic.context ->
633 metasenv:Cic.metasenv ->
634 ?initial_ugraph:CicUniv.universe_graph ->
635 aliases:DisambiguateTypes.environment ->(* previous interpretation status *)
636 universe:DisambiguateTypes.multiple_environment option ->
637 CicNotationPt.term ->
638 ((DisambiguateTypes.domain_item * DisambiguateTypes.codomain_item) list *
639 Cic.metasenv * (* new metasenv *)
641 CicUniv.universe_graph) list * (* disambiguated term *)
644 val disambiguate_obj :
645 ?fresh_instances:bool ->
647 aliases:DisambiguateTypes.environment ->(* previous interpretation status *)
648 universe:DisambiguateTypes.multiple_environment option ->
649 uri:UriManager.uri option -> (* required only for inductive types *)
651 ((DisambiguateTypes.domain_item * DisambiguateTypes.codomain_item) list *
652 Cic.metasenv * (* new metasenv *)
654 CicUniv.universe_graph) list * (* disambiguated obj *)
658 module Make (C: Callbacks) =
660 let choices_of_id dbd id =
661 let uris = MetadataQuery.locate ~dbd id in
665 [(C.input_or_locate_uri
666 ~title:("URI matching \"" ^ id ^ "\" unknown.") ~id ())]
669 C.interactive_user_uri_choice ~selection_mode:`MULTIPLE
670 ~ok:"Try selected." ~enable_button_for_non_vars:true
671 ~title:"Ambiguous input." ~id
672 ~msg: ("Ambiguous input \"" ^ id ^
673 "\". Please, choose one or more interpretations:")
678 (UriManager.string_of_uri uri,
681 CicUtil.term_of_uri uri
683 debug_print (lazy (UriManager.string_of_uri uri));
684 debug_print (lazy (Printexc.to_string exn));
690 let refine_profiler = HExtlib.profile "disambiguate_thing.refine_thing"
692 let disambiguate_thing ~dbd ~context ~metasenv
693 ?(initial_ugraph = CicUniv.empty_ugraph) ~aliases ~universe
694 ~uri ~pp_thing ~domain_of_thing ~interpretate_thing ~refine_thing thing
696 debug_print (lazy "DISAMBIGUATE INPUT");
697 let disambiguate_context = (* cic context -> disambiguate context *)
699 (function None -> Cic.Anonymous | Some (name, _) -> name)
702 debug_print (lazy ("TERM IS: " ^ (pp_thing thing)));
703 let thing_dom = domain_of_thing ~context:disambiguate_context thing in
704 debug_print (lazy (sprintf "DISAMBIGUATION DOMAIN: %s"
705 (string_of_domain thing_dom)));
707 debug_print (lazy (sprintf "DISAMBIGUATION ENVIRONMENT: %s"
708 (DisambiguatePp.pp_environment aliases)));
709 debug_print (lazy (sprintf "DISAMBIGUATION UNIVERSE: %s"
710 (match universe with None -> "None" | Some _ -> "Some _")));
713 Environment.fold (fun item _ dom -> item :: dom) aliases []
715 let todo_dom = domain_diff thing_dom current_dom in
716 (* (2) lookup function for any item (Id/Symbol/Num) *)
718 let id_choices = Hashtbl.create 1023 in
721 let lookup_in_library () =
723 | Id id -> choices_of_id dbd id
724 | Symbol (symb, _) ->
725 List.map DisambiguateChoices.mk_choice
726 (CicNotationRew.lookup_interpretations symb)
728 DisambiguateChoices.lookup_num_choices ()
731 | None -> lookup_in_library ()
734 Environment.find item e
735 with Not_found -> lookup_in_library ())
737 if choices = [] then raise (No_choices item);
743 if benchmark then begin
744 let per_item_choices =
748 let len = List.length (lookup_choices dom_item) in
749 debug_print (lazy (sprintf "BENCHMARK %s: %d"
750 (string_of_domain_item dom_item) len));
752 with No_choices _ -> 0)
755 max_refinements := List.fold_left ( * ) 1 per_item_choices;
756 actual_refinements := 0;
757 domain_size := List.length thing_dom;
759 (float_of_int !max_refinements) ** (1. /. float_of_int !domain_size)
765 (* (3) test an interpretation filling with meta uninterpreted identifiers
767 let test_env aliases todo_dom ugraph =
774 | Id _ | Num _ -> (fun _ _ _ -> Cic.Implicit (Some `Closed))
775 | Symbol _ -> (fun _ _ _ -> Cic.Implicit None))) env)
780 interpretate_thing ~context:disambiguate_context ~env:filled_env
781 ~uri ~is_path:false thing
784 let k,ugraph1 = refine_thing metasenv context uri cic_thing ugraph in
786 in refine_profiler.HExtlib.profile foo ()
788 | Try_again -> Uncertain, ugraph
789 | Invalid_choice -> Ko, ugraph
791 (* (4) build all possible interpretations *)
792 let rec aux aliases diff lookup_in_todo_dom todo_dom base_univ =
795 assert (lookup_in_todo_dom = None);
796 (match test_env aliases [] base_univ with
797 | Ok (thing, metasenv),new_univ ->
798 [ aliases, diff, metasenv, thing, new_univ ]
799 | Ko,_ | Uncertain,_ -> [])
800 | item :: remaining_dom ->
801 debug_print (lazy (sprintf "CHOOSED ITEM: %s"
802 (string_of_domain_item item)));
804 match lookup_in_todo_dom with
805 None -> lookup_choices item
806 | Some choices -> choices in
810 (* just one choice. We perform a one-step look-up and
811 if the next set of choices is also a singleton we
812 skip this refinement step *)
813 debug_print(lazy (sprintf "%s CHOSEN" (fst codomain_item)));
814 let new_env = Environment.add item codomain_item aliases in
815 let new_diff = (item,codomain_item)::diff in
816 let lookup_in_todo_dom,next_choice_is_single =
817 match remaining_dom with
820 let choices = lookup_choices he in
821 Some choices,List.length choices = 1
823 if next_choice_is_single then
824 aux new_env new_diff lookup_in_todo_dom remaining_dom
827 (match test_env new_env remaining_dom base_univ with
828 | Ok (thing, metasenv),new_univ ->
829 (match remaining_dom with
830 | [] -> [ new_env, new_diff, metasenv, thing, new_univ ]
832 aux new_env new_diff lookup_in_todo_dom
833 remaining_dom new_univ)
834 | Uncertain,new_univ ->
835 (match remaining_dom with
838 aux new_env new_diff lookup_in_todo_dom
839 remaining_dom new_univ)
842 let rec filter univ = function
844 | codomain_item :: tl ->
845 debug_print(lazy (sprintf "%s CHOSEN" (fst codomain_item)));
846 let new_env = Environment.add item codomain_item aliases in
847 let new_diff = (item,codomain_item)::diff in
848 (match test_env new_env remaining_dom univ with
849 | Ok (thing, metasenv),new_univ ->
850 (match remaining_dom with
851 | [] -> [ new_env, new_diff, metasenv, thing, new_univ ]
852 | _ -> aux new_env new_diff None remaining_dom new_univ
855 | Uncertain,new_univ ->
856 (match remaining_dom with
858 | _ -> aux new_env new_diff None remaining_dom new_univ
861 | Ko,_ -> filter univ tl)
863 filter base_univ choices
865 let base_univ = initial_ugraph in
868 match aux aliases [] None todo_dom base_univ with
869 | [] -> raise NoWellTypedInterpretation
870 | [_,diff,metasenv,t,ugraph] ->
871 debug_print (lazy "SINGLE INTERPRETATION");
872 [diff,metasenv,t,ugraph], false
874 debug_print (lazy (sprintf "MANY INTERPRETATIONS (%d)" (List.length l)));
877 (fun (env, _, _, _, _) ->
881 fst (Environment.find domain_item env)
883 (descr_of_domain_item domain_item, description))
887 let choosed = C.interactive_interpretation_choice choices in
888 (List.map (fun n->let _,d,m,t,u= List.nth l n in d,m,t,u) choosed),
893 CicEnvironment.CircularDependency s ->
894 failwith "Disambiguate: circular dependency"
896 let disambiguate_term ?(fresh_instances=false) ~dbd ~context ~metasenv
897 ?(initial_ugraph = CicUniv.empty_ugraph) ~aliases ~universe term
900 if fresh_instances then CicNotationUtil.freshen_term term else term
902 disambiguate_thing ~dbd ~context ~metasenv ~initial_ugraph ~aliases
903 ~universe ~uri:None ~pp_thing:CicNotationPp.pp_term
904 ~domain_of_thing:domain_of_term ~interpretate_thing:interpretate_term
905 ~refine_thing:refine_term term
907 let disambiguate_obj ?(fresh_instances=false) ~dbd ~aliases ~universe ~uri
911 if fresh_instances then CicNotationUtil.freshen_obj obj else obj
913 disambiguate_thing ~dbd ~context:[] ~metasenv:[] ~aliases ~universe ~uri
914 ~pp_thing:GrafiteAstPp.pp_obj ~domain_of_thing:domain_of_obj
915 ~interpretate_thing:interpretate_obj ~refine_thing:refine_obj
921 exception Ambiguous_term of string Lazy.t
925 let interactive_user_uri_choice ~selection_mode ?ok
926 ?(enable_button_for_non_vars = true) ~title ~msg ~id uris =
928 let interactive_interpretation_choice interp = raise Exit
929 let input_or_locate_uri ~(title:string) ?id = raise Exit
931 module Disambiguator = Make (Callbacks)
932 let disambiguate_string ~dbd ?(context = []) ?(metasenv = []) ?initial_ugraph
933 ?(aliases = DisambiguateTypes.Environment.empty) term
936 CicNotationParser.parse_level2_ast (Ulexing.from_utf8_string term)
939 fst (Disambiguator.disambiguate_term ~dbd ~context ~metasenv ast
940 ?initial_ugraph ~aliases ~universe:None)
941 with Exit -> raise (Ambiguous_term (lazy term))