TFL/post.sml
author wenzelm
Fri, 30 Apr 1999 18:08:58 +0200
changeset 6554 5be3f13193d7
parent 6524 13410ecfce0b
child 7262 a05dc63ca29b
permissions -rw-r--r--
tuned defer_recdef interfaces;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
3302
404fe31fd8d2 New headers and other minor changes
paulson
parents: 3271
diff changeset
     1
(*  Title:      TFL/post
404fe31fd8d2 New headers and other minor changes
paulson
parents: 3271
diff changeset
     2
    ID:         $Id$
404fe31fd8d2 New headers and other minor changes
paulson
parents: 3271
diff changeset
     3
    Author:     Konrad Slind, Cambridge University Computer Laboratory
404fe31fd8d2 New headers and other minor changes
paulson
parents: 3271
diff changeset
     4
    Copyright   1997  University of Cambridge
404fe31fd8d2 New headers and other minor changes
paulson
parents: 3271
diff changeset
     5
404fe31fd8d2 New headers and other minor changes
paulson
parents: 3271
diff changeset
     6
Postprocessing of TFL definitions
404fe31fd8d2 New headers and other minor changes
paulson
parents: 3271
diff changeset
     7
*)
404fe31fd8d2 New headers and other minor changes
paulson
parents: 3271
diff changeset
     8
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
     9
signature TFL = 
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
    10
  sig
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    11
   structure Prim : TFL_sig
6524
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
    12
   val quiet_mode : bool ref
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
    13
   val message : string -> unit
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    14
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
    15
   val tgoalw : theory -> thm list -> thm list -> thm list
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
    16
   val tgoal: theory -> thm list -> thm list
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    17
3405
2cccd0e3e9ea Numerous simplifications and removal of HOL-isms
paulson
parents: 3391
diff changeset
    18
   val std_postprocessor : simpset -> theory 
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    19
                           -> {induction:thm, rules:thm, TCs:term list list} 
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    20
                           -> {induction:thm, rules:thm, nested_tcs:thm list}
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    21
6554
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
    22
   val define_i : theory -> string -> term -> term list
3405
2cccd0e3e9ea Numerous simplifications and removal of HOL-isms
paulson
parents: 3391
diff changeset
    23
                  -> theory * Prim.pattern list
3331
c81c7f8ad333 Now checks the name of the function being defined
paulson
parents: 3302
diff changeset
    24
6554
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
    25
   val define   : theory -> string -> string -> string list
3331
c81c7f8ad333 Now checks the name of the function being defined
paulson
parents: 3302
diff changeset
    26
                  -> theory * Prim.pattern list
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    27
6554
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
    28
   val defer_i : theory -> string
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    29
                  -> thm list (* congruence rules *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    30
                  -> term list -> theory * thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    31
6554
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
    32
   val defer : theory -> string
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    33
                  -> thm list 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    34
                  -> string list -> theory * thm
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    35
3459
112cbb8301dc Removal of structure Context and its replacement by a theorem list of
paulson
parents: 3405
diff changeset
    36
   val simplify_defn : simpset * thm list 
112cbb8301dc Removal of structure Context and its replacement by a theorem list of
paulson
parents: 3405
diff changeset
    37
                        -> theory * (string * Prim.pattern list)
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
    38
                        -> {rules:thm list, induct:thm, tcs:term list}
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    39
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
    40
  end;
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
    41
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
    42
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
    43
structure Tfl: TFL =
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    44
struct
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    45
 structure Prim = Prim
3391
5e45dd3b64e9 More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents: 3331
diff changeset
    46
 structure S = USyntax
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    47
6524
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
    48
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
    49
 (* messages *)
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
    50
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
    51
 val quiet_mode = ref false;
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
    52
 fun message s = if ! quiet_mode then () else writeln s;
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
    53
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    54
 val trace = Prim.trace
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    55
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    56
 (*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    57
  * Extract termination goals so that they can be put it into a goalstack, or 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    58
  * have a tactic directly applied to them.
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    59
  *--------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    60
 fun termination_goals rules = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    61
     map (#1 o Type.freeze_thaw o HOLogic.dest_Trueprop)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    62
       (foldr (fn (th,A) => union_term (prems_of th, A)) (rules, []));
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
    63
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    64
 (*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    65
  * Finds the termination conditions in (highly massaged) definition and 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    66
  * puts them into a goalstack.
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    67
  *--------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    68
 fun tgoalw thy defs rules = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    69
   case termination_goals rules of
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    70
       [] => error "tgoalw: no termination conditions to prove"
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    71
     | L  => goalw_cterm defs 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    72
	       (Thm.cterm_of (Theory.sign_of thy) 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    73
			 (HOLogic.mk_Trueprop(USyntax.list_mk_conj L)));
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    74
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    75
 fun tgoal thy = tgoalw thy [];
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    76
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    77
 (*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    78
 * Three postprocessors are applied to the definition.  It
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    79
 * attempts to prove wellfoundedness of the given relation, simplifies the
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    80
 * non-proved termination conditions, and finally attempts to prove the 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    81
 * simplified termination conditions.
3405
2cccd0e3e9ea Numerous simplifications and removal of HOL-isms
paulson
parents: 3391
diff changeset
    82
 *--------------------------------------------------------------------------*)
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    83
 fun std_postprocessor ss =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    84
   Prim.postprocess
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    85
    {WFtac      = REPEAT (ares_tac [wf_empty, wf_pred_nat, 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    86
				    wf_measure, wf_inv_image, 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    87
				    wf_lex_prod, wf_less_than, wf_trancl] 1),
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    88
     terminator = asm_simp_tac ss 1
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    89
		  THEN TRY(CLASET' (fn cs => best_tac
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    90
			   (cs addSDs [not0_implies_Suc] addss ss)) 1),
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    91
     simplifier = Rules.simpl_conv ss []};
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    92
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    93
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    94
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    95
 val concl = #2 o Rules.dest_thm;
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
    96
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    97
 (*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    98
  * Defining a function with an associated termination relation. 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
    99
  *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   100
 fun define_i thy fid R eqs = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   101
   let val {functional,pats} = Prim.mk_functional thy eqs
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   102
   in (Prim.wfrec_definition0 thy (Sign.base_name fid) R functional, pats)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   103
   end;
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   104
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   105
 fun define thy fid R eqs = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   106
   let fun read thy = readtm (Theory.sign_of thy) (TVar(("DUMMY",0),[])) 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   107
   in  define_i thy fid (read thy R) (map (read thy) eqs)  end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   108
   handle Utils.ERR {mesg,...} => error mesg;
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   109
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   110
(*---------------------------------------------------------------------------
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   111
 * Postprocess a definition made by "define". This is a separate stage of 
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   112
 * processing from the definition stage.
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
   113
 *---------------------------------------------------------------------------*)
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   114
 local 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   115
 structure R = Rules
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   116
 structure U = Utils
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
   117
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   118
 (* The rest of these local definitions are for the tricky nested case *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   119
 val solved = not o U.can S.dest_eq o #2 o S.strip_forall o concl
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
   120
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   121
 fun id_thm th = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   122
    let val {lhs,rhs} = S.dest_eq(#2(S.strip_forall(#2 (R.dest_thm th))))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   123
    in lhs aconv rhs
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   124
    end handle _ => false
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
   125
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   126
 fun prover s = prove_goal HOL.thy s (fn _ => [fast_tac HOL_cs 1]);
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   127
 val P_imp_P_iff_True = prover "P --> (P= True)" RS mp;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   128
 val P_imp_P_eq_True = P_imp_P_iff_True RS eq_reflection;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   129
 fun mk_meta_eq r = case concl_of r of
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   130
      Const("==",_)$_$_ => r
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   131
   |   _ $(Const("op =",_)$_$_) => r RS eq_reflection
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   132
   |   _ => r RS P_imp_P_eq_True
3405
2cccd0e3e9ea Numerous simplifications and removal of HOL-isms
paulson
parents: 3391
diff changeset
   133
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   134
 (*Is this the best way to invoke the simplifier??*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   135
 fun rewrite L = rewrite_rule (map mk_meta_eq (filter(not o id_thm) L))
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
   136
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   137
 fun join_assums th = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   138
   let val {sign,...} = rep_thm th
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   139
       val tych = cterm_of sign
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   140
       val {lhs,rhs} = S.dest_eq(#2 (S.strip_forall (concl th)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   141
       val cntxtl = (#1 o S.strip_imp) lhs  (* cntxtl should = cntxtr *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   142
       val cntxtr = (#1 o S.strip_imp) rhs  (* but union is solider *)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   143
       val cntxt = gen_union (op aconv) (cntxtl, cntxtr)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   144
   in 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   145
     R.GEN_ALL 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   146
       (R.DISCH_ALL 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   147
	  (rewrite (map (R.ASSUME o tych) cntxt) (R.SPEC_ALL th)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   148
   end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   149
   val gen_all = S.gen_all
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   150
 in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   151
 fun proof_stage ss theory {f, R, rules, full_pats_TCs, TCs} =
6524
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
   152
   let val dummy = message "Proving induction theorem ..."
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   153
       val ind = Prim.mk_induction theory 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   154
                    {fconst=f, R=R, SV=[], pat_TCs_list=full_pats_TCs}
6524
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
   155
       val dummy = (message "Proved induction theorem."; message "Postprocessing ...");
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   156
       val {rules, induction, nested_tcs} = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   157
	   std_postprocessor ss theory {rules=rules, induction=ind, TCs=TCs}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   158
   in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   159
   case nested_tcs
6524
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
   160
   of [] => (message "Postprocessing done.";
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   161
	     {induction=induction, rules=rules,tcs=[]})
6524
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
   162
   | L  => let val dummy = message "Simplifying nested TCs ..."
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   163
	       val (solved,simplified,stubborn) =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   164
		U.itlist (fn th => fn (So,Si,St) =>
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   165
		      if (id_thm th) then (So, Si, th::St) else
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   166
		      if (solved th) then (th::So, Si, St) 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   167
		      else (So, th::Si, St)) nested_tcs ([],[],[])
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   168
	       val simplified' = map join_assums simplified
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   169
	       val rewr = full_simplify (ss addsimps (solved @ simplified'));
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   170
	       val induction' = rewr induction
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   171
	       and rules'     = rewr rules
6524
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
   172
	       val dummy = message "Postprocessing done."
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   173
	   in
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   174
	   {induction = induction',
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   175
		rules = rules',
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   176
		  tcs = map (gen_all o S.rhs o #2 o S.strip_forall o concl)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   177
			    (simplified@stubborn)}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   178
	   end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   179
   end;
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   180
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   181
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   182
 (*lcp: curry the predicate of the induction rule*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   183
 fun curry_rule rl = split_rule_var
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   184
			 (head_of (HOLogic.dest_Trueprop (concl_of rl)), 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   185
			  rl);
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   186
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   187
 (*lcp: put a theorem into Isabelle form, using meta-level connectives*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   188
 val meta_outer = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   189
     curry_rule o standard o 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   190
     rule_by_tactic (REPEAT 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   191
		     (FIRSTGOAL (resolve_tac [allI, impI, conjI]
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   192
				 ORELSE' etac conjE)));
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
   193
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   194
 (*Strip off the outer !P*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   195
 val spec'= read_instantiate [("x","P::?'b=>bool")] spec;
3459
112cbb8301dc Removal of structure Context and its replacement by a theorem list of
paulson
parents: 3405
diff changeset
   196
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   197
 val wf_rel_defs = [lex_prod_def, measure_def, inv_image_def];
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   198
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   199
 (*Convert conclusion from = to ==*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   200
 val eq_reflect_list = map (fn th => (th RS eq_reflection) handle _ => th);
3459
112cbb8301dc Removal of structure Context and its replacement by a theorem list of
paulson
parents: 3405
diff changeset
   201
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   202
 (*---------------------------------------------------------------------------
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   203
  * Install the basic context notions. Others (for nat and list and prod) 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   204
  * have already been added in thry.sml
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   205
  *---------------------------------------------------------------------------*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   206
 fun simplify_defn (ss, tflCongs) (thy,(id,pats)) =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   207
    let val dummy = deny (id mem (Sign.stamp_names_of (Theory.sign_of thy)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   208
			 ("Recursive definition " ^ id ^ 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   209
			  " would clash with the theory of the same name!")
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   210
	val def = freezeT(get_def thy id)   RS   meta_eq_to_obj_eq
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   211
	val {theory,rules,TCs,full_pats_TCs,patterns} = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   212
		 Prim.post_definition (Prim.congs tflCongs)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   213
		    (thy, (def,pats))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   214
	val {lhs=f,rhs} = S.dest_eq(concl def)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   215
	val (_,[R,_]) = S.strip_comb rhs
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   216
	val ss' = ss addsimps Prim.default_simps
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   217
	val {induction, rules, tcs} = 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   218
	      proof_stage ss' theory 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   219
		{f = f, R = R, rules = rules,
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   220
		 full_pats_TCs = full_pats_TCs,
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   221
		 TCs = TCs}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   222
	val rules' = map (standard o normalize_thm [RSmp]) (R.CONJUNCTS rules)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   223
    in  {induct = meta_outer
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   224
		   (normalize_thm [RSspec,RSmp] (induction RS spec')), 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   225
	 rules = rules', 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   226
	 tcs = (termination_goals rules') @ tcs}
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   227
    end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   228
   handle Utils.ERR {mesg,func,module} => 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   229
		error (mesg ^ 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   230
		       "\n    (In TFL function " ^ module ^ "." ^ func ^ ")");
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
   231
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   232
(*---------------------------------------------------------------------------
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   233
 *
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   234
 *     Definitions with synthesized termination relation
3191
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   235
 *
14bd6e5985f1 TFL now integrated with HOL (more work needed)
paulson
parents: 2467
diff changeset
   236
 *---------------------------------------------------------------------------*)
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   237
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   238
 local open USyntax
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   239
 in 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   240
 fun func_of_cond_eqn tm =
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   241
   #1(strip_comb(#lhs(dest_eq(#2 (strip_forall(#2(strip_imp tm)))))))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   242
 end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   243
6554
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
   244
 fun defer_i thy fid congs eqs = 
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
   245
  let val {rules,R,theory,full_pats_TCs,SV,...} = 
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
   246
	      Prim.lazyR_def thy (Sign.base_name fid) congs eqs
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   247
      val f = func_of_cond_eqn (concl(R.CONJUNCT1 rules handle _ => rules))
6524
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
   248
      val dummy = (message "Definition made."; message "Proving induction theorem ...");
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   249
      val induction = Prim.mk_induction theory 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   250
                         {fconst=f, R=R, SV=SV, pat_TCs_list=full_pats_TCs}
6524
13410ecfce0b proper quiet_mode;
wenzelm
parents: 6498
diff changeset
   251
      val dummy = message "Induction theorem proved."
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   252
  in (theory, 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   253
      (*return the conjoined induction rule and recursion equations, 
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   254
	with assumptions remaining to discharge*)
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   255
      standard (induction RS (rules RS conjI)))
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   256
  end
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   257
6554
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
   258
 fun defer thy fid congs seqs = 
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
   259
   let fun read thy = readtm (Theory.sign_of thy) (TVar(("DUMMY",0),[]))
5be3f13193d7 tuned defer_recdef interfaces;
wenzelm
parents: 6524
diff changeset
   260
   in  defer_i thy fid congs (map (read thy) seqs)  end
6498
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   261
   handle Utils.ERR {mesg,...} => error mesg;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   262
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   263
 end;
1ebbe18fe236 Now for recdefs that omit the WF relation;
paulson
parents: 6476
diff changeset
   264
2112
3902e9af752f Konrad Slind's TFL
paulson
parents:
diff changeset
   265
end;