module DTI = DoubleTypeInference
module HEL = HExtlib
-let rec rewrite_tac ~direction ~pattern:(wanted,hyps_pat,concl_pat) equality =
- let _rewrite_tac status =
+let rec rewrite ~direction ~pattern:(wanted,hyps_pat,concl_pat) equality status=
assert (wanted = None); (* this should be checked syntactically *)
let proof,goal = status in
- let curi, metasenv, pbo, pty, attrs = proof in
+ let curi, metasenv, subst, pbo, pty, attrs = proof in
let (metano,context,gty) = CicUtil.lookup_meta goal metasenv in
- let gsort,_ =
- CicTypeChecker.type_of_aux' metasenv context gty CicUniv.oblivion_ugraph in
match hyps_pat with
he::(_::_ as tl) ->
- PET.apply_tactic
+ PET.apply_tactic
(T.then_
- (rewrite_tac ~direction
- ~pattern:(None,[he],None) equality)
- (rewrite_tac ~direction ~pattern:(None,tl,concl_pat)
- (S.lift 1 equality))
+ (PET.mk_tactic (rewrite ~direction
+ ~pattern:(None,[he],None) equality))
+ (PET.mk_tactic (rewrite ~direction
+ ~pattern:(None,tl,concl_pat) (S.lift 1 equality)))
) status
| [_] as hyps_pat when concl_pat <> None ->
- PET.apply_tactic
+ PET.apply_tactic
(T.then_
- (rewrite_tac ~direction
- ~pattern:(None,hyps_pat,None) equality)
- (rewrite_tac ~direction ~pattern:(None,[],concl_pat)
- (S.lift 1 equality))
+ (PET.mk_tactic (rewrite ~direction
+ ~pattern:(None,hyps_pat,None) equality))
+ (PET.mk_tactic (rewrite ~direction
+ ~pattern:(None,[],concl_pat) (S.lift 1 equality)))
) status
| _ ->
let arg,dir2,tac,concl_pat,gty =
match hyps_pat with
[] -> None,true,(fun ~term _ -> P.exact_tac term),concl_pat,gty
| [name,pat] ->
- let rec find_hyp n =
- function
- [] -> assert false
- | Some (Cic.Name s,Cic.Decl ty)::_ when name = s ->
- Cic.Rel n, S.lift n ty
- | Some (Cic.Name s,Cic.Def _)::_ -> assert false (*CSC: not implemented yet! But does this make any sense?*)
- | _::tl -> find_hyp (n+1) tl
- in
- let arg,gty = find_hyp 1 context in
+ let arg,gty = ProofEngineHelpers.find_hyp name context in
let dummy = "dummy" in
Some arg,false,
(fun ~term typ ->
Some pat,gty
| _::_ -> assert false
in
+ let gsort,_ =
+ CicTypeChecker.type_of_aux'
+ metasenv ~subst context gty CicUniv.oblivion_ugraph
+ in
let if_right_to_left do_not_change a b =
match direction with
| `RightToLeft -> if do_not_change then a else b
| `LeftToRight -> if do_not_change then b else a
in
let ty_eq,ugraph =
- CicTypeChecker.type_of_aux' metasenv context equality
- CicUniv.empty_ugraph in
+ CicTypeChecker.type_of_aux' metasenv ~subst context equality
+ CicUniv.oblivion_ugraph in
let (ty_eq,metasenv',arguments,fresh_meta) =
TermUtil.saturate_term
(ProofEngineHelpers.new_meta_of_proof proof) metasenv context ty_eq 0 in
(* now we always do as if direction was `LeftToRight *)
let fresh_name =
FreshNamesGenerator.mk_fresh_name
- ~subst:[] metasenv' context C.Anonymous ~typ:ty in
+ ~subst metasenv' context C.Anonymous ~typ:ty in
let lifted_t1 = S.lift 1 t1x in
let lifted_gty = S.lift 1 gty in
let lifted_conjecture =
match concl_pat with
| None -> None
| Some term -> Some (S.lift 1 term) in
- Some (fun _ m u -> lifted_t1, m, u),[],lifted_concl_pat
+ Some (fun c m u ->
+ let distance = pred (List.length c - List.length context) in
+ S.lift distance lifted_t1, m, u),[],lifted_concl_pat
in
let subst,metasenv',ugraph,_,selected_terms_with_context =
ProofEngineHelpers.select
- ~metasenv:metasenv' ~ugraph ~conjecture:lifted_conjecture
+ ~metasenv:metasenv' ~subst ~ugraph ~conjecture:lifted_conjecture
~pattern:lifted_pattern in
let metasenv' = CicMetaSubst.apply_subst_metasenv subst metasenv' in
let what,with_what =
let t1 = CicMetaSubst.apply_subst subst t1 in
let t2 = CicMetaSubst.apply_subst subst t2 in
let ty = CicMetaSubst.apply_subst subst ty in
- let pbo = CicMetaSubst.apply_subst subst pbo in
+ let pbo = lazy (CicMetaSubst.apply_subst subst (Lazy.force pbo)) in
let pty = CicMetaSubst.apply_subst subst pty in
let equality = CicMetaSubst.apply_subst subst equality in
let abstr_gty =
ProofEngineReduction.replace_lifting_csc 0
~equality:(==) ~what ~with_what:with_what ~where:lifted_gty in
+ if lifted_gty = abstr_gty then
+ raise (ProofEngineTypes.Fail (lazy "nothing to do"));
let abstr_gty = CicMetaSubst.apply_subst subst abstr_gty in
let pred = C.Lambda (fresh_name, ty, abstr_gty) in
(* The argument is either a meta if we are rewriting in the conclusion
let metasenv',arg,newtyp =
match arg with
None ->
+ let fresh_meta = CicMkImplicit.new_meta metasenv' subst in
let gty' = S.subst t2 abstr_gty in
let irl =
CicMkImplicit.identity_relocation_list_for_metavariable context in
in
try
let (proof',goals) =
- PET.apply_tactic
- (tac ~term:exact_proof newtyp) ((curi,metasenv',pbo,pty, attrs),goal)
+ PET.apply_tactic (tac ~term:exact_proof newtyp)
+ ((curi,metasenv',subst,pbo,pty, attrs),goal)
in
let goals =
goals@(ProofEngineHelpers.compare_metasenvs ~oldmetasenv:metasenv
in
(proof',goals)
with (* FG: this should be PET.Fail _ *)
- TC.TypeCheckerFailure _ ->
- let msg = lazy "rewrite: nothing to rewrite" in
+ TC.TypeCheckerFailure m ->
+ let msg = lazy ("rewrite: "^ Lazy.force m) in
raise (PET.Fail msg)
- in
- PET.mk_tactic _rewrite_tac
+;;
let rewrite_tac ~direction ~pattern equality names =
let _, hyps_pat, _ = pattern in
let froms = List.map fst hyps_pat in
- let start = rewrite_tac ~direction ~pattern equality in
+ let start = PET.mk_tactic (rewrite ~direction ~pattern equality) in
let continuation = PESR.rename ~froms ~tos:names in
if names = [] then start else T.then_ ~start ~continuation
+;;
let rewrite_simpl_tac ~direction ~pattern equality names =
T.then_
(ReductionTactics.simpl_tac
~pattern:(ProofEngineTypes.conclusion_pattern None))
-
let replace_tac ~(pattern: ProofEngineTypes.lazy_pattern) ~with_what =
let replace_tac ~(pattern: ProofEngineTypes.lazy_pattern) ~with_what status =
let _wanted, hyps_pat, concl_pat = pattern in
let (proof, goal) = status in
- let uri,metasenv,pbo,pty, attrs = proof in
+ let uri,metasenv,subst,pbo,pty, attrs = proof in
let (_,context,ty) as conjecture = CicUtil.lookup_meta goal metasenv in
assert (hyps_pat = []); (*CSC: not implemented yet *)
let eq_URI =
in
let context_len = List.length context in
let subst,metasenv,u,_,selected_terms_with_context =
- ProofEngineHelpers.select ~metasenv ~ugraph:CicUniv.empty_ugraph
+ ProofEngineHelpers.select ~subst ~metasenv ~ugraph:CicUniv.oblivion_ugraph
~conjecture ~pattern in
let metasenv = CicMetaSubst.apply_subst_metasenv subst metasenv in
let with_what, metasenv, u = with_what context metasenv u in
let with_what = CicMetaSubst.apply_subst subst with_what in
- let pbo = CicMetaSubst.apply_subst subst pbo in
+ let pbo = lazy (CicMetaSubst.apply_subst subst (Lazy.force pbo)) in
let pty = CicMetaSubst.apply_subst subst pty in
- let status = (uri,metasenv,pbo,pty, attrs),goal in
+ let status = (uri,metasenv,subst,pbo,pty, attrs),goal in
let ty_of_with_what,u =
CicTypeChecker.type_of_aux'
- metasenv context with_what CicUniv.empty_ugraph in
+ metasenv ~subst context with_what CicUniv.oblivion_ugraph in
let whats =
match selected_terms_with_context with
[] -> raise (ProofEngineTypes.Fail (lazy "Replace: no term selected"))
raise (ProofEngineTypes.Fail
(lazy "Replace: one of the selected terms is not closed")) in
let ty_of_t_in_context,u = (* TASSI: FIXME *)
- CicTypeChecker.type_of_aux' metasenv context t_in_context
- CicUniv.empty_ugraph in
- let b,u = CicReduction.are_convertible ~metasenv context
+ CicTypeChecker.type_of_aux' metasenv ~subst context t_in_context
+ CicUniv.oblivion_ugraph in
+ let b,u = CicReduction.are_convertible ~metasenv ~subst context
ty_of_with_what ty_of_t_in_context u in
if b then
let concl_pat_for_t = ProofEngineHelpers.pattern_of ~term:ty [t] in
(ProofEngineTypes.Fail
(lazy "Replace: one of the selected terms and the term to be replaced with have not convertible types"))
) l in
- let rec aux n whats status =
+ let rec aux n whats (status : ProofEngineTypes.status) =
match whats with
[] -> ProofEngineTypes.apply_tactic T.id_tac status
| (what,lazy_pattern)::tl ->
~continuations:[
T.then_
~start:(
- rewrite_tac ~direction:`LeftToRight ~pattern:lazy_pattern (C.Rel 1) [])
+ rewrite_tac
+ ~direction:`LeftToRight ~pattern:lazy_pattern (C.Rel 1) [])
~continuation:(
T.then_
~start:(
ProofEngineTypes.mk_tactic
(function ((proof,goal) as status) ->
- let _,metasenv,_,_, _ = proof in
+ let _,metasenv,_,_,_, _ = proof in
let _,context,_ = CicUtil.lookup_meta goal metasenv in
let hyps =
try
T.id_tac])
status
and aux_tac n tl = ProofEngineTypes.mk_tactic (aux n tl) in
- aux 0 whats status
+ aux 0 whats (status : ProofEngineTypes.status)
in
ProofEngineTypes.mk_tactic (replace_tac ~pattern ~with_what)
;;
let symmetry_tac =
let symmetry_tac (proof, goal) =
- let (_,metasenv,_,_, _) = proof in
+ let (_,metasenv,_,_,_, _) = proof in
let metano,context,ty = CicUtil.lookup_meta goal metasenv in
match (R.whd context ty) with
(C.Appl [(C.MutInd (uri, 0, [])); _; _; _])
when LibraryObjects.is_eq_URI uri ->
ProofEngineTypes.apply_tactic
(PrimitiveTactics.apply_tac
- ~term: (C.Const (LibraryObjects.sym_eq_URI uri, [])))
+ ~term:(C.Const (LibraryObjects.sym_eq_URI uri, [])))
(proof,goal)
| _ -> raise (ProofEngineTypes.Fail (lazy "Symmetry failed"))
let transitivity_tac ~term =
let transitivity_tac ~term status =
let (proof, goal) = status in
- let (_,metasenv,_,_, _) = proof in
+ let (_,metasenv,_,_,_, _) = proof in
let metano,context,ty = CicUtil.lookup_meta goal metasenv in
match (R.whd context ty) with
(C.Appl [(C.MutInd (uri, 0, [])); _; _; _])
ProofEngineTypes.mk_tactic (transitivity_tac ~term)
;;
-(* FG: subst tactic *********************************************************)
-
-(* FG: This should be replaced by T.try_tactic *)
-let try_tactic ~tactic =
- let try_tactic status =
- try PET.apply_tactic tactic status with
- | PET.Fail _ -> PET.apply_tactic T.id_tac status
- in
- PET.mk_tactic try_tactic
-
-let rec lift_rewrite_tac ~context ~direction ~pattern equality =
- let lift_rewrite_tac status =
- let (proof, goal) = status in
- let (_, metasenv, _, _, _) = proof in
- let _, new_context, _ = CicUtil.lookup_meta goal metasenv in
- let n = List.length new_context - List.length context in
- let equality = if n > 0 then S.lift n equality else equality in
- PET.apply_tactic (rewrite_tac ~direction ~pattern equality []) status
- in
- PET.mk_tactic lift_rewrite_tac
-
-
-let msg0 = lazy "Subst: not found in context"
-let msg1 = lazy "Subst: not a simple equality"
-let msg2 = lazy "Subst: recursive equation"
-
-let subst_tac ~hyp =
- let hole = C.Implicit (Some `Hole) in
- let subst_tac status =
- let (proof, goal) = status in
- let (_, metasenv, _, _, _) = proof in
- let _, context, _ = CicUtil.lookup_meta goal metasenv in
- let what = match PEH.get_rel context hyp with
- | Some t -> t
- | None -> raise (PET.Fail msg0)
- in
- let ty, _ = TC.type_of_aux' metasenv context what CicUniv.empty_ugraph in
- let direction, i, t = match ty with
- | (C.Appl [(C.MutInd (uri, 0, [])); _; C.Rel i; t])
- when LO.is_eq_URI uri -> `LeftToRight, i, t
- | (C.Appl [(C.MutInd (uri, 0, [])); _; t; C.Rel i])
- when LO.is_eq_URI uri -> `RightToLeft, i, t
- | _ -> raise (PET.Fail msg1)
- in
- let rewrite pattern =
- let tactic = lift_rewrite_tac ~context ~direction ~pattern what in
- try_tactic ~tactic
- in
- let var = match PEH.get_name context i with
- | Some name -> name
- | None -> raise (PET.Fail msg0)
- in
- if DTI.does_not_occur i t then () else raise (PET.Fail msg2);
- let map self = function
- | Some (C.Name s, _) when s <> self ->
- Some (rewrite (None, [(s, hole)], None))
- | _ -> None
- in
- let rew_hips = HEL.list_rev_map_filter (map hyp) context in
- let rew_concl = rewrite (None, [], Some hole) in
- let clear = PESR.clear ~hyps:[hyp; var] in
- let tactics = List.rev_append (rew_concl :: rew_hips) [clear] in
- PET.apply_tactic (T.seq ~tactics) status
- in
- PET.mk_tactic subst_tac
-
-let subst_tac =
- let subst hyp = try_tactic ~tactic:(subst_tac hyp) in
- let map = function
- | Some (C.Name s, _) -> Some (subst s)
- | _ -> None
- in
- let subst_tac status =
- let (proof, goal) = status in
- let (_, metasenv, _, _, _) = proof in
- let _, context, _ = CicUtil.lookup_meta goal metasenv in
- let tactics = HEL.list_rev_map_filter map context in
- PET.apply_tactic (T.seq ~tactics) status
- in
- PET.mk_tactic subst_tac
projects / helm.git / blobdiff