*)
(* $Id$ *)
-
+
+module C = Cic
+module U = UriManager
+module PET = ProofEngineTypes
+module PER = ProofEngineReduction
+module PEH = ProofEngineHelpers
+module PESR = ProofEngineStructuralRules
+module P = PrimitiveTactics
+module T = Tacticals
+module R = CicReduction
+module TC = CicTypeChecker
+module LO = LibraryObjects
+module DTI = DoubleTypeInference
+
let rec rewrite_tac ~direction ~(pattern: ProofEngineTypes.lazy_pattern) equality =
let _rewrite_tac ~direction ~pattern:(wanted,hyps_pat,concl_pat) equality status
=
- let module C = Cic in
- let module U = UriManager in
- let module PET = ProofEngineTypes in
- let module PER = ProofEngineReduction in
- let module PEH = ProofEngineHelpers in
- let module PT = PrimitiveTactics in
assert (wanted = None); (* this should be checked syntactically *)
let proof,goal = status in
let curi, metasenv, pbo, pty = proof in
(Tacticals.then_
(rewrite_tac ~direction
~pattern:(None,[he],None) equality)
- (rewrite_tac ~direction ~pattern:(None,tl,concl_pat) equality)
+ (rewrite_tac ~direction ~pattern:(None,tl,concl_pat)
+ (CicSubstitution.lift 1 equality))
) status
| [_] as hyps_pat when concl_pat <> None ->
PET.apply_tactic
(Tacticals.then_
(rewrite_tac ~direction
~pattern:(None,hyps_pat,None) equality)
- (rewrite_tac ~direction ~pattern:(None,[],concl_pat) equality)
+ (rewrite_tac ~direction ~pattern:(None,[],concl_pat)
+ (CicSubstitution.lift 1 equality))
) status
| _ ->
let arg,dir2,tac,concl_pat,gty =
match hyps_pat with
- [] -> None,true,(fun ~term _ -> PT.exact_tac term),concl_pat,gty
+ [] -> None,true,(fun ~term _ -> P.exact_tac term),concl_pat,gty
| [name,pat] ->
let rec find_hyp n =
function
Tacticals.seq
~tactics:
[ProofEngineStructuralRules.rename name dummy;
- PT.letin_tac
+ P.letin_tac
~mk_fresh_name_callback:(fun _ _ _ ~typ -> Cic.Name name) term;
ProofEngineStructuralRules.clearbody name;
- ReductionTactics.change_tac
+ ReductionTactics.change_tac
~pattern:
(None,[name,Cic.Implicit (Some `Hole)], None)
(ProofEngineTypes.const_lazy_term typ);
- ProofEngineStructuralRules.clear dummy
+ ProofEngineStructuralRules.clear [dummy]
]),
Some pat,gty
| _::_ -> assert false
CicUniv.empty_ugraph in
let (ty_eq,metasenv',arguments,fresh_meta) =
ProofEngineHelpers.saturate_term
- (ProofEngineHelpers.new_meta_of_proof proof) metasenv context ty_eq 0 in
+ (ProofEngineHelpers.new_meta_of_proof proof) metasenv context ty_eq 0 in
let equality =
if List.length arguments = 0 then
equality
ProofEngineHelpers.select
~metasenv:metasenv' ~ugraph ~conjecture:lifted_conjecture
~pattern:lifted_pattern in
- let metasenv' = CicMetaSubst.apply_subst_metasenv subst metasenv' in
+ let metasenv' = CicMetaSubst.apply_subst_metasenv subst metasenv' in
let what,with_what =
(* Note: Rel 1 does not live in the context context_of_t *)
(* The replace_lifting_csc 0 function will take care of lifting it *)
selected_terms_with_context ([],[]) in
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 pty = CicMetaSubst.apply_subst subst pty in
let equality = CicMetaSubst.apply_subst subst equality in
let abstr_gty =
ProofEngineReduction.replace_lifting_csc 0
let exact_proof =
C.Appl [eq_ind ; ty ; t2 ; pred ; arg ; t1 ;equality]
in
- let (proof',goals) =
- PET.apply_tactic
- (tac ~term:exact_proof newtyp) ((curi,metasenv',pbo,pty),goal)
- in
- let goals =
- goals@(ProofEngineHelpers.compare_metasenvs ~oldmetasenv:metasenv
- ~newmetasenv:metasenv')
- in
- (proof',goals)
+ try
+ let (proof',goals) =
+ PET.apply_tactic
+ (tac ~term:exact_proof newtyp) ((curi,metasenv',pbo,pty),goal)
+ in
+ let goals =
+ goals@(ProofEngineHelpers.compare_metasenvs ~oldmetasenv:metasenv
+ ~newmetasenv:metasenv')
+ in
+ (proof',goals)
+ with (* FG: this should be PET.Fail _ *)
+ TC.TypeCheckerFailure _ -> PET.apply_tactic (P.letout_tac ()) status
in
ProofEngineTypes.mk_tactic (_rewrite_tac ~direction ~pattern equality)
let replace_tac ~(pattern: ProofEngineTypes.lazy_pattern) ~with_what status =
let _wanted, hyps_pat, concl_pat = pattern in
let (proof, goal) = status in
- let module C = Cic in
- let module U = UriManager in
- let module P = PrimitiveTactics in
- let module T = Tacticals in
let uri,metasenv,pbo,pty = proof in
let (_,context,ty) as conjecture = CicUtil.lookup_meta goal metasenv in
assert (hyps_pat = []); (*CSC: not implemented yet *)
+ let eq_URI =
+ match LibraryObjects.eq_URI () with
+ Some uri -> uri
+ | None -> raise (ProofEngineTypes.Fail (lazy "You need to register the default equality first. Please use the \"default\" command"))
+ in
let context_len = List.length context in
let subst,metasenv,u,_,selected_terms_with_context =
ProofEngineHelpers.select ~metasenv ~ugraph:CicUniv.empty_ugraph
~start:(
P.cut_tac
(C.Appl [
- (C.MutInd (LibraryObjects.eq_URI (), 0, [])) ;
+ (C.MutInd (eq_URI, 0, [])) ;
ty_of_with_what ;
what ;
with_what]))
(function ((proof,goal) as status) ->
let _,metasenv,_,_ = proof in
let _,context,_ = CicUtil.lookup_meta goal metasenv in
- let hyp =
+ let hyps =
try
match List.hd context with
- Some (Cic.Name name,_) -> name
+ Some (Cic.Name name,_) -> [name]
| _ -> assert false
with (Failure "hd") -> assert false
in
ProofEngineTypes.apply_tactic
- (ProofEngineStructuralRules.clear ~hyp) status))
+ (ProofEngineStructuralRules.clear ~hyps) status))
~continuation:(aux_tac (n + 1) tl));
T.id_tac])
status
let symmetry_tac =
let symmetry_tac (proof, goal) =
- let module C = Cic in
- let module R = CicReduction in
- let module U = UriManager in
let (_,metasenv,_,_) = proof in
let metano,context,ty = CicUtil.lookup_meta goal metasenv in
match (R.whd context ty) with
let transitivity_tac ~term =
let transitivity_tac ~term status =
let (proof, goal) = status in
- let module C = Cic in
- let module R = CicReduction in
- let module U = UriManager in
- let module T = Tacticals in
let (_,metasenv,_,_) = proof in
let metano,context,ty = CicUtil.lookup_meta goal metasenv in
match (R.whd context ty) with
ProofEngineTypes.mk_tactic (transitivity_tac ~term)
;;
+(* FG *)
+
+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 map self = function
+ | Some (C.Name s, _) when s <> self -> Some (s, hole)
+ | _ -> None
+ 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 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 pattern = None, PEH.list_rev_map_filter (map hyp) context, Some hole in
+ let start = rewrite_tac ~direction ~pattern what in
+ let continuation = PESR.clear ~hyps:[hyp; var] in
+ let tac = T.then_ ~start ~continuation in
+ PET.apply_tactic tac status
+ in
+ PET.mk_tactic subst_tac