2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
12 (* $Id: nCic.ml 9058 2008-10-13 17:42:30Z tassi $ *)
16 open DisambiguateTypes
19 module Ast = CicNotationPt
20 module NRef = NReference
22 let debug_print _ = ();;
23 (* let debug_print s = prerr_endline (Lazy.force s);; *)
25 let cic_name_of_name = function
26 | Ast.Ident (n, None) -> n
31 metasenv subst context uri ~coercion_db ~use_coercions term _ ~localization_tbl=
33 debug_print (lazy (sprintf "TEST_INTERPRETATION: %s"
34 (NCicPp.ppterm ~metasenv ~subst ~context term)));
37 try NCicUntrusted.NCicHash.find localization_tbl t
39 prerr_endline (NCicPp.ppterm ~metasenv ~subst ~context t);
42 let metasenv, subst, term, _ =
46 NCicCoercion.look_for_coercion coercion_db
47 else (fun _ _ _ _ _ -> []))
48 metasenv subst context term None ~localise
50 Disambiguate.Ok (term, metasenv, subst, ())
52 | NCicRefiner.Uncertain loc_msg ->
53 debug_print (lazy ("UNCERTAIN: [" ^ snd (Lazy.force loc_msg) ^ "] " ^
54 NCicPp.ppterm ~metasenv ~subst ~context term)) ;
55 Disambiguate.Uncertain loc_msg
56 | NCicRefiner.RefineFailure loc_msg ->
57 debug_print (lazy (sprintf "PRUNED:\nterm%s\nmessage:%s"
58 (NCicPp.ppterm ~metasenv ~subst ~context term) (snd(Lazy.force loc_msg))));
59 Disambiguate.Ko loc_msg
62 (* TODO move it to Cic *)
63 let find_in_context name context =
64 let rec aux acc = function
65 | [] -> raise Not_found
66 | hd :: _ when hd = name -> acc
67 | _ :: tl -> aux (acc + 1) tl
72 ?(create_dummy_ids=false) ~mk_choice ~context ~env ~uri ~is_path ast
75 (* create_dummy_ids shouldbe used only for interpretating patterns *)
78 let rec aux ~localize loc context = function
79 | CicNotationPt.AttributedTerm (`Loc loc, term) ->
80 let res = aux ~localize loc context term in
82 NCicUntrusted.NCicHash.add localization_tbl res loc;
84 | CicNotationPt.AttributedTerm (_, term) -> aux ~localize loc context term
85 | CicNotationPt.Appl (CicNotationPt.Symbol (symb, i) :: args) ->
86 let cic_args = List.map (aux ~localize loc context) args in
87 Disambiguate.resolve ~mk_choice ~env (Symbol (symb, i)) (`Args cic_args)
88 | CicNotationPt.Appl terms ->
89 NCic.Appl (List.map (aux ~localize loc context) terms)
90 | CicNotationPt.Binder (binder_kind, (var, typ), body) ->
91 let cic_type = aux_option ~localize loc context `Type typ in
92 let cic_name = cic_name_of_name var in
93 let cic_body = aux ~localize loc (cic_name :: context) body in
94 (match binder_kind with
95 | `Lambda -> NCic.Lambda (cic_name, cic_type, cic_body)
97 | `Forall -> NCic.Prod (cic_name, cic_type, cic_body)
99 Disambiguate.resolve ~env ~mk_choice (Symbol ("exists", 0))
100 (`Args [ cic_type; NCic.Lambda (cic_name, cic_type, cic_body) ]))
101 | CicNotationPt.Case (term, indty_ident, outtype, branches) ->
102 let cic_term = aux ~localize loc context term in
103 let cic_outtype = aux_option ~localize loc context `Term outtype in
104 let do_branch ((_, _, args), term) =
105 let rec do_branch' context = function
106 | [] -> aux ~localize loc context term
107 | (name, typ) :: tl ->
108 let cic_name = cic_name_of_name name in
109 let cic_body = do_branch' (cic_name :: context) tl in
112 | None -> NCic.Implicit `Type
113 | Some typ -> aux ~localize loc context typ
115 NCic.Lambda (cic_name, typ, cic_body)
117 do_branch' context args
119 if create_dummy_ids then
123 Ast.Wildcard,term -> ("wildcard",None,[]), term
125 raise (DisambiguateTypes.Invalid_choice
126 (lazy (loc, "Syntax error: the left hand side of a "^
127 "branch pattern must be \"_\"")))
131 NCic.MutCase (ref, cic_outtype, cic_term,
132 (List.map do_branch branches))
133 *) ignore branches; assert false (* patterns not implemented yet *)
136 match indty_ident with
137 | Some (indty_ident, _) ->
138 (match Disambiguate.resolve ~env ~mk_choice
139 (Id indty_ident) (`Args []) with
140 | NCic.Const (NReference.Ref (_,NReference.Ind _) as r) -> r
142 raise (Disambiguate.Try_again
143 (lazy "The type of the term to be matched is still unknown"))
145 raise (DisambiguateTypes.Invalid_choice
146 (lazy (loc,"The type of the term to be matched "^
147 "is not (co)inductive: " ^ NCicPp.ppterm
148 ~metasenv:[] ~subst:[] ~context:[] t))))
150 let rec fst_constructor =
152 (Ast.Pattern (head, _, _), _) :: _ -> head
153 | (Ast.Wildcard, _) :: tl -> fst_constructor tl
154 | [] -> raise (Invalid_choice (lazy (loc,"The type "^
155 "of the term to be matched cannot be determined "^
156 "because it is an inductive type without constructors "^
157 "or because all patterns use wildcards")))
160 DisambiguateTypes.Environment.iter
163 (DisambiguateTypes.string_of_domain_item k ^ " => " ^
164 description_of_alias v)) env;
166 (match Disambiguate.resolve ~env ~mk_choice
167 (Id (fst_constructor branches)) (`Args []) with
168 | NCic.Const (NReference.Ref (_,NReference.Con _) as r) ->
169 let b,_,_,_,_ = NCicEnvironment.get_checked_indtys r in
170 NReference.mk_indty b r
172 raise (Disambiguate.Try_again
173 (lazy "The type of the term to be matched is still unknown"))
175 raise (DisambiguateTypes.Invalid_choice
177 "The type of the term to be matched is not (co)inductive: "
178 ^ NCicPp.ppterm ~metasenv:[] ~subst:[] ~context:[] t))))
180 let _,leftsno,itl,_,indtyp_no =
181 NCicEnvironment.get_checked_indtys indtype_ref in
184 List.nth itl indtyp_no
185 with _ -> assert false in
186 let rec count_prod t =
187 match NCicReduction.whd ~subst:[] [] t with
188 NCic.Prod (_, _, t) -> 1 + (count_prod t)
191 let rec sort branches cl =
194 let rec analyze unused unrecognized useless =
197 if unrecognized != [] then
198 raise (DisambiguateTypes.Invalid_choice
200 (loc,"Unrecognized constructors: " ^
201 String.concat " " unrecognized)))
202 else if useless > 0 then
203 raise (DisambiguateTypes.Invalid_choice
205 (loc,"The last " ^ string_of_int useless ^
206 "case" ^ if useless > 1 then "s are" else " is" ^
210 | (Ast.Wildcard,_)::tl when not unused ->
211 analyze true unrecognized useless tl
212 | (Ast.Pattern (head,_,_),_)::tl when not unused ->
213 analyze unused (head::unrecognized) useless tl
214 | _::tl -> analyze unused unrecognized (useless + 1) tl
216 analyze false [] 0 branches
217 | (_,name,ty)::cltl ->
218 let rec find_and_remove =
222 (DisambiguateTypes.Invalid_choice
223 (lazy (loc, "Missing case: " ^ name)))
224 | ((Ast.Wildcard, _) as branch :: _) as branches ->
226 | (Ast.Pattern (name',_,_),_) as branch :: tl
230 let found,rest = find_and_remove tl in
233 let branch,tl = find_and_remove branches in
235 Ast.Pattern (name,y,args),term ->
236 if List.length args = count_prod ty - leftsno then
237 ((name,y,args),term)::sort tl cltl
240 (DisambiguateTypes.Invalid_choice
241 (lazy (loc,"Wrong number of arguments for " ^ name)))
242 | Ast.Wildcard,term ->
248 (`Lambda, (CicNotationPt.Ident ("_", None), None),
251 (("wildcard",None,[]),
252 mk_lambdas (count_prod ty - leftsno)) :: sort tl cltl
254 let branches = sort branches cl in
255 NCic.Match (indtype_ref, cic_outtype, cic_term,
256 (List.map do_branch branches))
257 | CicNotationPt.Cast (t1, t2) ->
258 let cic_t1 = aux ~localize loc context t1 in
259 let cic_t2 = aux ~localize loc context t2 in
260 NCic.LetIn ("_",cic_t2,cic_t1, NCic.Rel 1)
261 | CicNotationPt.LetIn ((name, typ), def, body) ->
262 let cic_def = aux ~localize loc context def in
263 let cic_name = cic_name_of_name name in
266 | None -> NCic.Implicit `Type
267 | Some t -> aux ~localize loc context t
269 let cic_body = aux ~localize loc (cic_name :: context) body in
270 NCic.LetIn (cic_name, cic_typ, cic_def, cic_body)
271 | CicNotationPt.LetRec (_kind, _defs, _body) ->
275 (fun acc (_, (name, _), _, _) ->
276 cic_name_of_name name :: acc)
280 let unlocalized_body = aux ~localize:false loc context' body in
281 match unlocalized_body with
282 NCic.Rel n when n <= List.length defs -> `AvoidLetInNoAppl n
283 | NCic.Appl (NCic.Rel n::l) when n <= List.length defs ->
288 let t',subst,metasenv =
289 CicMetaSubst.delift_rels [] [] (List.length defs) t
292 assert (metasenv=[]);
295 (* We can avoid the LetIn. But maybe we need to recompute l'
296 so that it is localized *)
299 CicNotationPt.AttributedTerm (_,CicNotationPt.Appl(_::l)) ->
300 (* since we avoid the letin, the context has no
302 let l' = List.map (aux ~localize loc context) l in
308 CicMetaSubst.DeliftingARelWouldCaptureAFreeVariable ->
310 `AddLetIn (aux ~localize loc context' body)
312 `AddLetIn unlocalized_body)
315 `AddLetIn (aux ~localize loc context' body)
317 `AddLetIn unlocalized_body
321 (fun (params, (name, typ), body, decr_idx) ->
322 let add_binders kind t =
324 (fun var t -> CicNotationPt.Binder (kind, var, t)) params t
327 aux ~localize loc context' (add_binders `Lambda body) in
329 aux_option ~localize loc context (Some `Type)
330 (HExtlib.map_option (add_binders `Pi) typ) in
332 match cic_name_of_name name with
334 CicNotationPt.fail loc
335 "Recursive functions cannot be anonymous"
336 | NCic.Name name -> name
338 (name, decr_idx, cic_type, cic_body))
343 `Inductive -> NCic.Fix (n,inductiveFuns)
345 let coinductiveFuns =
347 (fun (name, _, typ, body) -> name, typ, body)
350 NCic.CoFix (n,coinductiveFuns)
352 let counter = ref ~-1 in
353 let build_term _ (var,_,ty,_) t =
355 NCic.LetIn (NCic.Name var, fix_or_cofix !counter, ty, t)
358 `AvoidLetInNoAppl n ->
359 let n' = List.length inductiveFuns - n in
361 | `AvoidLetIn (n,l) ->
362 let n' = List.length inductiveFuns - n in
363 NCic.Appl (fix_or_cofix n'::l)
364 | `AddLetIn cic_body ->
365 List.fold_right (build_term inductiveFuns) inductiveFuns
368 | CicNotationPt.Ident _
369 | CicNotationPt.Uri _ when is_path -> raise Disambiguate.PathNotWellFormed
370 | CicNotationPt.Ident (name, subst) ->
371 assert (subst = None);
373 NCic.Rel (find_in_context name context)
375 Disambiguate.resolve ~env ~mk_choice (Id name) (`Args []))
376 | CicNotationPt.Uri (name, subst) ->
377 assert (subst = None);
379 NCic.Const (NRef.reference_of_string name)
380 with NRef.IllFormedReference _ ->
381 CicNotationPt.fail loc "Ill formed reference")
382 | CicNotationPt.Implicit -> NCic.Implicit `Term
383 | CicNotationPt.UserInput -> assert false (*NCic.Implicit (Some `Hole)
384 patterns not implemented *)
385 | CicNotationPt.Num (num, i) ->
386 Disambiguate.resolve ~env ~mk_choice (Num i) (`Num_arg num)
387 | CicNotationPt.Meta (index, subst) ->
390 (function None -> assert false| Some t -> aux ~localize loc context t)
393 NCic.Meta (index, (0, NCic.Ctx cic_subst))
394 | CicNotationPt.Sort `Prop -> NCic.Sort NCic.Prop
395 | CicNotationPt.Sort `Set -> NCic.Sort (NCic.Type
396 [false,NUri.uri_of_string "cic:/matita/pts/Type.univ"])
397 | CicNotationPt.Sort (`Type _u) -> NCic.Sort (NCic.Type
398 [false,NUri.uri_of_string "cic:/matita/pts/Type.univ"])
399 | CicNotationPt.Sort (`NType s) -> NCic.Sort (NCic.Type
400 [false,NUri.uri_of_string ("cic:/matita/pts/Type" ^ s ^ ".univ")])
401 | CicNotationPt.Sort (`CProp _u) -> NCic.Sort (NCic.Type
402 [false,NUri.uri_of_string "cic:/matita/pts/CProp.univ"])
403 | CicNotationPt.Symbol (symbol, instance) ->
404 Disambiguate.resolve ~env ~mk_choice
405 (Symbol (symbol, instance)) (`Args [])
406 | CicNotationPt.Variable _
407 | CicNotationPt.Magic _
408 | CicNotationPt.Layout _
409 | CicNotationPt.Literal _ -> assert false (* god bless Bologna *)
410 and aux_option ~localize loc context annotation = function
411 | None -> NCic.Implicit annotation
412 | Some (CicNotationPt.AttributedTerm (`Loc loc, term)) ->
413 let res = aux_option ~localize loc context annotation (Some term) in
415 NCicUntrusted.NCicHash.add localization_tbl res loc;
417 | Some (CicNotationPt.AttributedTerm (_, term)) ->
418 aux_option ~localize loc context annotation (Some term)
419 | Some CicNotationPt.Implicit -> NCic.Implicit annotation
420 | Some term -> aux ~localize loc context term
422 aux ~localize:true HExtlib.dummy_floc context ast
424 let interpretate_term ?(create_dummy_ids=false) ~context ~env ~uri ~is_path ast
427 let context = List.map fst context in
428 interpretate_term ~create_dummy_ids ~context ~env ~uri ~is_path ast
432 let disambiguate_term ~context ~metasenv ~subst ?goal
433 ~mk_implicit ~description_of_alias ~mk_choice
434 ~aliases ~universe ~coercion_db ~lookup_in_library
435 (text,prefix_len,term)
437 let mk_localization_tbl x = NCicUntrusted.NCicHash.create x in
440 None -> (fun _ y -> y),(fun x -> x)
443 let _,_,ty = NCicUtils.lookup_meta n metasenv in
444 NCic.LetIn ("_",ty,y,NCic.Rel 1)),
446 | Disambiguate.Ok (t,m,s,ug) ->
448 | NCic.LetIn ("_",_,y,NCic.Rel 1) -> Disambiguate.Ok (y,m,s,ug)
453 MultiPassDisambiguator.disambiguate_thing
454 ~freshen_thing:CicNotationUtil.freshen_term
455 ~context ~metasenv ~initial_ugraph:() ~aliases
456 ~mk_implicit ~description_of_alias
457 ~string_context_of_context:(List.map (fun (x,_) -> Some x))
458 ~universe ~uri:None ~pp_thing:CicNotationPp.pp_term
459 ~passes:(MultiPassDisambiguator.passes ())
460 ~lookup_in_library ~domain_of_thing:Disambiguate.domain_of_term
461 ~interpretate_thing:(interpretate_term ~mk_choice (?create_dummy_ids:None))
462 ~refine_thing:(refine_term ~coercion_db) (text,prefix_len,term)
463 ~mk_localization_tbl ~hint ~subst
465 List.map (function (a,b,c,d,_) -> a,b,c,d) res, b
471 [false, NUri.uri_of_string ("cic:/matita/pts/Type.univ")]
473 [false, NUri.uri_of_string ("cic:/matita/pts/Type"^string_of_int n^".univ")]
477 [false, NUri.uri_of_string ("cic:/matita/pts/CProp.univ")]
479 [false, NUri.uri_of_string ("cic:/matita/pts/CProp"^string_of_int n^".univ")]
481 NCicEnvironment.add_constraint true (mk_type 0) (mk_type 1);
482 NCicEnvironment.add_constraint true (mk_cprop 0) (mk_cprop 1);
483 NCicEnvironment.add_constraint true (mk_cprop 0) (mk_type 1);
484 NCicEnvironment.add_constraint true (mk_type 0) (mk_cprop 1);
485 NCicEnvironment.add_constraint false (mk_cprop 0) (mk_type 0);
486 NCicEnvironment.add_constraint false (mk_type 0) (mk_cprop 0);