let debug = false
let debug_print s = if debug then prerr_endline (Lazy.force s) else ()
+type id = string
+
(*
type interpretation_id = int
-let idref id t = Ast.AttributedTerm (`IdRef id, t)
-
type term_info =
{ sort: (Cic.id, Ast.sort_kind) Hashtbl.t;
uri: (Cic.id, UriManager.uri) Hashtbl.t;
let get_types uri =
let o,_ = CicEnvironment.get_obj CicUniv.oblivion_ugraph uri in
match o with
- | Cic.InductiveDefinition (l,_,lpsno,_) -> l, lpsno
+ | Cic.InductiveDefinition (l,_,leftno,_) -> l, leftno
| _ -> assert false
-
-let name_of_inductive_type uri i =
- let types, _ = get_types uri in
- let (name, _, _, _) = try List.nth types i with Not_found -> assert false in
- name
-
- (* returns <name, type> pairs *)
-let constructors_of_inductive_type uri i =
- let types, _ = get_types uri in
- let (_, _, _, constructors) =
- try List.nth types i with Not_found -> assert false
- in
- constructors
-
- (* returns name only *)
-let constructor_of_inductive_type uri i j =
- (try
- fst (List.nth (constructors_of_inductive_type uri i) (j-1))
- with Not_found -> assert false)
-
- (* returns the number of left parameters *)
-let left_params_no_of_inductive_type uri =
- snd (get_types uri)
*)
-(* CODICE c&p da NCicPp *)
-let r2s pp_fix_name r =
- try
- match r with
- | NReference.Ref (u,NReference.Ind (_,i,_)) ->
- (match NCicLibrary.get_obj u with
- | _,_,_,_, NCic.Inductive (_,_,itl,_) ->
- let _,name,_,_ = List.nth itl i in name
- | _ -> assert false)
- | NReference.Ref (u,NReference.Con (i,j,_)) ->
- (match NCicLibrary.get_obj u with
- | _,_,_,_, NCic.Inductive (_,_,itl,_) ->
- let _,_,_,cl = List.nth itl i in
- let _,name,_ = List.nth cl (j-1) in name
- | _ -> assert false)
- | NReference.Ref (u,(NReference.Decl | NReference.Def _)) ->
- (match NCicLibrary.get_obj u with
- | _,_,_,_, NCic.Constant (_,name,_,_,_) -> name
- | _ -> assert false)
- | NReference.Ref (u,(NReference.Fix (i,_,_)|NReference.CoFix i)) ->
- (match NCicLibrary.get_obj u with
- | _,_,_,_, NCic.Fixpoint (_,fl,_) ->
- if pp_fix_name then
- let _,name,_,_,_ = List.nth fl i in name
- else
- NUri.name_of_uri u ^"("^ string_of_int i ^ ")"
- | _ -> assert false)
- with NCicLibrary.ObjectNotFound _ -> NReference.string_of_reference r
+let idref register_ref =
+ let id = ref 0 in
+ fun ?reference t ->
+ incr id;
+ let id = "i" ^ string_of_int !id in
+ (match reference with None -> () | Some r -> register_ref id r);
+ Ast.AttributedTerm (`IdRef id, t)
;;
-let nast_of_cic =
- let rec k = function
- | NCic.Rel n -> Ast.Ident (string_of_int n, None)
- | NCic.Const r -> Ast.Ident (r2s true r, None)
- | NCic.Meta (n,l) -> Ast.Meta (n, [](*aux_context l*))
- | NCic.Sort NCic.Prop -> Ast.Sort `Prop
- | NCic.Sort NCic.Type _ -> Ast.Sort `Set
- | NCic.Implicit `Hole -> Ast.UserInput
- | NCic.Implicit _ -> Ast.Implicit
+(* CODICE c&p da NCicPp *)
+let nast_of_cic0
+ ~(idref:
+ ?reference:NReference.reference -> CicNotationPt.term -> CicNotationPt.term)
+ ~output_type ~subst k ~context =
+ function
+ | NCic.Rel n ->
+ (try
+ let name,_ = List.nth context (n-1) in
+ let name = if name = "_" then "__"^string_of_int n else name in
+ idref (Ast.Ident (name,None))
+ with Failure "nth" | Invalid_argument "List.nth" ->
+ idref (Ast.Ident ("-" ^ string_of_int (n - List.length context),None)))
+ | NCic.Const r -> idref ~reference:r (Ast.Ident (NCicPp.r2s true r, None))
+ | NCic.Meta (n,lc) when List.mem_assoc n subst ->
+ let _,_,t,_ = List.assoc n subst in
+ k ~context (NCicSubstitution.subst_meta lc t)
+ | NCic.Meta (n,(s,l)) ->
+ (* CSC: qua non dovremmo espandere *)
+ let l = NCicUtils.expand_local_context l in
+ idref (Ast.Meta
+ (n, List.map (fun x -> Some (k ~context (NCicSubstitution.lift s x))) l))
+ | NCic.Sort NCic.Prop -> idref (Ast.Sort `Prop)
+ | NCic.Sort NCic.Type _ -> idref (Ast.Sort `Set)
+ (* CSC: | C.Sort (C.Type []) -> F.fprintf f "Type0"
+ | C.Sort (C.Type [false, u]) -> F.fprintf f "%s" (NUri.name_of_uri u)
+ | C.Sort (C.Type [true, u]) -> F.fprintf f "S(%s)" (NUri.name_of_uri u)
+ | C.Sort (C.Type l) ->
+ F.fprintf f "Max(";
+ aux ctx (C.Sort (C.Type [List.hd l]));
+ List.iter (fun x -> F.fprintf f ",";aux ctx (C.Sort (C.Type [x])))
+ (List.tl l);
+ F.fprintf f ")"*)
+ (* CSC: qua siamo grezzi *)
+ | NCic.Implicit `Hole -> idref (Ast.UserInput)
+ | NCic.Implicit _ -> idref (Ast.Implicit)
| NCic.Prod (n,s,t) ->
+ let n = if n.[0] = '_' then "_" else n in
let binder_kind = `Forall in
- Ast.Binder (binder_kind, (Ast.Ident (n,None), Some (k s)), k t)
+ idref (Ast.Binder (binder_kind, (Ast.Ident (n,None), Some (k ~context s)),
+ k ~context:((n,NCic.Decl s)::context) t))
| NCic.Lambda (n,s,t) ->
- Ast.Binder (`Lambda,(Ast.Ident (n,None), Some (k s)), k t)
+ idref (Ast.Binder (`Lambda,(Ast.Ident (n,None), Some (k ~context s)),
+ k ~context:((n,NCic.Decl s)::context) t))
| NCic.LetIn (n,s,ty,t) ->
- Ast.LetIn ((Ast.Ident (n,None), Some (k ty)), k s, k t)
- | NCic.Appl args -> Ast.Appl (List.map k args)
- (*| NCic.AConst (id,uri,substs) ->
- register_uri id uri;
- idref id (Ast.Ident (UriManager.name_of_uri uri, aux_substs substs))*)
- | NCic.Match (uri,ty,te,patterns) ->
-(*
- let name = NReference.name_of_reference uri in
+ idref (Ast.LetIn ((Ast.Ident (n,None), Some (k ~context ty)), k ~context s,
+ k ~context:((n,NCic.Decl s)::context) t))
+ | NCic.Appl (NCic.Meta (n,lc) :: args) when List.mem_assoc n subst ->
+ let _,_,t,_ = List.assoc n subst in
+ let hd = NCicSubstitution.subst_meta lc t in
+ k ~context
+ (NCicReduction.head_beta_reduce ~upto:(List.length args)
+ (match hd with
+ | NCic.Appl l -> NCic.Appl (l@args)
+ | _ -> NCic.Appl (hd :: args)))
+ | NCic.Appl args -> idref (Ast.Appl (List.map (k ~context) args))
+ | NCic.Match (NReference.Ref (uri,_) as r,outty,te,patterns) ->
+ let name = NUri.name_of_uri uri in
+(* CSC
let uri_str = UriManager.string_of_uri uri in
let puri_str = sprintf "%s#xpointer(1/%d)" uri_str (typeno+1) in
let ctor_puri j =
UriManager.uri_of_string
(sprintf "%s#xpointer(1/%d/%d)" uri_str (typeno+1) j)
in
- let case_indty = name, Some (UriManager.uri_of_string puri_str) in
- let constructors = constructors_of_inductive_type uri typeno in
- let lpsno = left_params_no_of_inductive_type uri in
- let rec eat_branch n ty pat =
+*)
+ let case_indty =
+ name, None(*CSC Some (UriManager.uri_of_string puri_str)*) in
+ let constructors, leftno =
+ let _,leftno,tys,_,n = NCicEnvironment.get_checked_indtys r in
+ let _,_,_,cl = List.nth tys n in
+ cl,leftno
+ in
+ let rec eat_branch n ctx ty pat =
match (ty, pat) with
- | NCic.Prod (_, _, t), _ when n > 0 -> eat_branch (pred n) t pat
- | NCic.Prod (_, _, t), NCic.ALambda (_, name, s, t') ->
- let (cv, rhs) = eat_branch 0 t t' in
- (CicNotationUtil.name_of_cic_name name, Some (k s)) :: cv, rhs
- | _, _ -> [], k pat
+ | NCic.Prod (name, s, t), _ when n > 0 ->
+ eat_branch (pred n) ((name,NCic.Decl s)::ctx) t pat
+ | NCic.Prod (_, _, t), NCic.Lambda (name, s, t') ->
+ let cv, rhs = eat_branch 0 ((name,NCic.Decl s)::ctx) t t' in
+ (Ast.Ident (name,None), Some (k ~context:ctx s)) :: cv, rhs
+ | _, _ -> [], k ~context:ctx pat
in
let j = ref 0 in
let patterns =
try
List.map2
- (fun (name, ty) pat ->
+ (fun (_, name, ty) pat ->
incr j;
let name,(capture_variables,rhs) =
match output_type with
- `Term -> name, eat_branch lpsno ty pat
- | `Pattern -> "_", ([], k pat)
+ `Term -> name, eat_branch leftno context ty pat
+ | `Pattern -> "_", ([], k ~context pat)
in
- Ast.Pattern (name, Some (ctor_puri !j), capture_variables), rhs
+ Ast.Pattern (name, None(*CSC Some (ctor_puri !j)*), capture_variables), rhs
) constructors patterns
with Invalid_argument _ -> assert false
in
`Pattern -> None
| `Term -> Some case_indty
in
- idref id (Ast.Case (k te, indty, Some (k ty), patterns))
-*) Ast.Ident ("Un case",None)
- in
- k
-;;
-
-let map_sequent (i,(n,context,ty):int * NCic.conjecture) =
- let module K = Content in
- let context' =
- List.map
- (function
- | name,NCic.Decl t ->
- Some
- (* We should call build_decl_item, but we have not computed *)
- (* the inner-types ==> we always produce a declaration *)
- (`Declaration
- { K.dec_name = (Some name);
- K.dec_id = "-1";
- K.dec_inductive = false;
- K.dec_aref = "-1";
- K.dec_type = t
- })
- | name,NCic.Def (t,ty) ->
- Some
- (* We should call build_def_item, but we have not computed *)
- (* the inner-types ==> we always produce a declaration *)
- (`Definition
- { K.def_name = (Some name);
- K.def_id = "-1";
- K.def_aref = "-1";
- K.def_term = t;
- K.def_type = ty
- })
- ) context
- in
- "-1",i,context',ty
+ idref (Ast.Case (k ~context te, indty, Some (k ~context outty), patterns))
;;
-(*
(* persistent state *)
+(*
let initial_level2_patterns32 () = Hashtbl.create 211
let initial_interpretations () = Hashtbl.create 211
let level2_patterns32 = ref (initial_level2_patterns32 ())
(* symb -> id list ref *)
let interpretations = ref (initial_interpretations ())
+*)
let compiled32 = ref None
+(*
let pattern32_matrix = ref []
let counter = ref ~-1
compiled32 := ocompiled32;
pattern32_matrix := opattern32_matrix
;;
+*)
let get_compiled32 () =
match !compiled32 with
let add_idrefs =
List.fold_right (fun idref t -> Ast.AttributedTerm (`IdRef idref, t))
-let instantiate32 term_info idrefs env symbol args =
+let instantiate32 idrefs env symbol args =
let rec instantiate_arg = function
| Ast.IdentArg (n, name) ->
let t =
if args = [] then head
else Ast.Appl (head :: List.map instantiate_arg args)
-let rec ast_of_acic1 ~output_type term_info annterm =
- let id_to_uris = term_info.uri in
- let register_uri id uri = Hashtbl.add id_to_uris id uri in
- match (get_compiled32 ()) annterm with
+let rec nast_of_cic1 ~idref ~output_type ~subst ~context term =
+ match (get_compiled32 ()) term with
| None ->
- ast_of_acic0 ~output_type term_info annterm (ast_of_acic1 ~output_type)
+ nast_of_cic0 ~idref ~output_type ~subst
+ (nast_of_cic1 ~idref ~output_type ~subst) ~context term
| Some (env, ctors, pid) ->
let idrefs =
- List.map
- (fun annterm ->
- let idref = CicUtil.id_of_annterm annterm in
- (try
- register_uri idref
- (CicUtil.uri_of_term (Deannotate.deannotate_term annterm))
- with Invalid_argument _ -> ());
- idref)
- ctors
+ List.map
+ (fun term ->
+ let attrterm =
+ idref
+ ~reference:
+ (match term with NCic.Const nref -> nref | _ -> assert false)
+ (CicNotationPt.Ident ("dummy",None))
+ in
+ match attrterm with
+ Ast.AttributedTerm (`IdRef id, _) -> id
+ | _ -> assert false
+ ) ctors
in
- let env' =
+ let env =
List.map
- (fun (name, term) -> name, ast_of_acic1 ~output_type term_info term) env
+ (fun (name, term) ->
+ name,
+ nast_of_cic1 ~idref ~output_type ~subst ~context term
+ ) env
in
let _, symbol, args, _ =
try
- Hashtbl.find !level2_patterns32 pid
+ TermAcicContent.find_level2_patterns32 pid
with Not_found -> assert false
in
- let ast = instantiate32 term_info idrefs env' symbol args in
- Ast.AttributedTerm (`IdRef (CicUtil.id_of_annterm annterm), ast)
+ let ast = instantiate32 idrefs env symbol args in
+ idref ast (*Ast.AttributedTerm (`IdRef (idref term), ast)*)
+;;
let load_patterns32 t =
- let t =
- HExtlib.filter_map (function (true, ap, id) -> Some (ap, id) | _ -> None) t
- in
- set_compiled32 (lazy (Acic2astMatcher.Matcher32.compiler t))
+ let t =
+ HExtlib.filter_map (function (true, ap, id) -> Some (ap, id) | _ -> None) t
+ in
+ set_compiled32 (lazy (Ncic2astMatcher.Matcher32.compiler t))
+in
+ TermAcicContent.add_load_patterns32 load_patterns32;
+ TermAcicContent.init ()
+;;
+(*
let ast_of_acic ~output_type id_to_sort annterm =
debug_print (lazy ("ast_of_acic <- "
^ CicPp.ppterm (Deannotate.deannotate_term annterm)));
in
aux appl_pattern
*)
+
+let nmap_sequent0 ~idref ~subst (i,(n,context,ty):int * NCic.conjecture) =
+ let module K = Content in
+ let nast_of_cic = nast_of_cic1 ~idref ~output_type:`Term ~subst in
+ let context',_ =
+ List.fold_right
+ (fun item (res,context) ->
+ match item with
+ | name,NCic.Decl t ->
+ Some
+ (* We should call build_decl_item, but we have not computed *)
+ (* the inner-types ==> we always produce a declaration *)
+ (`Declaration
+ { K.dec_name = (Some name);
+ K.dec_id = "-1";
+ K.dec_inductive = false;
+ K.dec_aref = "-1";
+ K.dec_type = nast_of_cic ~context t
+ })::res,item::context
+ | name,NCic.Def (t,ty) ->
+ Some
+ (* We should call build_def_item, but we have not computed *)
+ (* the inner-types ==> we always produce a declaration *)
+ (`Definition
+ { K.def_name = (Some name);
+ K.def_id = "-1";
+ K.def_aref = "-1";
+ K.def_term = nast_of_cic ~context t;
+ K.def_type = nast_of_cic ~context ty
+ })::res,item::context
+ ) context ([],[])
+ in
+ ("-1",i,context',nast_of_cic ~context ty)
+;;
+
+let nmap_sequent ~subst metasenv =
+ let module K = Content in
+ let ids_to_refs = Hashtbl.create 211 in
+ let register_ref = Hashtbl.add ids_to_refs in
+ nmap_sequent0 ~idref:(idref register_ref) ~subst metasenv, ids_to_refs
+;;
+
+let object_prefix = "obj:";;
+let declaration_prefix = "decl:";;
+let definition_prefix = "def:";;
+
+let get_id =
+ function
+ Ast.AttributedTerm (`IdRef id, _) -> id
+ | _ -> assert false
+;;
+
+let gen_id prefix seed =
+ let res = prefix ^ string_of_int !seed in
+ incr seed ;
+ res
+;;
+
+let build_def_item seed context metasenv id n t ty =
+ let module K = Content in
+(*
+ try
+ let sort = Hashtbl.find ids_to_inner_sorts id in
+ if sort = `Prop then
+ (let p =
+ (acic2content seed context metasenv ?name:(name_of n) ~ids_to_inner_sorts ~ids_to_inner_types t)
+ in
+ `Proof p;)
+ else
+*)
+ `Definition
+ { K.def_name = Some n;
+ K.def_id = gen_id definition_prefix seed;
+ K.def_aref = id;
+ K.def_term = t;
+ K.def_type = ty
+ }
+(*
+ with
+ Not_found -> assert false
+*)
+
+let build_decl_item seed id n s =
+ let module K = Content in
+(*
+ let sort =
+ try
+ Some (Hashtbl.find ids_to_inner_sorts (Cic2acic.source_id_of_id id))
+ with Not_found -> None
+ in
+ match sort with
+ | Some `Prop ->
+ `Hypothesis
+ { K.dec_name = name_of n;
+ K.dec_id = gen_id declaration_prefix seed;
+ K.dec_inductive = false;
+ K.dec_aref = id;
+ K.dec_type = s
+ }
+ | _ ->
+*)
+ `Declaration
+ { K.dec_name = Some n;
+ K.dec_id = gen_id declaration_prefix seed;
+ K.dec_inductive = false;
+ K.dec_aref = id;
+ K.dec_type = s
+ }
+;;
+
+let nmap_obj (uri,_,metasenv,subst,kind) =
+ let module K = Content in
+ let ids_to_refs = Hashtbl.create 211 in
+ let register_ref = Hashtbl.add ids_to_refs in
+ let idref = idref register_ref in
+ let nast_of_cic =
+ nast_of_cic1 ~idref ~output_type:`Term ~subst in
+ let seed = ref 0 in
+ let conjectures =
+ match metasenv with
+ [] -> None
+ | _ -> (*Some (List.map (map_conjectures seed) metasenv)*)
+ (*CSC: used to be the previous line, that uses seed *)
+ Some (List.map (nmap_sequent0 ~idref ~subst) metasenv)
+ in
+ let res =
+ match kind with
+ NCic.Constant (_,_,Some bo,ty,_) ->
+ let ty = nast_of_cic ~context:[] ty in
+ let bo = nast_of_cic ~context:[] bo in
+ (gen_id object_prefix seed, [], conjectures,
+ `Def (K.Const,ty,
+ build_def_item seed [] [] (get_id bo) (NUri.name_of_uri uri) bo ty))
+ | NCic.Constant (_,_,None,ty,_) ->
+ let ty = nast_of_cic ~context:[] ty in
+ (gen_id object_prefix seed, [], conjectures,
+ `Decl (K.Const,
+ (*CSC: ??? get_id ty here used to be the id of the axiom! *)
+ build_decl_item seed (get_id ty) (NUri.name_of_uri uri) ty))
+(*
+ | C.AInductiveDefinition (id,l,params,nparams,_) ->
+ (gen_id object_prefix seed, params, conjectures,
+ `Joint
+ { K.joint_id = gen_id joint_prefix seed;
+ K.joint_kind = `Inductive nparams;
+ K.joint_defs = List.map (build_inductive seed) l
+ })
+
+and
+ build_inductive seed =
+ let module K = Content in
+ fun (_,n,b,ty,l) ->
+ `Inductive
+ { K.inductive_id = gen_id inductive_prefix seed;
+ K.inductive_name = n;
+ K.inductive_kind = b;
+ K.inductive_type = ty;
+ K.inductive_constructors = build_constructors seed l
+ }
+
+and
+ build_constructors seed l =
+ let module K = Content in
+ List.map
+ (fun (n,t) ->
+ { K.dec_name = Some n;
+ K.dec_id = gen_id declaration_prefix seed;
+ K.dec_inductive = false;
+ K.dec_aref = "";
+ K.dec_type = t
+ }) l
+*)
+ in
+ res,ids_to_refs
+;;
projects / helm.git / blobdiff