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
41 (** print benchmark information *)
43 let max_refinements = ref 0 (* benchmarking is not thread safe *)
44 let actual_refinements = ref 0
45 let domain_size = ref 0
46 let choices_avg = ref 0.
49 let descr_of_domain_item = function
52 | Num i -> string_of_int i
55 | Ok of Cic.term * Cic.metasenv
59 let refine metasenv context term ugraph =
60 (* if benchmark then incr actual_refinements; *)
62 CicMkImplicit.expand_implicits metasenv [] context term in
63 debug_print (sprintf "TEST_INTERPRETATION: %s" (CicPp.ppterm term));
65 let term', _, metasenv',ugraph1 =
66 CicRefine.type_of_aux' metasenv context term ugraph in
67 (Ok (term', metasenv')),ugraph1
69 | CicRefine.Uncertain _ ->
70 debug_print ("%%% UNCERTAIN!!! " ^ CicPp.ppterm term) ;
72 | CicRefine.RefineFailure _ ->
73 debug_print ("%%% PRUNED!!! " ^ CicPp.ppterm term) ;
75 | CicUnification.UnificationFailure s ->
76 prerr_endline ("PASSADI QUI: " ^ s);
77 raise ( CicUnification.UnificationFailure s )
79 let resolve (env: environment) (item: domain_item) ?(num = "") ?(args = []) () =
81 snd (Environment.find item env) env num args
82 with Not_found -> assert false
84 (* TODO move it to Cic *)
85 let find_in_environment name context =
86 let rec aux acc = function
87 | [] -> raise Not_found
88 | Cic.Name hd :: tl when hd = name -> acc
89 | _ :: tl -> aux (acc + 1) tl
93 let interpretate ~context ~env ast =
94 let rec aux loc context = function
95 | CicAst.AttributedTerm (`Loc loc, term) ->
97 | CicAst.AttributedTerm (_, term) -> aux loc context term
98 | CicAst.Appl (CicAst.Symbol (symb, i) :: args) ->
99 let cic_args = List.map (aux loc context) args in
100 resolve env (Symbol (symb, i)) ~args:cic_args ()
101 | CicAst.Appl terms -> Cic.Appl (List.map (aux loc context) terms)
102 | CicAst.Binder (binder_kind, (var, typ), body) ->
103 let cic_type = aux_option loc context typ in
104 let cic_body = aux loc (var :: context) body in
105 (match binder_kind with
106 | `Lambda -> Cic.Lambda (var, cic_type, cic_body)
107 | `Pi | `Forall -> Cic.Prod (var, cic_type, cic_body)
109 resolve env (Symbol ("exists", 0))
110 ~args:[ cic_type; Cic.Lambda (var, cic_type, cic_body) ] ())
111 | CicAst.Case (term, indty_ident, outtype, branches) ->
112 let cic_term = aux loc context term in
113 let cic_outtype = aux_option loc context outtype in
114 let do_branch ((head, args), term) =
115 let rec do_branch' context = function
116 | [] -> aux loc context term
117 | (name, typ) :: tl ->
118 let cic_body = do_branch' (name :: context) tl in
121 | None -> Cic.Implicit (Some `Type)
122 | Some typ -> aux loc context typ
124 Cic.Lambda (name, typ, cic_body)
126 do_branch' context args
128 let (indtype_uri, indtype_no) =
129 match indty_ident with
130 | Some indty_ident ->
131 (match resolve env (Id indty_ident) () with
132 | Cic.MutInd (uri, tyno, _) -> (uri, tyno)
133 | Cic.Implicit _ -> raise Try_again
134 | _ -> raise DisambiguateChoices.Invalid_choice)
136 let fst_constructor =
138 | ((head, _), _) :: _ -> head
139 | [] -> raise DisambiguateChoices.Invalid_choice
141 (match resolve env (Id fst_constructor) () with
142 | Cic.MutConstruct (indtype_uri, indtype_no, _, _) ->
143 (indtype_uri, indtype_no)
144 | Cic.Implicit _ -> raise Try_again
145 | _ -> raise DisambiguateChoices.Invalid_choice)
147 Cic.MutCase (indtype_uri, indtype_no, cic_outtype, cic_term,
148 (List.map do_branch branches))
149 | CicAst.LetIn ((name, typ), def, body) ->
150 let cic_def = aux loc context def in
154 | Some t -> Cic.Cast (cic_def, aux loc context t)
156 let cic_body = aux loc (name :: context) body in
157 Cic.LetIn (name, cic_def, cic_body)
158 | CicAst.LetRec (kind, defs, body) ->
160 List.fold_left (fun acc ((name, _), _, _) -> name :: acc)
163 let cic_body = aux loc context' body in
166 (fun ((name, typ), body, decr_idx) ->
167 let cic_body = aux loc context' body in
168 let cic_type = aux_option loc context typ in
172 CicTextualParser2.fail loc
173 "Recursive functions cannot be anonymous"
174 | Cic.Name name -> name
176 (name, decr_idx, cic_type, cic_body))
179 let counter = ref ~-1 in
180 let build_term funs =
181 (* this is the body of the fold_right function below. Rationale: Fix
182 * and CoFix cases differs only in an additional index in the
183 * inductiveFun list, see Cic.term *)
186 (fun (var, _, _, _) cic ->
188 Cic.LetIn (Cic.Name var, Cic.Fix (!counter, funs), cic))
191 List.map (fun (name, _, typ, body) -> (name, typ, body)) funs
193 (fun (var, _, _, _) cic ->
195 Cic.LetIn (Cic.Name var, Cic.CoFix (!counter, funs), cic))
197 List.fold_right (build_term inductiveFuns) inductiveFuns cic_body
198 | CicAst.Ident (name, subst)
199 | CicAst.Uri (name, subst) as ast ->
200 let is_uri = function CicAst.Uri _ -> true | _ -> false in
202 if is_uri ast then raise Not_found;(* don't search the env for URIs *)
203 let index = find_in_environment name context in
204 if subst <> None then
205 CicTextualParser2.fail loc
206 "Explicit substitutions not allowed here";
210 if is_uri ast then (* we have the URI, build the term out of it *)
212 CicUtil.term_of_uri name
213 with UriManager.IllFormedUri _ ->
214 CicTextualParser2.fail loc "Ill formed URI"
216 resolve env (Id name) ()
220 List.map (fun uri -> UriManager.name_of_uri uri, uri) uris
227 List.assoc s ids_to_uris, aux loc context term
229 raise DisambiguateChoices.Invalid_choice))
231 | None -> List.map (fun uri -> uri, Cic.Implicit None) uris)
233 (* the try is for CicTypeChecker.typecheck *)
236 | Cic.Const (uri, []) ->
238 let o,_ = CicEnvironment.get_obj uri CicUniv.empty_ugraph in
240 (*match CicTypeChecker.typecheck uri with*)
241 | Cic.Constant (_, _, _, uris) -> uris
244 Cic.Const (uri, mk_subst uris)
245 | Cic.Var (uri, []) ->
247 let o,_ = CicEnvironment.get_obj uri CicUniv.empty_ugraph in
249 (*match CicTypeChecker.typecheck uri with*)
250 | Cic.Variable (_, _, _, uris) -> uris
253 Cic.Var (uri, mk_subst uris)
254 | Cic.MutInd (uri, i, []) ->
256 let o,_ = CicEnvironment.get_obj uri CicUniv.empty_ugraph in
258 (*match CicTypeChecker.typecheck uri with*)
259 | Cic.InductiveDefinition (_, uris, _) -> uris
262 Cic.MutInd (uri, i, mk_subst uris)
263 | Cic.MutConstruct (uri, i, j, []) ->
265 let o,_ = CicEnvironment.get_obj uri CicUniv.empty_ugraph in
267 (*match CicTypeChecker.typecheck uri with*)
268 | Cic.InductiveDefinition (_, uris, _) -> uris
271 Cic.MutConstruct (uri, i, j, mk_subst uris)
272 | Cic.Meta _ | Cic.Implicit _ as t ->
274 prerr_endline (sprintf
275 "Warning: %s must be instantiated with _[%s] but we do not enforce it"
279 (fun (s, term) -> s ^ " := " ^ CicAstPp.pp_term term)
284 raise DisambiguateChoices.Invalid_choice
286 CicEnvironment.CircularDependency _ ->
287 raise DisambiguateChoices.Invalid_choice))
288 | CicAst.Implicit -> Cic.Implicit None
289 | CicAst.Num (num, i) -> resolve env (Num i) ~num ()
290 | CicAst.Meta (index, subst) ->
293 (function None -> None | Some term -> Some (aux loc context term))
296 Cic.Meta (index, cic_subst)
297 | CicAst.Sort `Prop -> Cic.Sort Cic.Prop
298 | CicAst.Sort `Set -> Cic.Sort Cic.Set
299 | CicAst.Sort `Type -> Cic.Sort (Cic.Type (CicUniv.fresh())) (* TASSI *)
300 | CicAst.Sort `CProp -> Cic.Sort Cic.CProp
301 | CicAst.Symbol (symbol, instance) ->
302 resolve env (Symbol (symbol, instance)) ()
303 | CicAst.UserInput -> assert false
304 and aux_option loc context = function
305 | None -> Cic.Implicit (Some `Type)
306 | Some term -> aux loc context term
309 | CicAst.AttributedTerm (`Loc loc, term) -> aux loc context term
310 | term -> aux CicAst.dummy_floc context term
312 let domain_of_term ~context ast =
313 (* "aux" keeps domain in reverse order and doesn't care about duplicates.
314 * Domain item more in deep in the list will be processed first.
316 let rec aux loc context = function
317 | CicAst.AttributedTerm (`Loc loc, term) -> aux loc context term
318 | CicAst.AttributedTerm (_, term) -> aux loc context term
319 | CicAst.Appl terms ->
320 List.fold_left (fun dom term -> aux loc context term @ dom) [] terms
321 | CicAst.Binder (kind, (var, typ), body) ->
324 | `Exists -> [ Symbol ("exists", 0) ]
327 let type_dom = aux_option loc context typ in
328 let body_dom = aux loc (var :: context) body in
329 body_dom @ type_dom @ kind_dom
330 | CicAst.Case (term, indty_ident, outtype, branches) ->
331 let term_dom = aux loc context term in
332 let outtype_dom = aux_option loc context outtype in
333 let do_branch ((head, args), term) =
334 let (term_context, args_domain) =
336 (fun (cont, dom) (name, typ) ->
340 | Some typ -> aux loc cont typ @ dom)))
343 args_domain @ aux loc term_context term
346 List.fold_left (fun dom branch -> do_branch branch @ dom) [] branches
348 branches_dom @ outtype_dom @ term_dom @
349 (match indty_ident with None -> [] | Some ident -> [ Id ident ])
350 | CicAst.LetIn ((var, typ), body, where) ->
351 let body_dom = aux loc context body in
352 let type_dom = aux_option loc context typ in
353 let where_dom = aux loc (var :: context) where in
354 where_dom @ type_dom @ body_dom
355 | CicAst.LetRec (kind, defs, where) ->
357 List.fold_left (fun acc ((var, typ), _, _) -> var :: acc)
360 let where_dom = aux loc context' where in
363 (fun dom ((_, typ), body, _) ->
364 aux loc context' body @ aux_option loc context typ)
368 | CicAst.Ident (name, subst) ->
370 let index = find_in_environment name context in
371 if subst <> None then
372 CicTextualParser2.fail loc
373 "Explicit substitutions not allowed here"
381 (fun dom (_, term) ->
382 let dom' = aux loc context term in
386 | CicAst.Implicit -> []
387 | CicAst.Num (num, i) -> [ Num i ]
388 | CicAst.Meta (index, local_context) ->
389 List.fold_left (fun dom term -> aux_option loc context term @ dom) []
391 | CicAst.Sort _ -> []
392 | CicAst.Symbol (symbol, instance) -> [ Symbol (symbol, instance) ]
393 | CicAst.UserInput -> assert false
395 and aux_option loc context = function
397 | Some t -> aux loc context t
400 (* e.g. [5;1;1;1;2;3;4;1;2] -> [2;1;4;3;5] *)
402 let module SortedItem =
404 type t = DisambiguateTypes.domain_item
405 let compare = Pervasives.compare
408 let module Set = Set.Make (SortedItem) in
410 let rev_l = List.rev l in
411 let (_, uniq_rev_l) =
413 (fun (members, rev_l) elt ->
414 if Set.mem elt members then
417 Set.add elt members, elt :: rev_l)
418 (Set.empty, []) rev_l
425 | CicAst.AttributedTerm (`Loc loc, term) -> aux loc context term
426 | term -> aux CicAst.dummy_floc context term)
430 let domain_diff dom1 dom2 =
431 (* let domain_diff = Domain.diff *)
433 List.fold_left (fun pred elt -> (fun elt' -> elt' = elt || pred elt'))
434 (fun _ -> false) dom2
436 List.filter (fun elt -> not (is_in_dom2 elt)) dom1
438 module Make (C: Callbacks) =
440 let choices_of_id dbd id =
441 let uris = MetadataQuery.locate ~dbd id in
445 [UriManager.string_of_uri (C.input_or_locate_uri
446 ~title:("URI matching \"" ^ id ^ "\" unknown.") ~id ())]
449 C.interactive_user_uri_choice ~selection_mode:`MULTIPLE
450 ~ok:"Try selected." ~enable_button_for_non_vars:true
451 ~title:"Ambiguous input." ~id
452 ~msg: ("Ambiguous input \"" ^ id ^
453 "\". Please, choose one or more interpretations:")
461 CicUtil.term_of_uri uri
464 prerr_endline (Printexc.to_string exn);
470 let disambiguate_term ~(dbd:Mysql.dbd) context metasenv term
471 ?(initial_ugraph = CicUniv.empty_ugraph) ~aliases:current_env
473 debug_print "NEW DISAMBIGUATE INPUT";
474 let disambiguate_context = (* cic context -> disambiguate context *)
476 (function None -> Cic.Anonymous | Some (name, _) -> name)
479 let term_dom = domain_of_term ~context:disambiguate_context term in
480 debug_print (sprintf "DISAMBIGUATION DOMAIN: %s"
481 (string_of_domain term_dom));
483 Environment.fold (fun item _ dom -> item :: dom) current_env []
485 let todo_dom = domain_diff term_dom current_dom in
486 (* (2) lookup function for any item (Id/Symbol/Num) *)
488 let id_choices = Hashtbl.create 1023 in
494 Hashtbl.find id_choices id
496 let choices = choices_of_id dbd id in
497 Hashtbl.add id_choices id choices;
499 | Symbol (symb, _) -> DisambiguateChoices.lookup_symbol_choices symb
500 | Num instance -> DisambiguateChoices.lookup_num_choices ()
502 if choices = [] then raise (No_choices item);
509 if benchmark then begin
510 let per_item_choices =
514 let len = List.length (lookup_choices dom_item) in
515 prerr_endline (sprintf "BENCHMARK %s: %d"
516 (string_of_domain_item dom_item) len);
518 with No_choices _ -> 0)
521 max_refinements := List.fold_left ( * ) 1 per_item_choices;
522 actual_refinements := 0;
523 domain_size := List.length term_dom;
525 (float_of_int !max_refinements) ** (1. /. float_of_int !domain_size)
531 (* (3) test an interpretation filling with meta uninterpreted identifiers
533 let test_env current_env todo_dom ugraph =
540 | Id _ | Num _ -> (fun _ _ _ -> Cic.Implicit (Some `Closed))
541 | Symbol _ -> (fun _ _ _ -> Cic.Implicit None))) env)
546 interpretate ~context:disambiguate_context ~env:filled_env term
548 let k,ugraph1 = refine metasenv context cic_term ugraph in
551 | Try_again -> Uncertain,ugraph
552 | DisambiguateChoices.Invalid_choice -> Ko,ugraph
554 (* (4) build all possible interpretations *)
555 let rec aux current_env todo_dom base_univ =
558 (match test_env current_env [] base_univ with
559 | Ok (term, metasenv),new_univ ->
560 [ current_env, metasenv, term, new_univ ]
561 | Ko,_ | Uncertain,_ -> [])
562 | item :: remaining_dom ->
563 debug_print (sprintf "CHOOSED ITEM: %s"
564 (string_of_domain_item item));
565 let choices = lookup_choices item in
566 let rec filter univ = function
568 | codomain_item :: tl ->
569 debug_print (sprintf "%s CHOSEN" (fst codomain_item)) ;
571 Environment.add item codomain_item current_env
573 (match test_env new_env remaining_dom univ with
574 | Ok (term, metasenv),new_univ ->
575 (match remaining_dom with
576 | [] -> [ new_env, metasenv, term, new_univ ]
577 | _ -> aux new_env remaining_dom new_univ )@
579 | Uncertain,new_univ ->
580 (match remaining_dom with
582 | _ -> aux new_env remaining_dom new_univ )@
584 | Ko,_ -> filter univ tl)
586 filter base_univ choices
588 let base_univ = initial_ugraph in
591 match aux current_env todo_dom base_univ with
592 | [] -> raise NoWellTypedInterpretation
593 | [ e,me,t,u ] as l ->
594 debug_print "UNA SOLA SCELTA";
597 debug_print (sprintf "PIU' SCELTE (%d)" (List.length l));
600 (fun (env, _, _, _) ->
604 fst (Environment.find domain_item env)
606 (descr_of_domain_item domain_item, description))
610 let choosed = C.interactive_interpretation_choice choices in
611 List.map (List.nth l) choosed
615 let res_size = List.length res in
616 prerr_endline (sprintf
617 ("BENCHMARK: %d/%d refinements performed, domain size %d, interps %d, k %.2f\n" ^^
618 "BENCHMARK: estimated %.2f")
619 !actual_refinements !max_refinements !domain_size res_size
621 (float_of_int (!domain_size - 1) *. !choices_avg *. (float_of_int res_size) +. !choices_avg)));
625 CicEnvironment.CircularDependency s ->
626 raise (Failure "e chi la becca sta CircularDependency?");