open UriManager
exception No_choices of domain_item
-exception NoWellTypedInterpretation
+exception NoWellTypedInterpretation of string Lazy.t list
exception PathNotWellFormed
(** raised when an environment is not enough informative to decide *)
-exception Try_again
+exception Try_again of string Lazy.t
type aliases = bool * DisambiguateTypes.environment
type 'a test_result =
| Ok of 'a * Cic.metasenv
- | Ko
- | Uncertain
+ | Ko of string Lazy.t
+ | Uncertain of string Lazy.t
let refine_term metasenv context uri term ugraph =
(* if benchmark then incr actual_refinements; *)
with
| CicRefine.Uncertain s ->
debug_print (lazy ("UNCERTAIN!!! [" ^ (Lazy.force s) ^ "] " ^ CicPp.ppterm term)) ;
- Uncertain,ugraph
+ Uncertain s,ugraph
| CicRefine.RefineFailure msg ->
debug_print (lazy (sprintf "PRUNED!!!\nterm%s\nmessage:%s"
(CicPp.ppterm term) (Lazy.force msg)));
- Ko,ugraph
+ Ko msg,ugraph
let refine_obj metasenv context uri obj ugraph =
assert (context = []);
with
| CicRefine.Uncertain s ->
debug_print (lazy ("UNCERTAIN!!! [" ^ (Lazy.force s) ^ "] " ^ CicPp.ppobj obj)) ;
- Uncertain,ugraph
+ Uncertain s,ugraph
| CicRefine.RefineFailure msg ->
debug_print (lazy (sprintf "PRUNED!!!\nterm%s\nmessage:%s"
(CicPp.ppobj obj) (Lazy.force msg))) ;
- Ko,ugraph
+ Ko msg,ugraph
let resolve (env: codomain_item Environment.t) (item: domain_item) ?(num = "") ?(args = []) () =
try
let (indtype_uri, indtype_no) =
match indty_ident with
| Some (indty_ident, _) ->
- (match resolve env (Id indty_ident) () with
+ (match resolve env (Id indty_ident) () with
| Cic.MutInd (uri, tyno, _) -> (uri, tyno)
- | Cic.Implicit _ -> raise Try_again
- | _ -> raise Invalid_choice)
+ | Cic.Implicit _ ->
+ raise (Try_again (lazy "The type of the term to be matched
+ is still unknown"))
+ | _ ->
+ raise (Invalid_choice (lazy "The type of the term to be matched is not (co)inductive!")))
| None ->
let fst_constructor =
match branches with
| ((head, _, _), _) :: _ -> head
- | [] -> raise Invalid_choice
+ | [] -> raise (Invalid_choice (lazy "The type of the term to be matched is an inductive type without constructors that cannot be determined"))
in
(match resolve env (Id fst_constructor) () with
| Cic.MutConstruct (indtype_uri, indtype_no, _, _) ->
(indtype_uri, indtype_no)
- | Cic.Implicit _ -> raise Try_again
- | _ -> raise Invalid_choice)
+ | Cic.Implicit _ ->
+ raise (Try_again (lazy "The type of the term to be matched
+ is still unknown"))
+ | _ ->
+ raise (Invalid_choice (lazy "The type of the term to be matched is not (co)inductive!")))
in
Cic.MutCase (indtype_uri, indtype_no, cic_outtype, cic_term,
(List.map do_branch branches))
(try
List.assoc s ids_to_uris, aux loc context term
with Not_found ->
- raise Invalid_choice))
+ raise (Invalid_choice (lazy "The provided explicit named substitution is trying to instantiate a named variable the object is not abstracted on"))))
subst
| None -> List.map (fun uri -> uri, Cic.Implicit None) uris)
in
*)
t
| _ ->
- raise Invalid_choice
+ raise (Invalid_choice (lazy "??? Can this happen?"))
with
CicEnvironment.CircularDependency _ ->
- raise Invalid_choice))
+ raise (Invalid_choice (lazy "Circular dependency in the environment"))))
| CicNotationPt.Implicit -> Cic.Implicit None
| CicNotationPt.UserInput -> Cic.Implicit (Some `Hole)
| CicNotationPt.Num (num, i) -> resolve env (Num i) ~num ()
(k , ugraph1 )
in refine_profiler.HExtlib.profile foo ()
with
- | Try_again -> Uncertain, ugraph
- | Invalid_choice -> Ko, ugraph
+ | Try_again msg -> Uncertain msg, ugraph
+ | Invalid_choice msg -> Ko msg, ugraph
in
(* (4) build all possible interpretations *)
+ let (@@) (l1,l2) (l1',l2') = l1@l1, l2@l2' in
let rec aux aliases diff lookup_in_todo_dom todo_dom base_univ =
match todo_dom with
| [] ->
assert (lookup_in_todo_dom = None);
(match test_env aliases [] base_univ with
| Ok (thing, metasenv),new_univ ->
- [ aliases, diff, metasenv, thing, new_univ ]
- | Ko,_ | Uncertain,_ -> [])
+ [ aliases, diff, metasenv, thing, new_univ ], []
+ | Ko msg,_ | Uncertain msg,_ -> [],[msg])
| item :: remaining_dom ->
debug_print (lazy (sprintf "CHOOSED ITEM: %s"
(string_of_domain_item item)));
None -> lookup_choices item
| Some choices -> choices in
match choices with
- [] -> []
+ [] -> [], [lazy "No choices"]
| [codomain_item] ->
(* just one choice. We perform a one-step look-up and
if the next set of choices is also a singleton we
(match test_env new_env remaining_dom base_univ with
| Ok (thing, metasenv),new_univ ->
(match remaining_dom with
- | [] -> [ new_env, new_diff, metasenv, thing, new_univ ]
+ | [] ->
+ [ new_env, new_diff, metasenv, thing, new_univ ], []
| _ ->
aux new_env new_diff lookup_in_todo_dom
remaining_dom new_univ)
- | Uncertain,new_univ ->
+ | Uncertain msg,new_univ ->
(match remaining_dom with
- | [] -> []
+ | [] -> [], [msg]
| _ ->
aux new_env new_diff lookup_in_todo_dom
remaining_dom new_univ)
- | Ko,_ -> [])
+ | Ko msg,_ -> [], [msg])
| _::_ ->
let rec filter univ = function
- | [] -> []
+ | [] -> [],[]
| codomain_item :: tl ->
debug_print(lazy (sprintf "%s CHOSEN" (fst codomain_item)));
let new_env = Environment.add item codomain_item aliases in
(match test_env new_env remaining_dom univ with
| Ok (thing, metasenv),new_univ ->
(match remaining_dom with
- | [] -> [ new_env, new_diff, metasenv, thing, new_univ ]
+ | [] -> [ new_env, new_diff, metasenv, thing, new_univ ], []
| _ -> aux new_env new_diff None remaining_dom new_univ
- ) @
+ ) @@
filter univ tl
- | Uncertain,new_univ ->
+ | Uncertain msg,new_univ ->
(match remaining_dom with
- | [] -> []
+ | [] -> [],[msg]
| _ -> aux new_env new_diff None remaining_dom new_univ
- ) @
+ ) @@
filter univ tl
- | Ko,_ -> filter univ tl)
+ | Ko msg,_ -> ([],[msg]) @@ filter univ tl)
in
filter base_univ choices
in
try
let res =
match aux aliases [] None todo_dom base_univ with
- | [] -> raise NoWellTypedInterpretation
- | [_,diff,metasenv,t,ugraph] ->
+ | [],errors -> raise (NoWellTypedInterpretation errors)
+ | [_,diff,metasenv,t,ugraph],_ ->
debug_print (lazy "SINGLE INTERPRETATION");
[diff,metasenv,t,ugraph], false
- | l ->
+ | l,_ ->
debug_print (lazy (sprintf "MANY INTERPRETATIONS (%d)" (List.length l)));
let choices =
List.map