exception NotImplemented;;
-let fresh_id ids_to_terms ids_to_father_ids =
- let id = ref 0 in
- fun father t ->
- let res = "i" ^ string_of_int !id in
- incr id ;
- Hashtbl.add ids_to_father_ids res father ;
- Hashtbl.add ids_to_terms res t ;
- res
+let fresh_id seed ids_to_terms ids_to_father_ids =
+ fun father t ->
+ let res = "i" ^ string_of_int !seed in
+ incr seed ;
+ Hashtbl.add ids_to_father_ids res father ;
+ Hashtbl.add ids_to_terms res t ;
+ res
;;
exception NotEnoughElements;;
| (_,_) -> raise NotEnoughElements
;;
-let acic_of_cic_env env t =
+let acic_of_cic_env' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
+ metasenv env t
+=
+ let module T = CicTypeChecker in
let module C = Cic in
- let ids_to_terms = Hashtbl.create 503 in
- let ids_to_father_ids = Hashtbl.create 503 in
- let fresh_id' = fresh_id ids_to_terms ids_to_father_ids in
+ let fresh_id' = fresh_id seed ids_to_terms ids_to_father_ids in
let rec aux father bs tt =
let fresh_id'' = fresh_id' father tt in
let aux' = aux (Some fresh_id'') in
- match tt with
- C.Rel n ->
- let id =
- match get_nth bs n with
- C.Name s -> s
- | _ -> raise NameExpected
- in
- C.ARel (fresh_id'', n, id)
- | C.Var uri -> C.AVar (fresh_id'', uri)
- | C.Meta n -> C.AMeta (fresh_id'', n)
- | C.Sort s -> C.ASort (fresh_id'', s)
- | C.Implicit -> C.AImplicit (fresh_id'')
- | C.Cast (v,t) ->
- C.ACast (fresh_id'', aux' bs v, aux' bs t)
- | C.Prod (n,s,t) ->
- C.AProd (fresh_id'', n, aux' bs s, aux' (n::bs) t)
- | C.Lambda (n,s,t) ->
- C.ALambda (fresh_id'',n, aux' bs s, aux' (n::bs) t)
- | C.LetIn (n,s,t) ->
- C.ALetIn (fresh_id'', n, aux' bs s, aux' (n::bs) t)
- | C.Appl l -> C.AAppl (fresh_id'', List.map (aux' bs) l)
- | C.Const (uri,cn) -> C.AConst (fresh_id'', uri, cn)
- | C.Abst _ -> raise NotImplemented
- | C.MutInd (uri,cn,tyno) -> C.AMutInd (fresh_id'', uri, cn, tyno)
- | C.MutConstruct (uri,cn,tyno,consno) ->
- C.AMutConstruct (fresh_id'', uri, cn, tyno, consno)
- | C.MutCase (uri, cn, tyno, outty, term, patterns) ->
- C.AMutCase (fresh_id'', uri, cn, tyno, aux' bs outty,
- aux' bs term, List.map (aux' bs) patterns)
- | C.Fix (funno, funs) ->
- let names = List.map (fun (name,_,_,_) -> C.Name name) funs in
- C.AFix (fresh_id'', funno,
- List.map
- (fun (name, indidx, ty, bo) ->
- (name, indidx, aux' bs ty, aux' (names@bs) bo)
- ) funs
- )
- | C.CoFix (funno, funs) ->
- let names = List.map (fun (name,_,_) -> C.Name name) funs in
- C.ACoFix (fresh_id'', funno,
- List.map
- (fun (name, ty, bo) ->
- (name, aux' bs ty, aux' (names@bs) bo)
- ) funs
- )
- in
- aux None env t, ids_to_terms, ids_to_father_ids
+ (* First of all we compute the inner type and the inner sort *)
+ (* of the term. They may be useful in what follows. *)
+ (*CSC: This is a very inefficient way of computing inner types *)
+ (*CSC: and inner sorts: very deep terms have their types/sorts *)
+ (*CSC: computed again and again. *)
+ let string_of_sort =
+ function
+ C.Sort C.Prop -> "Prop"
+ | C.Sort C.Set -> "Set"
+ | C.Sort C.Type -> "Type"
+ | _ -> assert false
+ in
+ let innertype,innersort =
+ let cicenv = List.map (function (_,ty) -> ty) bs in
+ let innertype = T.type_of_aux' metasenv cicenv tt in
+ let innersort = T.type_of_aux' metasenv cicenv innertype in
+ innertype, string_of_sort innersort
+ in
+ match tt with
+ C.Rel n ->
+ let id =
+ match get_nth bs n with
+ (C.Name s,_) -> s
+ | _ -> raise NameExpected
+ in
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.ARel (fresh_id'', n, id)
+ | C.Var uri ->
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.AVar (fresh_id'', uri)
+ | C.Meta n ->
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.AMeta (fresh_id'', n)
+ | C.Sort s -> C.ASort (fresh_id'', s)
+ | C.Implicit -> C.AImplicit (fresh_id'')
+ | C.Cast (v,t) ->
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.ACast (fresh_id'', aux' bs v, aux' bs t)
+ | C.Prod (n,s,t) ->
+ Hashtbl.add ids_to_inner_sorts fresh_id''
+ (string_of_sort innertype) ;
+ C.AProd (fresh_id'', n, aux' bs s, aux' ((n,s)::bs) t)
+ | C.Lambda (n,s,t) ->
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.ALambda (fresh_id'',n, aux' bs s, aux' ((n,s)::bs) t)
+ | C.LetIn (n,s,t) ->
+(*CSC: Nell'environment debbo poter avere anche dichiarazioni! ;-(
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.ALetIn (fresh_id'', n, aux' bs s, aux' (n::bs) t)
+*) assert false
+ | C.Appl l ->
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.AAppl (fresh_id'', List.map (aux' bs) l)
+ | C.Const (uri,cn) ->
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.AConst (fresh_id'', uri, cn)
+ | C.Abst _ -> raise NotImplemented
+ | C.MutInd (uri,cn,tyno) -> C.AMutInd (fresh_id'', uri, cn, tyno)
+ | C.MutConstruct (uri,cn,tyno,consno) ->
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.AMutConstruct (fresh_id'', uri, cn, tyno, consno)
+ | C.MutCase (uri, cn, tyno, outty, term, patterns) ->
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.AMutCase (fresh_id'', uri, cn, tyno, aux' bs outty,
+ aux' bs term, List.map (aux' bs) patterns)
+ | C.Fix (funno, funs) ->
+ let names = List.map (fun (name,_,ty,_) -> C.Name name,ty) funs in
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.AFix (fresh_id'', funno,
+ List.map
+ (fun (name, indidx, ty, bo) ->
+ (name, indidx, aux' bs ty, aux' (names@bs) bo)
+ ) funs
+ )
+ | C.CoFix (funno, funs) ->
+ let names = List.map (fun (name,ty,_) -> C.Name name,ty) funs in
+ Hashtbl.add ids_to_inner_sorts fresh_id'' innersort ;
+ C.ACoFix (fresh_id'', funno,
+ List.map
+ (fun (name, ty, bo) ->
+ (name, aux' bs ty, aux' (names@bs) bo)
+ ) funs
+ )
+ in
+ aux None env t
+;;
+
+let acic_of_cic_env metasenv env t =
+ let ids_to_terms = Hashtbl.create 503 in
+ let ids_to_father_ids = Hashtbl.create 503 in
+ let ids_to_inner_sorts = Hashtbl.create 503 in
+ let seed = ref 0 in
+ acic_of_cic_env' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts
+ metasenv env t,
+ ids_to_terms, ids_to_father_ids, ids_to_inner_sorts
+;;
+
+exception Found of (Cic.name * Cic.term) list;;
+
+(* get_context_of_meta meta term *)
+(* returns the context of the occurrence of [meta] in [term]. *)
+(* Warning: if [meta] occurs not linearly in [term], the context *)
+(* of one "random" occurrence is returned. *)
+let get_context_of_meta meta term =
+ let module C = Cic in
+ let rec aux ctx =
+ function
+ C.Rel _
+ | C.Var _ -> ()
+ | C.Meta i when meta = i -> raise (Found ctx)
+ | C.Meta _
+ | C.Sort _
+ | C.Implicit -> ()
+ | C.Cast (te,ty) -> aux ctx te ; aux ctx ty
+ | C.Prod (n,s,t) -> aux ctx s ; aux (((*P.Declaration,*)n,s)::ctx) t
+ | C.Lambda (n,s,t) -> aux ctx s ; aux (((*P.Declaration,*)n,s)::ctx) t
+ | C.LetIn (n,s,t) ->
+ aux ctx s ; assert false (* aux ([P.Definition,n,s]::ctx) t *)
+ | C.Appl l -> List.iter (aux ctx) l
+ | C.Const _ -> ()
+ | C.Abst _ -> assert false
+ | C.MutInd _
+ | C.MutConstruct _ -> ()
+ | C.MutCase (_,_,_,outt,t,pl) ->
+ aux ctx outt ; aux ctx t; List.iter (aux ctx) pl
+ | C.Fix (_,ifl) ->
+ let counter = ref 0 in
+ let ctx' =
+ List.rev_map
+ (function (name,_,ty,bo) ->
+ let res = ((*P.Definition,*) C.Name name, C.Fix (!counter,ifl)) in
+ incr counter ;
+ res
+ ) ifl
+ @ ctx
+ in
+ List.iter (function (_,_,ty,bo) -> aux ctx ty ; aux ctx' bo) ifl
+ | C.CoFix (_,ifl) ->
+ let counter = ref 0 in
+ let ctx' =
+ List.rev_map
+ (function (name,ty,bo) ->
+ let res = ((*P.Definition,*) C.Name name, C.CoFix (!counter,ifl)) in
+ incr counter ;
+ res
+ ) ifl
+ @ ctx
+ in
+ List.iter (function (_,ty,bo) -> aux ctx ty ; aux ctx' bo) ifl
+ in
+ try
+ aux [] term ;
+ assert false (* No occurrences found. *)
+ with
+ Found context -> context
;;
-let acic_of_cic = acic_of_cic_env [];;
+exception NotImplemented;;
+
+let acic_object_of_cic_object obj =
+ let module C = Cic in
+ let ids_to_terms = Hashtbl.create 503 in
+ let ids_to_father_ids = Hashtbl.create 503 in
+ let ids_to_inner_sorts = Hashtbl.create 503 in
+ let seed = ref 0 in
+ let acic_term_of_cic_term_env' =
+ acic_of_cic_env' seed ids_to_terms ids_to_father_ids ids_to_inner_sorts in
+ let acic_term_of_cic_term' = acic_term_of_cic_term_env' [] [] in
+ let aobj =
+ match obj with
+ C.Definition (id,bo,ty,params) ->
+ let abo = acic_term_of_cic_term' bo in
+ let aty = acic_term_of_cic_term' ty
+ in
+ C.ADefinition ("mettereaposto",id,abo,aty,(Cic.Actual params))
+ | C.Axiom (id,ty,params) -> raise NotImplemented
+ | C.Variable (id,bo,ty) -> raise NotImplemented
+ | C.CurrentProof (id,conjectures,bo,ty) ->
+ let aconjectures =
+ List.map
+ (function (i,term) ->
+ let context = get_context_of_meta i bo in
+ let aterm = acic_term_of_cic_term_env' conjectures context term in
+ (i, aterm))
+ conjectures in
+ let abo = acic_term_of_cic_term_env' conjectures [] bo in
+ let aty = acic_term_of_cic_term_env' conjectures [] ty in
+ C.ACurrentProof ("mettereaposto",id,aconjectures,abo,aty)
+ | C.InductiveDefinition (tys,params,paramsno) -> raise NotImplemented
+ in
+ aobj, ids_to_terms, ids_to_father_ids, ids_to_inner_sorts
+;;
projects / helm.git / blobdiff