src/Pure/thm.ML
author paulson
Wed Jul 23 11:54:32 1997 +0200 (1997-07-23)
changeset 3565 c64410e701fb
parent 3558 258eee1a056e
child 3577 9715b6e3ec5f
permissions -rw-r--r--
Now rename_params_rule merely issues warnings--and does nothing--if the
renaming cannot be performed. Previously it raised a fatal error.
wenzelm@250
     1
(*  Title:      Pure/thm.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@250
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
lcp@229
     4
    Copyright   1994  University of Cambridge
lcp@229
     5
wenzelm@1160
     6
The core of Isabelle's Meta Logic: certified types and terms, meta
paulson@1529
     7
theorems, meta rules (including resolution and simplification).
clasohm@0
     8
*)
clasohm@0
     9
wenzelm@250
    10
signature THM =
paulson@1503
    11
  sig
wenzelm@1160
    12
  (*certified types*)
wenzelm@387
    13
  type ctyp
wenzelm@1238
    14
  val rep_ctyp          : ctyp -> {sign: Sign.sg, T: typ}
wenzelm@1238
    15
  val typ_of            : ctyp -> typ
wenzelm@1238
    16
  val ctyp_of           : Sign.sg -> typ -> ctyp
wenzelm@1238
    17
  val read_ctyp         : Sign.sg -> string -> ctyp
wenzelm@1160
    18
wenzelm@1160
    19
  (*certified terms*)
wenzelm@1160
    20
  type cterm
clasohm@1493
    21
  exception CTERM of string
clasohm@1493
    22
  val rep_cterm         : cterm -> {sign: Sign.sg, t: term, T: typ,
clasohm@1493
    23
                                    maxidx: int}
wenzelm@1238
    24
  val term_of           : cterm -> term
wenzelm@1238
    25
  val cterm_of          : Sign.sg -> term -> cterm
paulson@2671
    26
  val ctyp_of_term      : cterm -> ctyp
wenzelm@1238
    27
  val read_cterm        : Sign.sg -> string * typ -> cterm
paulson@1394
    28
  val read_cterms       : Sign.sg -> string list * typ list -> cterm list
wenzelm@1238
    29
  val cterm_fun         : (term -> term) -> (cterm -> cterm)
clasohm@1493
    30
  val dest_comb         : cterm -> cterm * cterm
clasohm@1493
    31
  val dest_abs          : cterm -> cterm * cterm
clasohm@1703
    32
  val adjust_maxidx     : cterm -> cterm
clasohm@1516
    33
  val capply            : cterm -> cterm -> cterm
clasohm@1517
    34
  val cabs              : cterm -> cterm -> cterm
wenzelm@1238
    35
  val read_def_cterm    :
wenzelm@1160
    36
    Sign.sg * (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@1160
    37
    string list -> bool -> string * typ -> cterm * (indexname * typ) list
wenzelm@1160
    38
paulson@1529
    39
  (*theories*)
paulson@1529
    40
paulson@2671
    41
  (*proof terms [must DUPLICATE declaration as a specification]*)
paulson@1597
    42
  datatype deriv_kind = MinDeriv | ThmDeriv | FullDeriv;
wenzelm@2386
    43
  val keep_derivs       : deriv_kind ref
paulson@1529
    44
  datatype rule = 
wenzelm@2386
    45
      MinProof                          
paulson@1597
    46
    | Oracle of theory * Sign.sg * exn
paulson@2671
    47
    | Axiom               of theory * string
paulson@2671
    48
    | Theorem             of string       
paulson@2671
    49
    | Assume              of cterm
paulson@2671
    50
    | Implies_intr        of cterm
paulson@1529
    51
    | Implies_intr_shyps
paulson@1529
    52
    | Implies_intr_hyps
paulson@1529
    53
    | Implies_elim 
paulson@2671
    54
    | Forall_intr         of cterm
paulson@2671
    55
    | Forall_elim         of cterm
paulson@2671
    56
    | Reflexive           of cterm
paulson@1529
    57
    | Symmetric 
paulson@1529
    58
    | Transitive
paulson@2671
    59
    | Beta_conversion     of cterm
paulson@1529
    60
    | Extensional
paulson@2671
    61
    | Abstract_rule       of string * cterm
paulson@1529
    62
    | Combination
paulson@1529
    63
    | Equal_intr
paulson@1529
    64
    | Equal_elim
paulson@2671
    65
    | Trivial             of cterm
paulson@2671
    66
    | Lift_rule           of cterm * int 
paulson@2671
    67
    | Assumption          of int * Envir.env option
paulson@2671
    68
    | Rotate_rule         of int * int
paulson@2671
    69
    | Instantiate         of (indexname * ctyp) list * (cterm * cterm) list
paulson@2671
    70
    | Bicompose           of bool * bool * int * int * Envir.env
paulson@2671
    71
    | Flexflex_rule       of Envir.env            
paulson@2671
    72
    | Class_triv          of theory * class       
paulson@1529
    73
    | VarifyT
paulson@1529
    74
    | FreezeT
paulson@2671
    75
    | RewriteC            of cterm
paulson@2671
    76
    | CongC               of cterm
paulson@2671
    77
    | Rewrite_cterm       of cterm
paulson@2671
    78
    | Rename_params_rule  of string list * int;
paulson@1529
    79
paulson@1597
    80
  type deriv   (* = rule mtree *)
paulson@1529
    81
wenzelm@1160
    82
  (*meta theorems*)
wenzelm@1160
    83
  type thm
wenzelm@1160
    84
  exception THM of string * int * thm list
paulson@1529
    85
  val rep_thm           : thm -> {sign: Sign.sg, der: deriv, maxidx: int,
wenzelm@2386
    86
                                  shyps: sort list, hyps: term list, 
wenzelm@2386
    87
                                  prop: term}
paulson@1529
    88
  val crep_thm          : thm -> {sign: Sign.sg, der: deriv, maxidx: int,
wenzelm@2386
    89
                                  shyps: sort list, hyps: cterm list, 
wenzelm@2386
    90
                                  prop: cterm}
wenzelm@1238
    91
  val stamps_of_thm     : thm -> string ref list
wenzelm@1238
    92
  val tpairs_of         : thm -> (term * term) list
wenzelm@1238
    93
  val prems_of          : thm -> term list
wenzelm@1238
    94
  val nprems_of         : thm -> int
wenzelm@1238
    95
  val concl_of          : thm -> term
wenzelm@1238
    96
  val cprop_of          : thm -> cterm
wenzelm@1238
    97
  val extra_shyps       : thm -> sort list
wenzelm@3061
    98
  val force_strip_shyps : bool ref      (* FIXME tmp (since 1995/08/01) *)
wenzelm@1238
    99
  val strip_shyps       : thm -> thm
wenzelm@1238
   100
  val implies_intr_shyps: thm -> thm
wenzelm@1238
   101
  val get_axiom         : theory -> string -> thm
paulson@1597
   102
  val name_thm          : string * thm -> thm
wenzelm@1238
   103
  val axioms_of         : theory -> (string * thm) list
wenzelm@1160
   104
wenzelm@1160
   105
  (*meta rules*)
wenzelm@1238
   106
  val assume            : cterm -> thm
paulson@1416
   107
  val compress          : thm -> thm
wenzelm@1238
   108
  val implies_intr      : cterm -> thm -> thm
wenzelm@1238
   109
  val implies_elim      : thm -> thm -> thm
wenzelm@1238
   110
  val forall_intr       : cterm -> thm -> thm
wenzelm@1238
   111
  val forall_elim       : cterm -> thm -> thm
wenzelm@1238
   112
  val flexpair_def      : thm
wenzelm@1238
   113
  val reflexive         : cterm -> thm
wenzelm@1238
   114
  val symmetric         : thm -> thm
wenzelm@1238
   115
  val transitive        : thm -> thm -> thm
wenzelm@1238
   116
  val beta_conversion   : cterm -> thm
wenzelm@1238
   117
  val extensional       : thm -> thm
wenzelm@1238
   118
  val abstract_rule     : string -> cterm -> thm -> thm
wenzelm@1238
   119
  val combination       : thm -> thm -> thm
wenzelm@1238
   120
  val equal_intr        : thm -> thm -> thm
wenzelm@1238
   121
  val equal_elim        : thm -> thm -> thm
wenzelm@1238
   122
  val implies_intr_hyps : thm -> thm
wenzelm@1238
   123
  val flexflex_rule     : thm -> thm Sequence.seq
wenzelm@1238
   124
  val instantiate       :
wenzelm@1160
   125
    (indexname * ctyp) list * (cterm * cterm) list -> thm -> thm
wenzelm@1238
   126
  val trivial           : cterm -> thm
wenzelm@1238
   127
  val class_triv        : theory -> class -> thm
wenzelm@1238
   128
  val varifyT           : thm -> thm
wenzelm@1238
   129
  val freezeT           : thm -> thm
wenzelm@1238
   130
  val dest_state        : thm * int ->
wenzelm@1160
   131
    (term * term) list * term list * term * term
wenzelm@1238
   132
  val lift_rule         : (thm * int) -> thm -> thm
wenzelm@1238
   133
  val assumption        : int -> thm -> thm Sequence.seq
wenzelm@1238
   134
  val eq_assumption     : int -> thm -> thm
paulson@2671
   135
  val rotate_rule       : int -> int -> thm -> thm
wenzelm@1160
   136
  val rename_params_rule: string list * int -> thm -> thm
wenzelm@1238
   137
  val bicompose         : bool -> bool * thm * int ->
wenzelm@1160
   138
    int -> thm -> thm Sequence.seq
wenzelm@1238
   139
  val biresolution      : bool -> (bool * thm) list ->
wenzelm@1160
   140
    int -> thm -> thm Sequence.seq
wenzelm@1160
   141
wenzelm@1160
   142
  (*meta simplification*)
wenzelm@3550
   143
  exception SIMPLIFIER of string * thm
wenzelm@1160
   144
  type meta_simpset
wenzelm@3550
   145
  val dest_mss		: meta_simpset ->
wenzelm@3550
   146
    {simps: thm list, congs: thm list, procs: (string * cterm list) list}
wenzelm@1238
   147
  val empty_mss         : meta_simpset
wenzelm@3550
   148
  val merge_mss		: meta_simpset * meta_simpset -> meta_simpset
wenzelm@1238
   149
  val add_simps         : meta_simpset * thm list -> meta_simpset
wenzelm@1238
   150
  val del_simps         : meta_simpset * thm list -> meta_simpset
wenzelm@1238
   151
  val mss_of            : thm list -> meta_simpset
wenzelm@1238
   152
  val add_congs         : meta_simpset * thm list -> meta_simpset
oheimb@2626
   153
  val del_congs         : meta_simpset * thm list -> meta_simpset
wenzelm@2509
   154
  val add_simprocs	: meta_simpset *
wenzelm@3550
   155
    (string * cterm list * (Sign.sg -> term -> thm option) * stamp) list -> meta_simpset
wenzelm@2509
   156
  val del_simprocs	: meta_simpset *
wenzelm@3550
   157
    (string * cterm list * (Sign.sg -> term -> thm option) * stamp) list -> meta_simpset
wenzelm@1238
   158
  val add_prems         : meta_simpset * thm list -> meta_simpset
wenzelm@1238
   159
  val prems_of_mss      : meta_simpset -> thm list
wenzelm@1238
   160
  val set_mk_rews       : meta_simpset * (thm -> thm list) -> meta_simpset
wenzelm@1238
   161
  val mk_rews_of_mss    : meta_simpset -> thm -> thm list
wenzelm@2509
   162
  val set_termless      : meta_simpset * (term * term -> bool) -> meta_simpset
wenzelm@1238
   163
  val trace_simp        : bool ref
wenzelm@1238
   164
  val rewrite_cterm     : bool * bool -> meta_simpset ->
paulson@1529
   165
                          (meta_simpset -> thm -> thm option) -> cterm -> thm
paulson@1539
   166
wenzelm@2386
   167
  val invoke_oracle     : theory * Sign.sg * exn -> thm
wenzelm@250
   168
end;
clasohm@0
   169
wenzelm@3550
   170
structure Thm: THM =
clasohm@0
   171
struct
wenzelm@250
   172
wenzelm@387
   173
(*** Certified terms and types ***)
wenzelm@387
   174
wenzelm@250
   175
(** certified types **)
wenzelm@250
   176
wenzelm@250
   177
(*certified typs under a signature*)
wenzelm@250
   178
wenzelm@250
   179
datatype ctyp = Ctyp of {sign: Sign.sg, T: typ};
wenzelm@250
   180
wenzelm@250
   181
fun rep_ctyp (Ctyp args) = args;
wenzelm@250
   182
fun typ_of (Ctyp {T, ...}) = T;
wenzelm@250
   183
wenzelm@250
   184
fun ctyp_of sign T =
wenzelm@250
   185
  Ctyp {sign = sign, T = Sign.certify_typ sign T};
wenzelm@250
   186
wenzelm@250
   187
fun read_ctyp sign s =
wenzelm@250
   188
  Ctyp {sign = sign, T = Sign.read_typ (sign, K None) s};
lcp@229
   189
lcp@229
   190
lcp@229
   191
wenzelm@250
   192
(** certified terms **)
lcp@229
   193
wenzelm@250
   194
(*certified terms under a signature, with checked typ and maxidx of Vars*)
lcp@229
   195
wenzelm@250
   196
datatype cterm = Cterm of {sign: Sign.sg, t: term, T: typ, maxidx: int};
lcp@229
   197
lcp@229
   198
fun rep_cterm (Cterm args) = args;
wenzelm@250
   199
fun term_of (Cterm {t, ...}) = t;
lcp@229
   200
paulson@2671
   201
fun ctyp_of_term (Cterm {sign, T, ...}) = Ctyp {sign=sign, T=T};
paulson@2671
   202
wenzelm@250
   203
(*create a cterm by checking a "raw" term with respect to a signature*)
wenzelm@250
   204
fun cterm_of sign tm =
wenzelm@250
   205
  let val (t, T, maxidx) = Sign.certify_term sign tm
paulson@1394
   206
  in  Cterm {sign = sign, t = t, T = T, maxidx = maxidx}
paulson@1394
   207
  end;
lcp@229
   208
wenzelm@250
   209
fun cterm_fun f (Cterm {sign, t, ...}) = cterm_of sign (f t);
wenzelm@250
   210
lcp@229
   211
clasohm@1493
   212
exception CTERM of string;
clasohm@1493
   213
clasohm@1493
   214
(*Destruct application in cterms*)
clasohm@1493
   215
fun dest_comb (Cterm{sign, T, maxidx, t = A $ B}) =
clasohm@1493
   216
      let val typeA = fastype_of A;
clasohm@1493
   217
          val typeB =
clasohm@1493
   218
            case typeA of Type("fun",[S,T]) => S
clasohm@1493
   219
                        | _ => error "Function type expected in dest_comb";
clasohm@1493
   220
      in
clasohm@1493
   221
      (Cterm {sign=sign, maxidx=maxidx, t=A, T=typeA},
clasohm@1493
   222
       Cterm {sign=sign, maxidx=maxidx, t=B, T=typeB})
clasohm@1493
   223
      end
clasohm@1493
   224
  | dest_comb _ = raise CTERM "dest_comb";
clasohm@1493
   225
clasohm@1493
   226
(*Destruct abstraction in cterms*)
clasohm@1516
   227
fun dest_abs (Cterm {sign, T as Type("fun",[_,S]), maxidx, t=Abs(x,ty,M)}) = 
clasohm@1516
   228
      let val (y,N) = variant_abs (x,ty,M)
clasohm@1516
   229
      in (Cterm {sign = sign, T = ty, maxidx = 0, t = Free(y,ty)},
clasohm@1516
   230
          Cterm {sign = sign, T = S, maxidx = maxidx, t = N})
clasohm@1493
   231
      end
clasohm@1493
   232
  | dest_abs _ = raise CTERM "dest_abs";
clasohm@1493
   233
paulson@2147
   234
(*Makes maxidx precise: it is often too big*)
paulson@2147
   235
fun adjust_maxidx (ct as Cterm {sign, T, t, maxidx, ...}) =
paulson@2147
   236
  if maxidx = ~1 then ct 
paulson@2147
   237
  else  Cterm {sign = sign, T = T, maxidx = maxidx_of_term t, t = t};
clasohm@1703
   238
clasohm@1516
   239
(*Form cterm out of a function and an argument*)
clasohm@1516
   240
fun capply (Cterm {t=f, sign=sign1, T=Type("fun",[dty,rty]), maxidx=maxidx1})
clasohm@1516
   241
           (Cterm {t=x, sign=sign2, T, maxidx=maxidx2}) =
clasohm@1516
   242
      if T = dty then Cterm{t=f$x, sign=Sign.merge(sign1,sign2), T=rty,
paulson@2147
   243
                            maxidx=Int.max(maxidx1, maxidx2)}
clasohm@1516
   244
      else raise CTERM "capply: types don't agree"
clasohm@1516
   245
  | capply _ _ = raise CTERM "capply: first arg is not a function"
wenzelm@250
   246
clasohm@1517
   247
fun cabs (Cterm {t=Free(a,ty), sign=sign1, T=T1, maxidx=maxidx1})
clasohm@1517
   248
         (Cterm {t=t2, sign=sign2, T=T2, maxidx=maxidx2}) =
clasohm@1517
   249
      Cterm {t=absfree(a,ty,t2), sign=Sign.merge(sign1,sign2),
paulson@2147
   250
             T = ty --> T2, maxidx=Int.max(maxidx1, maxidx2)}
clasohm@1517
   251
  | cabs _ _ = raise CTERM "cabs: first arg is not a free variable";
lcp@229
   252
wenzelm@2509
   253
wenzelm@2509
   254
wenzelm@574
   255
(** read cterms **)   (*exception ERROR*)
wenzelm@250
   256
wenzelm@250
   257
(*read term, infer types, certify term*)
nipkow@949
   258
fun read_def_cterm (sign, types, sorts) used freeze (a, T) =
wenzelm@250
   259
  let
wenzelm@574
   260
    val T' = Sign.certify_typ sign T
wenzelm@574
   261
      handle TYPE (msg, _, _) => error msg;
clasohm@623
   262
    val ts = Syntax.read (#syn (Sign.rep_sg sign)) T' a;
nipkow@949
   263
    val (_, t', tye) =
clasohm@959
   264
          Sign.infer_types sign types sorts used freeze (ts, T');
wenzelm@574
   265
    val ct = cterm_of sign t'
wenzelm@2979
   266
      handle TYPE (msg, _, _) => error msg
wenzelm@2386
   267
           | TERM (msg, _) => error msg;
wenzelm@250
   268
  in (ct, tye) end;
lcp@229
   269
nipkow@949
   270
fun read_cterm sign = #1 o read_def_cterm (sign, K None, K None) [] true;
lcp@229
   271
paulson@1394
   272
(*read a list of terms, matching them against a list of expected types.
paulson@1394
   273
  NO disambiguation of alternative parses via type-checking -- it is just
paulson@1394
   274
  not practical.*)
paulson@1394
   275
fun read_cterms sign (bs, Ts) =
paulson@1394
   276
  let
wenzelm@2979
   277
    val {tsig, syn, ...} = Sign.rep_sg sign;
wenzelm@2979
   278
    fun read (b, T) =
wenzelm@2979
   279
      (case Syntax.read syn T b of
wenzelm@2979
   280
        [t] => t
wenzelm@2979
   281
      | _  => error ("Error or ambiguity in parsing of " ^ b));
wenzelm@2979
   282
wenzelm@2979
   283
    val prt = setmp Syntax.show_brackets true (Sign.pretty_term sign);
wenzelm@2979
   284
    val prT = Sign.pretty_typ sign;
wenzelm@2979
   285
    val (us, _) =
wenzelm@2979
   286
      Type.infer_types prt prT tsig (Sign.const_type sign)
wenzelm@2979
   287
        (K None) (K None) [] true (map (Sign.certify_typ sign) Ts)
wenzelm@2979
   288
        (ListPair.map read (bs, Ts));
wenzelm@2979
   289
  in map (cterm_of sign) us end
wenzelm@2979
   290
  handle TYPE (msg, _, _) => error msg
paulson@1394
   291
       | TERM (msg, _) => error msg;
paulson@1394
   292
wenzelm@250
   293
wenzelm@250
   294
paulson@1529
   295
(*** Derivations ***)
paulson@1529
   296
paulson@1529
   297
(*Names of rules in derivations.  Includes logically trivial rules, if 
paulson@1529
   298
  executed in ML.*)
paulson@1529
   299
datatype rule = 
wenzelm@2386
   300
    MinProof                            (*for building minimal proof terms*)
wenzelm@2386
   301
  | Oracle              of theory * Sign.sg * exn       (*oracles*)
paulson@1529
   302
(*Axioms/theorems*)
wenzelm@2386
   303
  | Axiom               of theory * string
wenzelm@2386
   304
  | Theorem             of string
paulson@1529
   305
(*primitive inferences and compound versions of them*)
wenzelm@2386
   306
  | Assume              of cterm
wenzelm@2386
   307
  | Implies_intr        of cterm
paulson@1529
   308
  | Implies_intr_shyps
paulson@1529
   309
  | Implies_intr_hyps
paulson@1529
   310
  | Implies_elim 
wenzelm@2386
   311
  | Forall_intr         of cterm
wenzelm@2386
   312
  | Forall_elim         of cterm
wenzelm@2386
   313
  | Reflexive           of cterm
paulson@1529
   314
  | Symmetric 
paulson@1529
   315
  | Transitive
wenzelm@2386
   316
  | Beta_conversion     of cterm
paulson@1529
   317
  | Extensional
wenzelm@2386
   318
  | Abstract_rule       of string * cterm
paulson@1529
   319
  | Combination
paulson@1529
   320
  | Equal_intr
paulson@1529
   321
  | Equal_elim
paulson@1529
   322
(*derived rules for tactical proof*)
wenzelm@2386
   323
  | Trivial             of cterm
wenzelm@2386
   324
        (*For lift_rule, the proof state is not a premise.
wenzelm@2386
   325
          Use cterm instead of thm to avoid mutual recursion.*)
wenzelm@2386
   326
  | Lift_rule           of cterm * int 
wenzelm@2386
   327
  | Assumption          of int * Envir.env option (*includes eq_assumption*)
paulson@2671
   328
  | Rotate_rule         of int * int
wenzelm@2386
   329
  | Instantiate         of (indexname * ctyp) list * (cterm * cterm) list
wenzelm@2386
   330
  | Bicompose           of bool * bool * int * int * Envir.env
wenzelm@2386
   331
  | Flexflex_rule       of Envir.env            (*identifies unifier chosen*)
paulson@1529
   332
(*other derived rules*)
wenzelm@2509
   333
  | Class_triv          of theory * class
paulson@1529
   334
  | VarifyT
paulson@1529
   335
  | FreezeT
paulson@1529
   336
(*for the simplifier*)
wenzelm@2386
   337
  | RewriteC            of cterm
wenzelm@2386
   338
  | CongC               of cterm
wenzelm@2386
   339
  | Rewrite_cterm       of cterm
paulson@1529
   340
(*Logical identities, recorded since they are part of the proof process*)
wenzelm@2386
   341
  | Rename_params_rule  of string list * int;
paulson@1529
   342
paulson@1529
   343
paulson@1597
   344
type deriv = rule mtree;
paulson@1529
   345
paulson@1597
   346
datatype deriv_kind = MinDeriv | ThmDeriv | FullDeriv;
paulson@1529
   347
paulson@1597
   348
val keep_derivs = ref MinDeriv;
paulson@1529
   349
paulson@1529
   350
paulson@1597
   351
(*Build a minimal derivation.  Keep oracles; suppress atomic inferences;
paulson@1597
   352
  retain Theorems or their underlying links; keep anything else*)
paulson@1597
   353
fun squash_derivs [] = []
paulson@1597
   354
  | squash_derivs (der::ders) =
paulson@1597
   355
     (case der of
wenzelm@2386
   356
          Join (Oracle _, _) => der :: squash_derivs ders
wenzelm@2386
   357
        | Join (Theorem _, [der']) => if !keep_derivs=ThmDeriv 
wenzelm@2386
   358
                                      then der :: squash_derivs ders
wenzelm@2386
   359
                                      else squash_derivs (der'::ders)
wenzelm@2386
   360
        | Join (Axiom _, _) => if !keep_derivs=ThmDeriv 
wenzelm@2386
   361
                               then der :: squash_derivs ders
wenzelm@2386
   362
                               else squash_derivs ders
wenzelm@2386
   363
        | Join (_, [])      => squash_derivs ders
wenzelm@2386
   364
        | _                 => der :: squash_derivs ders);
paulson@1597
   365
paulson@1529
   366
paulson@1529
   367
(*Ensure sharing of the most likely derivation, the empty one!*)
paulson@1597
   368
val min_infer = Join (MinProof, []);
paulson@1529
   369
paulson@1529
   370
(*Make a minimal inference*)
paulson@1529
   371
fun make_min_infer []    = min_infer
paulson@1529
   372
  | make_min_infer [der] = der
paulson@1597
   373
  | make_min_infer ders  = Join (MinProof, ders);
paulson@1529
   374
paulson@1597
   375
fun infer_derivs (rl, [])   = Join (rl, [])
paulson@1529
   376
  | infer_derivs (rl, ders) =
paulson@1597
   377
    if !keep_derivs=FullDeriv then Join (rl, ders)
paulson@1529
   378
    else make_min_infer (squash_derivs ders);
paulson@1529
   379
paulson@1529
   380
wenzelm@2509
   381
wenzelm@387
   382
(*** Meta theorems ***)
lcp@229
   383
clasohm@0
   384
datatype thm = Thm of
wenzelm@2386
   385
  {sign: Sign.sg,               (*signature for hyps and prop*)
wenzelm@2386
   386
   der: deriv,                  (*derivation*)
wenzelm@2386
   387
   maxidx: int,                 (*maximum index of any Var or TVar*)
wenzelm@2386
   388
   shyps: sort list,            (*sort hypotheses*)
wenzelm@2386
   389
   hyps: term list,             (*hypotheses*)
wenzelm@2386
   390
   prop: term};                 (*conclusion*)
clasohm@0
   391
wenzelm@250
   392
fun rep_thm (Thm args) = args;
clasohm@0
   393
paulson@1529
   394
(*Version of rep_thm returning cterms instead of terms*)
paulson@1529
   395
fun crep_thm (Thm {sign, der, maxidx, shyps, hyps, prop}) =
paulson@1529
   396
  let fun ctermf max t = Cterm{sign=sign, t=t, T=propT, maxidx=max};
paulson@1529
   397
  in {sign=sign, der=der, maxidx=maxidx, shyps=shyps,
paulson@1529
   398
      hyps = map (ctermf ~1) hyps,
paulson@1529
   399
      prop = ctermf maxidx prop}
clasohm@1517
   400
  end;
clasohm@1517
   401
wenzelm@387
   402
(*errors involving theorems*)
clasohm@0
   403
exception THM of string * int * thm list;
clasohm@0
   404
wenzelm@387
   405
paulson@1597
   406
val stamps_of_thm = #stamps o Sign.rep_sg o #sign o rep_thm;
clasohm@0
   407
wenzelm@387
   408
(*merge signatures of two theorems; raise exception if incompatible*)
wenzelm@387
   409
fun merge_thm_sgs (th1, th2) =
paulson@1597
   410
  Sign.merge (pairself (#sign o rep_thm) (th1, th2))
wenzelm@574
   411
    handle TERM (msg, _) => raise THM (msg, 0, [th1, th2]);
wenzelm@387
   412
wenzelm@387
   413
wenzelm@387
   414
(*maps object-rule to tpairs*)
wenzelm@387
   415
fun tpairs_of (Thm {prop, ...}) = #1 (Logic.strip_flexpairs prop);
wenzelm@387
   416
wenzelm@387
   417
(*maps object-rule to premises*)
wenzelm@387
   418
fun prems_of (Thm {prop, ...}) =
wenzelm@387
   419
  Logic.strip_imp_prems (Logic.skip_flexpairs prop);
clasohm@0
   420
clasohm@0
   421
(*counts premises in a rule*)
wenzelm@387
   422
fun nprems_of (Thm {prop, ...}) =
wenzelm@387
   423
  Logic.count_prems (Logic.skip_flexpairs prop, 0);
clasohm@0
   424
wenzelm@387
   425
(*maps object-rule to conclusion*)
wenzelm@387
   426
fun concl_of (Thm {prop, ...}) = Logic.strip_imp_concl prop;
clasohm@0
   427
wenzelm@387
   428
(*the statement of any thm is a cterm*)
wenzelm@1160
   429
fun cprop_of (Thm {sign, maxidx, prop, ...}) =
wenzelm@387
   430
  Cterm {sign = sign, maxidx = maxidx, T = propT, t = prop};
lcp@229
   431
wenzelm@387
   432
clasohm@0
   433
wenzelm@1238
   434
(** sort contexts of theorems **)
wenzelm@1238
   435
wenzelm@1238
   436
(* basic utils *)
wenzelm@1238
   437
wenzelm@2163
   438
(*accumulate sorts suppressing duplicates; these are coded low levelly
wenzelm@1238
   439
  to improve efficiency a bit*)
wenzelm@1238
   440
wenzelm@1238
   441
fun add_typ_sorts (Type (_, Ts), Ss) = add_typs_sorts (Ts, Ss)
paulson@2177
   442
  | add_typ_sorts (TFree (_, S), Ss) = ins_sort(S,Ss)
paulson@2177
   443
  | add_typ_sorts (TVar (_, S), Ss) = ins_sort(S,Ss)
wenzelm@1238
   444
and add_typs_sorts ([], Ss) = Ss
wenzelm@1238
   445
  | add_typs_sorts (T :: Ts, Ss) = add_typs_sorts (Ts, add_typ_sorts (T, Ss));
wenzelm@1238
   446
wenzelm@1238
   447
fun add_term_sorts (Const (_, T), Ss) = add_typ_sorts (T, Ss)
wenzelm@1238
   448
  | add_term_sorts (Free (_, T), Ss) = add_typ_sorts (T, Ss)
wenzelm@1238
   449
  | add_term_sorts (Var (_, T), Ss) = add_typ_sorts (T, Ss)
wenzelm@1238
   450
  | add_term_sorts (Bound _, Ss) = Ss
paulson@2177
   451
  | add_term_sorts (Abs (_,T,t), Ss) = add_term_sorts (t, add_typ_sorts (T,Ss))
wenzelm@1238
   452
  | add_term_sorts (t $ u, Ss) = add_term_sorts (t, add_term_sorts (u, Ss));
wenzelm@1238
   453
wenzelm@1238
   454
fun add_terms_sorts ([], Ss) = Ss
paulson@2177
   455
  | add_terms_sorts (t::ts, Ss) = add_terms_sorts (ts, add_term_sorts (t,Ss));
wenzelm@1238
   456
wenzelm@1258
   457
fun env_codT (Envir.Envir {iTs, ...}) = map snd iTs;
wenzelm@1258
   458
wenzelm@1258
   459
fun add_env_sorts (env, Ss) =
wenzelm@1258
   460
  add_terms_sorts (map snd (Envir.alist_of env),
wenzelm@1258
   461
    add_typs_sorts (env_codT env, Ss));
wenzelm@1258
   462
wenzelm@1238
   463
fun add_thm_sorts (Thm {hyps, prop, ...}, Ss) =
wenzelm@1238
   464
  add_terms_sorts (hyps, add_term_sorts (prop, Ss));
wenzelm@1238
   465
wenzelm@1238
   466
fun add_thms_shyps ([], Ss) = Ss
wenzelm@1238
   467
  | add_thms_shyps (Thm {shyps, ...} :: ths, Ss) =
paulson@2177
   468
      add_thms_shyps (ths, union_sort(shyps,Ss));
wenzelm@1238
   469
wenzelm@1238
   470
wenzelm@1238
   471
(*get 'dangling' sort constraints of a thm*)
wenzelm@1238
   472
fun extra_shyps (th as Thm {shyps, ...}) =
wenzelm@1238
   473
  shyps \\ add_thm_sorts (th, []);
wenzelm@1238
   474
wenzelm@1238
   475
wenzelm@1238
   476
(* fix_shyps *)
wenzelm@1238
   477
wenzelm@1238
   478
(*preserve sort contexts of rule premises and substituted types*)
wenzelm@1238
   479
fun fix_shyps thms Ts thm =
wenzelm@1238
   480
  let
paulson@1529
   481
    val Thm {sign, der, maxidx, hyps, prop, ...} = thm;
wenzelm@1238
   482
    val shyps =
wenzelm@1238
   483
      add_thm_sorts (thm, add_typs_sorts (Ts, add_thms_shyps (thms, [])));
wenzelm@1238
   484
  in
paulson@1529
   485
    Thm {sign = sign, 
wenzelm@2386
   486
         der = der,             (*No new derivation, as other rules call this*)
wenzelm@2386
   487
         maxidx = maxidx,
wenzelm@2386
   488
         shyps = shyps, hyps = hyps, prop = prop}
wenzelm@1238
   489
  end;
wenzelm@1238
   490
wenzelm@1238
   491
wenzelm@1238
   492
(* strip_shyps *)       (* FIXME improve? (e.g. only minimal extra sorts) *)
wenzelm@1238
   493
wenzelm@3061
   494
val force_strip_shyps = ref true;  (* FIXME tmp (since 1995/08/01) *)
wenzelm@1238
   495
wenzelm@1238
   496
(*remove extra sorts that are known to be syntactically non-empty*)
wenzelm@1238
   497
fun strip_shyps thm =
wenzelm@1238
   498
  let
paulson@1529
   499
    val Thm {sign, der, maxidx, shyps, hyps, prop} = thm;
wenzelm@1238
   500
    val sorts = add_thm_sorts (thm, []);
wenzelm@1238
   501
    val maybe_empty = not o Sign.nonempty_sort sign sorts;
paulson@2177
   502
    val shyps' = filter (fn S => mem_sort(S,sorts) orelse maybe_empty S) shyps;
wenzelm@1238
   503
  in
paulson@1529
   504
    Thm {sign = sign, der = der, maxidx = maxidx,
wenzelm@2386
   505
         shyps =
wenzelm@2386
   506
         (if eq_set_sort (shyps',sorts) orelse 
wenzelm@2386
   507
             not (!force_strip_shyps) then shyps'
wenzelm@3061
   508
          else    (* FIXME tmp (since 1995/08/01) *)
wenzelm@2386
   509
              (warning ("Removed sort hypotheses: " ^
wenzelm@2962
   510
                        commas (map Sorts.str_of_sort (shyps' \\ sorts)));
wenzelm@2386
   511
               warning "Let's hope these sorts are non-empty!";
wenzelm@1238
   512
           sorts)),
paulson@1529
   513
      hyps = hyps, 
paulson@1529
   514
      prop = prop}
wenzelm@1238
   515
  end;
wenzelm@1238
   516
wenzelm@1238
   517
wenzelm@1238
   518
(* implies_intr_shyps *)
wenzelm@1238
   519
wenzelm@1238
   520
(*discharge all extra sort hypotheses*)
wenzelm@1238
   521
fun implies_intr_shyps thm =
wenzelm@1238
   522
  (case extra_shyps thm of
wenzelm@1238
   523
    [] => thm
wenzelm@1238
   524
  | xshyps =>
wenzelm@1238
   525
      let
paulson@1529
   526
        val Thm {sign, der, maxidx, shyps, hyps, prop} = thm;
paulson@2182
   527
        val shyps' = ins_sort (logicS, shyps \\ xshyps);
wenzelm@1238
   528
        val used_names = foldr add_term_tfree_names (prop :: hyps, []);
wenzelm@1238
   529
        val names =
wenzelm@1238
   530
          tl (variantlist (replicate (length xshyps + 1) "'", used_names));
wenzelm@1238
   531
        val tfrees = map (TFree o rpair logicS) names;
wenzelm@1238
   532
wenzelm@1238
   533
        fun mk_insort (T, S) = map (Logic.mk_inclass o pair T) S;
paulson@2671
   534
        val sort_hyps = List.concat (map2 mk_insort (tfrees, xshyps));
wenzelm@1238
   535
      in
paulson@1529
   536
        Thm {sign = sign, 
wenzelm@2386
   537
             der = infer_derivs (Implies_intr_shyps, [der]), 
wenzelm@2386
   538
             maxidx = maxidx, 
wenzelm@2386
   539
             shyps = shyps',
wenzelm@2386
   540
             hyps = hyps, 
wenzelm@2386
   541
             prop = Logic.list_implies (sort_hyps, prop)}
wenzelm@1238
   542
      end);
wenzelm@1238
   543
wenzelm@1238
   544
paulson@1529
   545
(** Axioms **)
wenzelm@387
   546
wenzelm@387
   547
(*look up the named axiom in the theory*)
wenzelm@387
   548
fun get_axiom theory name =
wenzelm@387
   549
  let
wenzelm@387
   550
    fun get_ax [] = raise Match
paulson@1529
   551
      | get_ax (thy :: thys) =
wenzelm@2386
   552
          let val {sign, new_axioms, parents, ...} = rep_theory thy
paulson@1529
   553
          in case Symtab.lookup (new_axioms, name) of
wenzelm@2386
   554
                Some t => fix_shyps [] []
wenzelm@2386
   555
                           (Thm {sign = sign, 
wenzelm@2386
   556
                                 der = infer_derivs (Axiom(theory,name), []),
wenzelm@2386
   557
                                 maxidx = maxidx_of_term t,
wenzelm@2386
   558
                                 shyps = [], 
wenzelm@2386
   559
                                 hyps = [], 
wenzelm@2386
   560
                                 prop = t})
wenzelm@2386
   561
              | None => get_ax parents handle Match => get_ax thys
paulson@1529
   562
          end;
wenzelm@387
   563
  in
wenzelm@387
   564
    get_ax [theory] handle Match
wenzelm@387
   565
      => raise THEORY ("get_axiom: no axiom " ^ quote name, [theory])
wenzelm@387
   566
  end;
wenzelm@387
   567
paulson@1529
   568
wenzelm@776
   569
(*return additional axioms of this theory node*)
wenzelm@776
   570
fun axioms_of thy =
wenzelm@776
   571
  map (fn (s, _) => (s, get_axiom thy s))
wenzelm@776
   572
    (Symtab.dest (#new_axioms (rep_theory thy)));
wenzelm@776
   573
paulson@1597
   574
(*Attach a label to a theorem to make proof objects more readable*)
paulson@1597
   575
fun name_thm (name, th as Thm {sign, der, maxidx, shyps, hyps, prop}) = 
paulson@1597
   576
    Thm {sign = sign, 
wenzelm@2386
   577
         der = Join (Theorem name, [der]),
wenzelm@2386
   578
         maxidx = maxidx,
wenzelm@2386
   579
         shyps = shyps, 
wenzelm@2386
   580
         hyps = hyps, 
wenzelm@2386
   581
         prop = prop};
clasohm@0
   582
clasohm@0
   583
paulson@1529
   584
(*Compression of theorems -- a separate rule, not integrated with the others,
paulson@1529
   585
  as it could be slow.*)
paulson@1529
   586
fun compress (Thm {sign, der, maxidx, shyps, hyps, prop}) = 
paulson@1529
   587
    Thm {sign = sign, 
wenzelm@2386
   588
         der = der,     (*No derivation recorded!*)
wenzelm@2386
   589
         maxidx = maxidx,
wenzelm@2386
   590
         shyps = shyps, 
wenzelm@2386
   591
         hyps = map Term.compress_term hyps, 
wenzelm@2386
   592
         prop = Term.compress_term prop};
wenzelm@564
   593
wenzelm@387
   594
wenzelm@2509
   595
paulson@1529
   596
(*** Meta rules ***)
clasohm@0
   597
paulson@2147
   598
(*Check that term does not contain same var with different typing/sorting.
paulson@2147
   599
  If this check must be made, recalculate maxidx in hope of preventing its
paulson@2147
   600
  recurrence.*)
paulson@2147
   601
fun nodup_Vars (thm as Thm{sign, der, maxidx, shyps, hyps, prop}) s =
paulson@2147
   602
  (Sign.nodup_Vars prop; 
paulson@2147
   603
   Thm {sign = sign, 
wenzelm@2386
   604
         der = der,     
wenzelm@2386
   605
         maxidx = maxidx_of_term prop,
wenzelm@2386
   606
         shyps = shyps, 
wenzelm@2386
   607
         hyps = hyps, 
wenzelm@2386
   608
         prop = prop})
paulson@2147
   609
  handle TYPE(msg,Ts,ts) => raise TYPE(s^": "^msg,Ts,ts);
nipkow@1495
   610
wenzelm@1220
   611
(** 'primitive' rules **)
wenzelm@1220
   612
wenzelm@1220
   613
(*discharge all assumptions t from ts*)
clasohm@0
   614
val disch = gen_rem (op aconv);
clasohm@0
   615
wenzelm@1220
   616
(*The assumption rule A|-A in a theory*)
wenzelm@250
   617
fun assume ct : thm =
lcp@229
   618
  let val {sign, t=prop, T, maxidx} = rep_cterm ct
wenzelm@250
   619
  in  if T<>propT then
wenzelm@250
   620
        raise THM("assume: assumptions must have type prop", 0, [])
clasohm@0
   621
      else if maxidx <> ~1 then
wenzelm@250
   622
        raise THM("assume: assumptions may not contain scheme variables",
wenzelm@250
   623
                  maxidx, [])
paulson@1529
   624
      else Thm{sign   = sign, 
wenzelm@2386
   625
               der    = infer_derivs (Assume ct, []), 
wenzelm@2386
   626
               maxidx = ~1, 
wenzelm@2386
   627
               shyps  = add_term_sorts(prop,[]), 
wenzelm@2386
   628
               hyps   = [prop], 
wenzelm@2386
   629
               prop   = prop}
clasohm@0
   630
  end;
clasohm@0
   631
wenzelm@1220
   632
(*Implication introduction
wenzelm@3529
   633
    [A]
wenzelm@3529
   634
     :
wenzelm@3529
   635
     B
wenzelm@1220
   636
  -------
wenzelm@1220
   637
  A ==> B
wenzelm@1220
   638
*)
paulson@1529
   639
fun implies_intr cA (thB as Thm{sign,der,maxidx,hyps,prop,...}) : thm =
lcp@229
   640
  let val {sign=signA, t=A, T, maxidx=maxidxA} = rep_cterm cA
clasohm@0
   641
  in  if T<>propT then
wenzelm@250
   642
        raise THM("implies_intr: assumptions must have type prop", 0, [thB])
wenzelm@1238
   643
      else fix_shyps [thB] []
paulson@1529
   644
        (Thm{sign = Sign.merge (sign,signA),  
wenzelm@2386
   645
             der = infer_derivs (Implies_intr cA, [der]),
wenzelm@2386
   646
             maxidx = Int.max(maxidxA, maxidx),
wenzelm@2386
   647
             shyps = [],
wenzelm@2386
   648
             hyps = disch(hyps,A),
wenzelm@2386
   649
             prop = implies$A$prop})
clasohm@0
   650
      handle TERM _ =>
clasohm@0
   651
        raise THM("implies_intr: incompatible signatures", 0, [thB])
clasohm@0
   652
  end;
clasohm@0
   653
paulson@1529
   654
wenzelm@1220
   655
(*Implication elimination
wenzelm@1220
   656
  A ==> B    A
wenzelm@1220
   657
  ------------
wenzelm@1220
   658
        B
wenzelm@1220
   659
*)
clasohm@0
   660
fun implies_elim thAB thA : thm =
paulson@1529
   661
    let val Thm{maxidx=maxA, der=derA, hyps=hypsA, prop=propA,...} = thA
paulson@1529
   662
        and Thm{sign, der, maxidx, hyps, prop,...} = thAB;
wenzelm@250
   663
        fun err(a) = raise THM("implies_elim: "^a, 0, [thAB,thA])
clasohm@0
   664
    in  case prop of
wenzelm@250
   665
            imp$A$B =>
wenzelm@250
   666
                if imp=implies andalso  A aconv propA
wenzelm@1220
   667
                then fix_shyps [thAB, thA] []
wenzelm@1220
   668
                       (Thm{sign= merge_thm_sgs(thAB,thA),
wenzelm@2386
   669
                            der = infer_derivs (Implies_elim, [der,derA]),
wenzelm@2386
   670
                            maxidx = Int.max(maxA,maxidx),
wenzelm@2386
   671
                            shyps = [],
wenzelm@2386
   672
                            hyps = union_term(hypsA,hyps),  (*dups suppressed*)
wenzelm@2386
   673
                            prop = B})
wenzelm@250
   674
                else err("major premise")
wenzelm@250
   675
          | _ => err("major premise")
clasohm@0
   676
    end;
wenzelm@250
   677
wenzelm@1220
   678
(*Forall introduction.  The Free or Var x must not be free in the hypotheses.
wenzelm@1220
   679
    A
wenzelm@1220
   680
  -----
wenzelm@1220
   681
  !!x.A
wenzelm@1220
   682
*)
paulson@1529
   683
fun forall_intr cx (th as Thm{sign,der,maxidx,hyps,prop,...}) =
lcp@229
   684
  let val x = term_of cx;
wenzelm@1238
   685
      fun result(a,T) = fix_shyps [th] []
paulson@1529
   686
        (Thm{sign = sign, 
wenzelm@2386
   687
             der = infer_derivs (Forall_intr cx, [der]),
wenzelm@2386
   688
             maxidx = maxidx,
wenzelm@2386
   689
             shyps = [],
wenzelm@2386
   690
             hyps = hyps,
wenzelm@2386
   691
             prop = all(T) $ Abs(a, T, abstract_over (x,prop))})
clasohm@0
   692
  in  case x of
wenzelm@250
   693
        Free(a,T) =>
wenzelm@250
   694
          if exists (apl(x, Logic.occs)) hyps
wenzelm@250
   695
          then  raise THM("forall_intr: variable free in assumptions", 0, [th])
wenzelm@250
   696
          else  result(a,T)
clasohm@0
   697
      | Var((a,_),T) => result(a,T)
clasohm@0
   698
      | _ => raise THM("forall_intr: not a variable", 0, [th])
clasohm@0
   699
  end;
clasohm@0
   700
wenzelm@1220
   701
(*Forall elimination
wenzelm@1220
   702
  !!x.A
wenzelm@1220
   703
  ------
wenzelm@1220
   704
  A[t/x]
wenzelm@1220
   705
*)
paulson@1529
   706
fun forall_elim ct (th as Thm{sign,der,maxidx,hyps,prop,...}) : thm =
lcp@229
   707
  let val {sign=signt, t, T, maxidx=maxt} = rep_cterm ct
clasohm@0
   708
  in  case prop of
wenzelm@2386
   709
        Const("all",Type("fun",[Type("fun",[qary,_]),_])) $ A =>
wenzelm@2386
   710
          if T<>qary then
wenzelm@2386
   711
              raise THM("forall_elim: type mismatch", 0, [th])
wenzelm@2386
   712
          else let val thm = fix_shyps [th] []
wenzelm@2386
   713
                    (Thm{sign= Sign.merge(sign,signt),
wenzelm@2386
   714
                         der = infer_derivs (Forall_elim ct, [der]),
wenzelm@2386
   715
                         maxidx = Int.max(maxidx, maxt),
wenzelm@2386
   716
                         shyps = [],
wenzelm@2386
   717
                         hyps = hyps,  
wenzelm@2386
   718
                         prop = betapply(A,t)})
wenzelm@2386
   719
               in if maxt >= 0 andalso maxidx >= 0
wenzelm@2386
   720
                  then nodup_Vars thm "forall_elim" 
wenzelm@2386
   721
                  else thm (*no new Vars: no expensive check!*)
wenzelm@2386
   722
               end
paulson@2147
   723
      | _ => raise THM("forall_elim: not quantified", 0, [th])
clasohm@0
   724
  end
clasohm@0
   725
  handle TERM _ =>
wenzelm@250
   726
         raise THM("forall_elim: incompatible signatures", 0, [th]);
clasohm@0
   727
clasohm@0
   728
wenzelm@1220
   729
(* Equality *)
clasohm@0
   730
wenzelm@1220
   731
(* Definition of the relation =?= *)
wenzelm@1238
   732
val flexpair_def = fix_shyps [] []
paulson@1529
   733
  (Thm{sign= Sign.proto_pure, 
paulson@1597
   734
       der = Join(Axiom(pure_thy, "flexpair_def"), []),
paulson@1529
   735
       shyps = [], 
paulson@1529
   736
       hyps = [], 
paulson@1529
   737
       maxidx = 0,
paulson@1529
   738
       prop = term_of (read_cterm Sign.proto_pure
wenzelm@2386
   739
                       ("(?t =?= ?u) == (?t == ?u::?'a::{})", propT))});
clasohm@0
   740
clasohm@0
   741
(*The reflexivity rule: maps  t   to the theorem   t==t   *)
wenzelm@250
   742
fun reflexive ct =
lcp@229
   743
  let val {sign, t, T, maxidx} = rep_cterm ct
wenzelm@1238
   744
  in  fix_shyps [] []
paulson@1529
   745
       (Thm{sign= sign, 
wenzelm@2386
   746
            der = infer_derivs (Reflexive ct, []),
wenzelm@2386
   747
            shyps = [],
wenzelm@2386
   748
            hyps = [], 
wenzelm@2386
   749
            maxidx = maxidx,
wenzelm@2386
   750
            prop = Logic.mk_equals(t,t)})
clasohm@0
   751
  end;
clasohm@0
   752
clasohm@0
   753
(*The symmetry rule
wenzelm@1220
   754
  t==u
wenzelm@1220
   755
  ----
wenzelm@1220
   756
  u==t
wenzelm@1220
   757
*)
paulson@1529
   758
fun symmetric (th as Thm{sign,der,maxidx,shyps,hyps,prop}) =
clasohm@0
   759
  case prop of
clasohm@0
   760
      (eq as Const("==",_)) $ t $ u =>
wenzelm@1238
   761
        (*no fix_shyps*)
wenzelm@2386
   762
          Thm{sign = sign,
wenzelm@2386
   763
              der = infer_derivs (Symmetric, [der]),
wenzelm@2386
   764
              maxidx = maxidx,
wenzelm@2386
   765
              shyps = shyps,
wenzelm@2386
   766
              hyps = hyps,
wenzelm@2386
   767
              prop = eq$u$t}
clasohm@0
   768
    | _ => raise THM("symmetric", 0, [th]);
clasohm@0
   769
clasohm@0
   770
(*The transitive rule
wenzelm@1220
   771
  t1==u    u==t2
wenzelm@1220
   772
  --------------
wenzelm@1220
   773
      t1==t2
wenzelm@1220
   774
*)
clasohm@0
   775
fun transitive th1 th2 =
paulson@1529
   776
  let val Thm{der=der1, maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
paulson@1529
   777
      and Thm{der=der2, maxidx=max2, hyps=hyps2, prop=prop2,...} = th2;
clasohm@0
   778
      fun err(msg) = raise THM("transitive: "^msg, 0, [th1,th2])
clasohm@0
   779
  in case (prop1,prop2) of
clasohm@0
   780
       ((eq as Const("==",_)) $ t1 $ u, Const("==",_) $ u' $ t2) =>
nipkow@1634
   781
          if not (u aconv u') then err"middle term"
nipkow@1634
   782
          else let val thm =      
wenzelm@1220
   783
              fix_shyps [th1, th2] []
paulson@1529
   784
                (Thm{sign= merge_thm_sgs(th1,th2), 
wenzelm@2386
   785
                     der = infer_derivs (Transitive, [der1, der2]),
paulson@2147
   786
                     maxidx = Int.max(max1,max2), 
wenzelm@2386
   787
                     shyps = [],
wenzelm@2386
   788
                     hyps = union_term(hyps1,hyps2),
wenzelm@2386
   789
                     prop = eq$t1$t2})
paulson@2139
   790
                 in if max1 >= 0 andalso max2 >= 0
paulson@2147
   791
                    then nodup_Vars thm "transitive" 
paulson@2147
   792
                    else thm (*no new Vars: no expensive check!*)
paulson@2139
   793
                 end
clasohm@0
   794
     | _ =>  err"premises"
clasohm@0
   795
  end;
clasohm@0
   796
wenzelm@1160
   797
(*Beta-conversion: maps (%x.t)(u) to the theorem (%x.t)(u) == t[u/x] *)
wenzelm@250
   798
fun beta_conversion ct =
lcp@229
   799
  let val {sign, t, T, maxidx} = rep_cterm ct
clasohm@0
   800
  in  case t of
wenzelm@1238
   801
          Abs(_,_,bodt) $ u => fix_shyps [] []
paulson@1529
   802
            (Thm{sign = sign,  
wenzelm@2386
   803
                 der = infer_derivs (Beta_conversion ct, []),
wenzelm@2386
   804
                 maxidx = maxidx,
wenzelm@2386
   805
                 shyps = [],
wenzelm@2386
   806
                 hyps = [],
wenzelm@2386
   807
                 prop = Logic.mk_equals(t, subst_bound (u,bodt))})
wenzelm@250
   808
        | _ =>  raise THM("beta_conversion: not a redex", 0, [])
clasohm@0
   809
  end;
clasohm@0
   810
clasohm@0
   811
(*The extensionality rule   (proviso: x not free in f, g, or hypotheses)
wenzelm@1220
   812
  f(x) == g(x)
wenzelm@1220
   813
  ------------
wenzelm@1220
   814
     f == g
wenzelm@1220
   815
*)
paulson@1529
   816
fun extensional (th as Thm{sign, der, maxidx,shyps,hyps,prop}) =
clasohm@0
   817
  case prop of
clasohm@0
   818
    (Const("==",_)) $ (f$x) $ (g$y) =>
wenzelm@250
   819
      let fun err(msg) = raise THM("extensional: "^msg, 0, [th])
clasohm@0
   820
      in (if x<>y then err"different variables" else
clasohm@0
   821
          case y of
wenzelm@250
   822
                Free _ =>
wenzelm@250
   823
                  if exists (apl(y, Logic.occs)) (f::g::hyps)
wenzelm@250
   824
                  then err"variable free in hyps or functions"    else  ()
wenzelm@250
   825
              | Var _ =>
wenzelm@250
   826
                  if Logic.occs(y,f)  orelse  Logic.occs(y,g)
wenzelm@250
   827
                  then err"variable free in functions"   else  ()
wenzelm@250
   828
              | _ => err"not a variable");
wenzelm@1238
   829
          (*no fix_shyps*)
paulson@1529
   830
          Thm{sign = sign,
wenzelm@2386
   831
              der = infer_derivs (Extensional, [der]),
wenzelm@2386
   832
              maxidx = maxidx,
wenzelm@2386
   833
              shyps = shyps,
wenzelm@2386
   834
              hyps = hyps, 
paulson@1529
   835
              prop = Logic.mk_equals(f,g)}
clasohm@0
   836
      end
clasohm@0
   837
 | _ =>  raise THM("extensional: premise", 0, [th]);
clasohm@0
   838
clasohm@0
   839
(*The abstraction rule.  The Free or Var x must not be free in the hypotheses.
clasohm@0
   840
  The bound variable will be named "a" (since x will be something like x320)
wenzelm@1220
   841
     t == u
wenzelm@1220
   842
  ------------
wenzelm@1220
   843
  %x.t == %x.u
wenzelm@1220
   844
*)
paulson@1529
   845
fun abstract_rule a cx (th as Thm{sign,der,maxidx,hyps,prop,...}) =
lcp@229
   846
  let val x = term_of cx;
wenzelm@250
   847
      val (t,u) = Logic.dest_equals prop
wenzelm@250
   848
            handle TERM _ =>
wenzelm@250
   849
                raise THM("abstract_rule: premise not an equality", 0, [th])
wenzelm@1238
   850
      fun result T = fix_shyps [th] []
wenzelm@2386
   851
          (Thm{sign = sign,
wenzelm@2386
   852
               der = infer_derivs (Abstract_rule (a,cx), [der]),
wenzelm@2386
   853
               maxidx = maxidx, 
wenzelm@2386
   854
               shyps = [], 
wenzelm@2386
   855
               hyps = hyps,
wenzelm@2386
   856
               prop = Logic.mk_equals(Abs(a, T, abstract_over (x,t)),
wenzelm@2386
   857
                                      Abs(a, T, abstract_over (x,u)))})
clasohm@0
   858
  in  case x of
wenzelm@250
   859
        Free(_,T) =>
wenzelm@250
   860
         if exists (apl(x, Logic.occs)) hyps
wenzelm@250
   861
         then raise THM("abstract_rule: variable free in assumptions", 0, [th])
wenzelm@250
   862
         else result T
clasohm@0
   863
      | Var(_,T) => result T
clasohm@0
   864
      | _ => raise THM("abstract_rule: not a variable", 0, [th])
clasohm@0
   865
  end;
clasohm@0
   866
clasohm@0
   867
(*The combination rule
wenzelm@3529
   868
  f == g  t == u
wenzelm@3529
   869
  --------------
wenzelm@3529
   870
   f(t) == g(u)
wenzelm@1220
   871
*)
clasohm@0
   872
fun combination th1 th2 =
paulson@1529
   873
  let val Thm{der=der1, maxidx=max1, shyps=shyps1, hyps=hyps1, 
wenzelm@2386
   874
              prop=prop1,...} = th1
paulson@1529
   875
      and Thm{der=der2, maxidx=max2, shyps=shyps2, hyps=hyps2, 
wenzelm@2386
   876
              prop=prop2,...} = th2
paulson@1836
   877
      fun chktypes (f,t) =
wenzelm@2386
   878
            (case fastype_of f of
wenzelm@2386
   879
                Type("fun",[T1,T2]) => 
wenzelm@2386
   880
                    if T1 <> fastype_of t then
wenzelm@2386
   881
                         raise THM("combination: types", 0, [th1,th2])
wenzelm@2386
   882
                    else ()
wenzelm@2386
   883
                | _ => raise THM("combination: not function type", 0, 
wenzelm@2386
   884
                                 [th1,th2]))
nipkow@1495
   885
  in case (prop1,prop2)  of
clasohm@0
   886
       (Const("==",_) $ f $ g, Const("==",_) $ t $ u) =>
paulson@1836
   887
          let val _   = chktypes (f,t)
wenzelm@2386
   888
              val thm = (*no fix_shyps*)
wenzelm@2386
   889
                        Thm{sign = merge_thm_sgs(th1,th2), 
wenzelm@2386
   890
                            der = infer_derivs (Combination, [der1, der2]),
wenzelm@2386
   891
                            maxidx = Int.max(max1,max2), 
wenzelm@2386
   892
                            shyps = union_sort(shyps1,shyps2),
wenzelm@2386
   893
                            hyps = union_term(hyps1,hyps2),
wenzelm@2386
   894
                            prop = Logic.mk_equals(f$t, g$u)}
paulson@2139
   895
          in if max1 >= 0 andalso max2 >= 0
paulson@2139
   896
             then nodup_Vars thm "combination" 
wenzelm@2386
   897
             else thm (*no new Vars: no expensive check!*)  
paulson@2139
   898
          end
clasohm@0
   899
     | _ =>  raise THM("combination: premises", 0, [th1,th2])
clasohm@0
   900
  end;
clasohm@0
   901
clasohm@0
   902
clasohm@0
   903
(* Equality introduction
wenzelm@3529
   904
  A ==> B  B ==> A
wenzelm@3529
   905
  ----------------
wenzelm@3529
   906
       A == B
wenzelm@1220
   907
*)
clasohm@0
   908
fun equal_intr th1 th2 =
paulson@1529
   909
  let val Thm{der=der1,maxidx=max1, shyps=shyps1, hyps=hyps1, 
wenzelm@2386
   910
              prop=prop1,...} = th1
paulson@1529
   911
      and Thm{der=der2, maxidx=max2, shyps=shyps2, hyps=hyps2, 
wenzelm@2386
   912
              prop=prop2,...} = th2;
paulson@1529
   913
      fun err(msg) = raise THM("equal_intr: "^msg, 0, [th1,th2])
paulson@1529
   914
  in case (prop1,prop2) of
paulson@1529
   915
       (Const("==>",_) $ A $ B, Const("==>",_) $ B' $ A')  =>
wenzelm@2386
   916
          if A aconv A' andalso B aconv B'
wenzelm@2386
   917
          then
wenzelm@2386
   918
            (*no fix_shyps*)
wenzelm@2386
   919
              Thm{sign = merge_thm_sgs(th1,th2),
wenzelm@2386
   920
                  der = infer_derivs (Equal_intr, [der1, der2]),
wenzelm@2386
   921
                  maxidx = Int.max(max1,max2),
wenzelm@2386
   922
                  shyps = union_sort(shyps1,shyps2),
wenzelm@2386
   923
                  hyps = union_term(hyps1,hyps2),
wenzelm@2386
   924
                  prop = Logic.mk_equals(A,B)}
wenzelm@2386
   925
          else err"not equal"
paulson@1529
   926
     | _ =>  err"premises"
paulson@1529
   927
  end;
paulson@1529
   928
paulson@1529
   929
paulson@1529
   930
(*The equal propositions rule
wenzelm@3529
   931
  A == B  A
paulson@1529
   932
  ---------
paulson@1529
   933
      B
paulson@1529
   934
*)
paulson@1529
   935
fun equal_elim th1 th2 =
paulson@1529
   936
  let val Thm{der=der1, maxidx=max1, hyps=hyps1, prop=prop1,...} = th1
paulson@1529
   937
      and Thm{der=der2, maxidx=max2, hyps=hyps2, prop=prop2,...} = th2;
paulson@1529
   938
      fun err(msg) = raise THM("equal_elim: "^msg, 0, [th1,th2])
paulson@1529
   939
  in  case prop1  of
paulson@1529
   940
       Const("==",_) $ A $ B =>
paulson@1529
   941
          if not (prop2 aconv A) then err"not equal"  else
paulson@1529
   942
            fix_shyps [th1, th2] []
paulson@1529
   943
              (Thm{sign= merge_thm_sgs(th1,th2), 
wenzelm@2386
   944
                   der = infer_derivs (Equal_elim, [der1, der2]),
wenzelm@2386
   945
                   maxidx = Int.max(max1,max2),
wenzelm@2386
   946
                   shyps = [],
wenzelm@2386
   947
                   hyps = union_term(hyps1,hyps2),
wenzelm@2386
   948
                   prop = B})
paulson@1529
   949
     | _ =>  err"major premise"
paulson@1529
   950
  end;
clasohm@0
   951
wenzelm@1220
   952
wenzelm@1220
   953
clasohm@0
   954
(**** Derived rules ****)
clasohm@0
   955
paulson@1503
   956
(*Discharge all hypotheses.  Need not verify cterms or call fix_shyps.
clasohm@0
   957
  Repeated hypotheses are discharged only once;  fold cannot do this*)
paulson@1529
   958
fun implies_intr_hyps (Thm{sign, der, maxidx, shyps, hyps=A::As, prop}) =
wenzelm@1238
   959
      implies_intr_hyps (*no fix_shyps*)
paulson@1529
   960
            (Thm{sign = sign, 
wenzelm@2386
   961
                 der = infer_derivs (Implies_intr_hyps, [der]), 
wenzelm@2386
   962
                 maxidx = maxidx, 
wenzelm@2386
   963
                 shyps = shyps,
paulson@1529
   964
                 hyps = disch(As,A),  
wenzelm@2386
   965
                 prop = implies$A$prop})
clasohm@0
   966
  | implies_intr_hyps th = th;
clasohm@0
   967
clasohm@0
   968
(*Smash" unifies the list of term pairs leaving no flex-flex pairs.
wenzelm@250
   969
  Instantiates the theorem and deletes trivial tpairs.
clasohm@0
   970
  Resulting sequence may contain multiple elements if the tpairs are
clasohm@0
   971
    not all flex-flex. *)
paulson@1529
   972
fun flexflex_rule (th as Thm{sign, der, maxidx, hyps, prop,...}) =
wenzelm@250
   973
  let fun newthm env =
paulson@1529
   974
          if Envir.is_empty env then th
paulson@1529
   975
          else
wenzelm@250
   976
          let val (tpairs,horn) =
wenzelm@250
   977
                        Logic.strip_flexpairs (Envir.norm_term env prop)
wenzelm@250
   978
                (*Remove trivial tpairs, of the form t=t*)
wenzelm@250
   979
              val distpairs = filter (not o op aconv) tpairs
wenzelm@250
   980
              val newprop = Logic.list_flexpairs(distpairs, horn)
wenzelm@1220
   981
          in  fix_shyps [th] (env_codT env)
paulson@1529
   982
                (Thm{sign = sign, 
wenzelm@2386
   983
                     der = infer_derivs (Flexflex_rule env, [der]), 
wenzelm@2386
   984
                     maxidx = maxidx_of_term newprop, 
wenzelm@2386
   985
                     shyps = [], 
wenzelm@2386
   986
                     hyps = hyps,
wenzelm@2386
   987
                     prop = newprop})
wenzelm@250
   988
          end;
clasohm@0
   989
      val (tpairs,_) = Logic.strip_flexpairs prop
clasohm@0
   990
  in Sequence.maps newthm
wenzelm@250
   991
            (Unify.smash_unifiers(sign, Envir.empty maxidx, tpairs))
clasohm@0
   992
  end;
clasohm@0
   993
clasohm@0
   994
(*Instantiation of Vars
wenzelm@1220
   995
           A
wenzelm@1220
   996
  -------------------
wenzelm@1220
   997
  A[t1/v1,....,tn/vn]
wenzelm@1220
   998
*)
clasohm@0
   999
clasohm@0
  1000
(*Check that all the terms are Vars and are distinct*)
clasohm@0
  1001
fun instl_ok ts = forall is_Var ts andalso null(findrep ts);
clasohm@0
  1002
clasohm@0
  1003
(*For instantiate: process pair of cterms, merge theories*)
clasohm@0
  1004
fun add_ctpair ((ct,cu), (sign,tpairs)) =
lcp@229
  1005
  let val {sign=signt, t=t, T= T, ...} = rep_cterm ct
lcp@229
  1006
      and {sign=signu, t=u, T= U, ...} = rep_cterm cu
clasohm@0
  1007
  in  if T=U  then (Sign.merge(sign, Sign.merge(signt, signu)), (t,u)::tpairs)
clasohm@0
  1008
      else raise TYPE("add_ctpair", [T,U], [t,u])
clasohm@0
  1009
  end;
clasohm@0
  1010
clasohm@0
  1011
fun add_ctyp ((v,ctyp), (sign',vTs)) =
lcp@229
  1012
  let val {T,sign} = rep_ctyp ctyp
clasohm@0
  1013
  in (Sign.merge(sign,sign'), (v,T)::vTs) end;
clasohm@0
  1014
clasohm@0
  1015
(*Left-to-right replacements: ctpairs = [...,(vi,ti),...].
clasohm@0
  1016
  Instantiates distinct Vars by terms of same type.
clasohm@0
  1017
  Normalizes the new theorem! *)
paulson@1529
  1018
fun instantiate ([], []) th = th
paulson@1529
  1019
  | instantiate (vcTs,ctpairs)  (th as Thm{sign,der,maxidx,hyps,prop,...}) =
clasohm@0
  1020
  let val (newsign,tpairs) = foldr add_ctpair (ctpairs, (sign,[]));
clasohm@0
  1021
      val (newsign,vTs) = foldr add_ctyp (vcTs, (newsign,[]));
wenzelm@250
  1022
      val newprop =
wenzelm@250
  1023
            Envir.norm_term (Envir.empty 0)
wenzelm@250
  1024
              (subst_atomic tpairs
wenzelm@250
  1025
               (Type.inst_term_tvars(#tsig(Sign.rep_sg newsign),vTs) prop))
wenzelm@1220
  1026
      val newth =
wenzelm@1220
  1027
            fix_shyps [th] (map snd vTs)
paulson@1529
  1028
              (Thm{sign = newsign, 
wenzelm@2386
  1029
                   der = infer_derivs (Instantiate(vcTs,ctpairs), [der]), 
wenzelm@2386
  1030
                   maxidx = maxidx_of_term newprop, 
wenzelm@2386
  1031
                   shyps = [],
wenzelm@2386
  1032
                   hyps = hyps,
wenzelm@2386
  1033
                   prop = newprop})
wenzelm@250
  1034
  in  if not(instl_ok(map #1 tpairs))
nipkow@193
  1035
      then raise THM("instantiate: variables not distinct", 0, [th])
nipkow@193
  1036
      else if not(null(findrep(map #1 vTs)))
nipkow@193
  1037
      then raise THM("instantiate: type variables not distinct", 0, [th])
paulson@2147
  1038
      else nodup_Vars newth "instantiate"
clasohm@0
  1039
  end
wenzelm@250
  1040
  handle TERM _ =>
clasohm@0
  1041
           raise THM("instantiate: incompatible signatures",0,[th])
paulson@2671
  1042
       | TYPE (msg,_,_) => raise THM("instantiate: type conflict: " ^ msg, 
paulson@2671
  1043
				     0, [th]);
clasohm@0
  1044
clasohm@0
  1045
(*The trivial implication A==>A, justified by assume and forall rules.
clasohm@0
  1046
  A can contain Vars, not so for assume!   *)
wenzelm@250
  1047
fun trivial ct : thm =
lcp@229
  1048
  let val {sign, t=A, T, maxidx} = rep_cterm ct
wenzelm@250
  1049
  in  if T<>propT then
wenzelm@250
  1050
            raise THM("trivial: the term must have type prop", 0, [])
wenzelm@1238
  1051
      else fix_shyps [] []
paulson@1529
  1052
        (Thm{sign = sign, 
wenzelm@2386
  1053
             der = infer_derivs (Trivial ct, []), 
wenzelm@2386
  1054
             maxidx = maxidx, 
wenzelm@2386
  1055
             shyps = [], 
wenzelm@2386
  1056
             hyps = [],
wenzelm@2386
  1057
             prop = implies$A$A})
clasohm@0
  1058
  end;
clasohm@0
  1059
paulson@1503
  1060
(*Axiom-scheme reflecting signature contents: "OFCLASS(?'a::c, c_class)" *)
wenzelm@399
  1061
fun class_triv thy c =
paulson@1529
  1062
  let val sign = sign_of thy;
paulson@1529
  1063
      val Cterm {t, maxidx, ...} =
wenzelm@2386
  1064
          cterm_of sign (Logic.mk_inclass (TVar (("'a", 0), [c]), c))
wenzelm@2386
  1065
            handle TERM (msg, _) => raise THM ("class_triv: " ^ msg, 0, []);
wenzelm@399
  1066
  in
wenzelm@1238
  1067
    fix_shyps [] []
paulson@1529
  1068
      (Thm {sign = sign, 
wenzelm@2386
  1069
            der = infer_derivs (Class_triv(thy,c), []), 
wenzelm@2386
  1070
            maxidx = maxidx, 
wenzelm@2386
  1071
            shyps = [], 
wenzelm@2386
  1072
            hyps = [], 
wenzelm@2386
  1073
            prop = t})
wenzelm@399
  1074
  end;
wenzelm@399
  1075
wenzelm@399
  1076
clasohm@0
  1077
(* Replace all TFrees not in the hyps by new TVars *)
paulson@1529
  1078
fun varifyT(Thm{sign,der,maxidx,shyps,hyps,prop}) =
clasohm@0
  1079
  let val tfrees = foldr add_term_tfree_names (hyps,[])
nipkow@1634
  1080
  in let val thm = (*no fix_shyps*)
paulson@1529
  1081
    Thm{sign = sign, 
wenzelm@2386
  1082
        der = infer_derivs (VarifyT, [der]), 
wenzelm@2386
  1083
        maxidx = Int.max(0,maxidx), 
wenzelm@2386
  1084
        shyps = shyps, 
wenzelm@2386
  1085
        hyps = hyps,
paulson@1529
  1086
        prop = Type.varify(prop,tfrees)}
paulson@2147
  1087
     in nodup_Vars thm "varifyT" end
nipkow@1634
  1088
(* this nodup_Vars check can be removed if thms are guaranteed not to contain
nipkow@1634
  1089
duplicate TVars with differnt sorts *)
clasohm@0
  1090
  end;
clasohm@0
  1091
clasohm@0
  1092
(* Replace all TVars by new TFrees *)
paulson@1529
  1093
fun freezeT(Thm{sign,der,maxidx,shyps,hyps,prop}) =
paulson@3410
  1094
  let val (prop',_) = Type.freeze_thaw prop
wenzelm@1238
  1095
  in (*no fix_shyps*)
paulson@1529
  1096
    Thm{sign = sign, 
wenzelm@2386
  1097
        der = infer_derivs (FreezeT, [der]),
wenzelm@2386
  1098
        maxidx = maxidx_of_term prop',
wenzelm@2386
  1099
        shyps = shyps,
wenzelm@2386
  1100
        hyps = hyps,
paulson@1529
  1101
        prop = prop'}
wenzelm@1220
  1102
  end;
clasohm@0
  1103
clasohm@0
  1104
clasohm@0
  1105
(*** Inference rules for tactics ***)
clasohm@0
  1106
clasohm@0
  1107
(*Destruct proof state into constraints, other goals, goal(i), rest *)
clasohm@0
  1108
fun dest_state (state as Thm{prop,...}, i) =
clasohm@0
  1109
  let val (tpairs,horn) = Logic.strip_flexpairs prop
clasohm@0
  1110
  in  case  Logic.strip_prems(i, [], horn) of
clasohm@0
  1111
          (B::rBs, C) => (tpairs, rev rBs, B, C)
clasohm@0
  1112
        | _ => raise THM("dest_state", i, [state])
clasohm@0
  1113
  end
clasohm@0
  1114
  handle TERM _ => raise THM("dest_state", i, [state]);
clasohm@0
  1115
lcp@309
  1116
(*Increment variables and parameters of orule as required for
clasohm@0
  1117
  resolution with goal i of state. *)
clasohm@0
  1118
fun lift_rule (state, i) orule =
paulson@1529
  1119
  let val Thm{shyps=sshyps, prop=sprop, maxidx=smax, sign=ssign,...} = state
clasohm@0
  1120
      val (Bi::_, _) = Logic.strip_prems(i, [], Logic.skip_flexpairs sprop)
paulson@1529
  1121
        handle TERM _ => raise THM("lift_rule", i, [orule,state])
paulson@1529
  1122
      val ct_Bi = Cterm {sign=ssign, maxidx=smax, T=propT, t=Bi}
paulson@1529
  1123
      val (lift_abs,lift_all) = Logic.lift_fns(Bi,smax+1)
paulson@1529
  1124
      val (Thm{sign, der, maxidx,shyps,hyps,prop}) = orule
clasohm@0
  1125
      val (tpairs,As,B) = Logic.strip_horn prop
wenzelm@1238
  1126
  in  (*no fix_shyps*)
paulson@1529
  1127
      Thm{sign = merge_thm_sgs(state,orule),
wenzelm@2386
  1128
          der = infer_derivs (Lift_rule(ct_Bi, i), [der]),
wenzelm@2386
  1129
          maxidx = maxidx+smax+1,
paulson@2177
  1130
          shyps=union_sort(sshyps,shyps), 
wenzelm@2386
  1131
          hyps=hyps, 
paulson@1529
  1132
          prop = Logic.rule_of (map (pairself lift_abs) tpairs,
wenzelm@2386
  1133
                                map lift_all As,    
wenzelm@2386
  1134
                                lift_all B)}
clasohm@0
  1135
  end;
clasohm@0
  1136
clasohm@0
  1137
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *)
clasohm@0
  1138
fun assumption i state =
paulson@1529
  1139
  let val Thm{sign,der,maxidx,hyps,prop,...} = state;
clasohm@0
  1140
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
wenzelm@250
  1141
      fun newth (env as Envir.Envir{maxidx, ...}, tpairs) =
wenzelm@1220
  1142
        fix_shyps [state] (env_codT env)
paulson@1529
  1143
          (Thm{sign = sign, 
wenzelm@2386
  1144
               der = infer_derivs (Assumption (i, Some env), [der]),
wenzelm@2386
  1145
               maxidx = maxidx,
wenzelm@2386
  1146
               shyps = [],
wenzelm@2386
  1147
               hyps = hyps,
wenzelm@2386
  1148
               prop = 
wenzelm@2386
  1149
               if Envir.is_empty env then (*avoid wasted normalizations*)
wenzelm@2386
  1150
                   Logic.rule_of (tpairs, Bs, C)
wenzelm@2386
  1151
               else (*normalize the new rule fully*)
wenzelm@2386
  1152
                   Envir.norm_term env (Logic.rule_of (tpairs, Bs, C))});
clasohm@0
  1153
      fun addprfs [] = Sequence.null
clasohm@0
  1154
        | addprfs ((t,u)::apairs) = Sequence.seqof (fn()=> Sequence.pull
clasohm@0
  1155
             (Sequence.mapp newth
wenzelm@250
  1156
                (Unify.unifiers(sign,Envir.empty maxidx, (t,u)::tpairs))
wenzelm@250
  1157
                (addprfs apairs)))
clasohm@0
  1158
  in  addprfs (Logic.assum_pairs Bi)  end;
clasohm@0
  1159
wenzelm@250
  1160
(*Solve subgoal Bi of proof state B1...Bn/C by assumption.
clasohm@0
  1161
  Checks if Bi's conclusion is alpha-convertible to one of its assumptions*)
clasohm@0
  1162
fun eq_assumption i state =
paulson@1529
  1163
  let val Thm{sign,der,maxidx,hyps,prop,...} = state;
clasohm@0
  1164
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
clasohm@0
  1165
  in  if exists (op aconv) (Logic.assum_pairs Bi)
wenzelm@1220
  1166
      then fix_shyps [state] []
paulson@1529
  1167
             (Thm{sign = sign, 
wenzelm@2386
  1168
                  der = infer_derivs (Assumption (i,None), [der]),
wenzelm@2386
  1169
                  maxidx = maxidx,
wenzelm@2386
  1170
                  shyps = [],
wenzelm@2386
  1171
                  hyps = hyps,
wenzelm@2386
  1172
                  prop = Logic.rule_of(tpairs, Bs, C)})
clasohm@0
  1173
      else  raise THM("eq_assumption", 0, [state])
clasohm@0
  1174
  end;
clasohm@0
  1175
clasohm@0
  1176
paulson@2671
  1177
(*For rotate_tac: fast rotation of assumptions of subgoal i*)
paulson@2671
  1178
fun rotate_rule k i state =
paulson@2671
  1179
  let val Thm{sign,der,maxidx,hyps,prop,shyps} = state;
paulson@2671
  1180
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
paulson@2671
  1181
      val params = Logic.strip_params Bi
paulson@2671
  1182
      and asms   = Logic.strip_assums_hyp Bi
paulson@2671
  1183
      and concl  = Logic.strip_assums_concl Bi
paulson@2671
  1184
      val n      = length asms
paulson@2671
  1185
      fun rot m  = if 0=m orelse m=n then Bi
paulson@2671
  1186
		   else if 0<m andalso m<n 
paulson@2671
  1187
		   then list_all 
paulson@2671
  1188
			   (params, 
paulson@2671
  1189
			    Logic.list_implies(List.drop(asms, m) @ 
paulson@2671
  1190
					       List.take(asms, m),
paulson@2671
  1191
					       concl))
paulson@2671
  1192
		   else raise THM("rotate_rule", m, [state])
paulson@2671
  1193
  in  Thm{sign = sign, 
paulson@2671
  1194
	  der = infer_derivs (Rotate_rule (k,i), [der]),
paulson@2671
  1195
	  maxidx = maxidx,
paulson@2671
  1196
	  shyps = shyps,
paulson@2671
  1197
	  hyps = hyps,
paulson@2671
  1198
	  prop = Logic.rule_of(tpairs, Bs@[rot (if k<0 then n+k else k)], C)}
paulson@2671
  1199
  end;
paulson@2671
  1200
paulson@2671
  1201
clasohm@0
  1202
(** User renaming of parameters in a subgoal **)
clasohm@0
  1203
clasohm@0
  1204
(*Calls error rather than raising an exception because it is intended
clasohm@0
  1205
  for top-level use -- exception handling would not make sense here.
clasohm@0
  1206
  The names in cs, if distinct, are used for the innermost parameters;
clasohm@0
  1207
   preceding parameters may be renamed to make all params distinct.*)
clasohm@0
  1208
fun rename_params_rule (cs, i) state =
nipkow@3037
  1209
  let val Thm{sign,der,maxidx,hyps,...} = state
clasohm@0
  1210
      val (tpairs, Bs, Bi, C) = dest_state(state,i)
clasohm@0
  1211
      val iparams = map #1 (Logic.strip_params Bi)
clasohm@0
  1212
      val short = length iparams - length cs
wenzelm@250
  1213
      val newnames =
wenzelm@250
  1214
            if short<0 then error"More names than abstractions!"
wenzelm@250
  1215
            else variantlist(take (short,iparams), cs) @ cs
nipkow@3037
  1216
      val freenames = map (#1 o dest_Free) (term_frees Bi)
clasohm@0
  1217
      val newBi = Logic.list_rename_params (newnames, Bi)
wenzelm@250
  1218
  in
clasohm@0
  1219
  case findrep cs of
paulson@3565
  1220
     c::_ => (warning ("Can't rename.  Bound variables not distinct: " ^ c); 
paulson@3565
  1221
	      state)
berghofe@1576
  1222
   | [] => (case cs inter_string freenames of
paulson@3565
  1223
       a::_ => (warning ("Can't rename.  Bound/Free variable clash: " ^ a); 
paulson@3565
  1224
		state)
wenzelm@1220
  1225
     | [] => fix_shyps [state] []
wenzelm@2386
  1226
                (Thm{sign = sign,
wenzelm@2386
  1227
                     der = infer_derivs (Rename_params_rule(cs,i), [der]),
wenzelm@2386
  1228
                     maxidx = maxidx,
wenzelm@2386
  1229
                     shyps = [],
wenzelm@2386
  1230
                     hyps = hyps,
wenzelm@2386
  1231
                     prop = Logic.rule_of(tpairs, Bs@[newBi], C)}))
clasohm@0
  1232
  end;
clasohm@0
  1233
clasohm@0
  1234
(*** Preservation of bound variable names ***)
clasohm@0
  1235
wenzelm@250
  1236
(*Scan a pair of terms; while they are similar,
clasohm@0
  1237
  accumulate corresponding bound vars in "al"*)
wenzelm@1238
  1238
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) =
lcp@1195
  1239
      match_bvs(s, t, if x="" orelse y="" then al
wenzelm@1238
  1240
                                          else (x,y)::al)
clasohm@0
  1241
  | match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al))
clasohm@0
  1242
  | match_bvs(_,_,al) = al;
clasohm@0
  1243
clasohm@0
  1244
(* strip abstractions created by parameters *)
clasohm@0
  1245
fun match_bvars((s,t),al) = match_bvs(strip_abs_body s, strip_abs_body t, al);
clasohm@0
  1246
clasohm@0
  1247
wenzelm@250
  1248
(* strip_apply f A(,B) strips off all assumptions/parameters from A
clasohm@0
  1249
   introduced by lifting over B, and applies f to remaining part of A*)
clasohm@0
  1250
fun strip_apply f =
clasohm@0
  1251
  let fun strip(Const("==>",_)$ A1 $ B1,
wenzelm@250
  1252
                Const("==>",_)$ _  $ B2) = implies $ A1 $ strip(B1,B2)
wenzelm@250
  1253
        | strip((c as Const("all",_)) $ Abs(a,T,t1),
wenzelm@250
  1254
                      Const("all",_)  $ Abs(_,_,t2)) = c$Abs(a,T,strip(t1,t2))
wenzelm@250
  1255
        | strip(A,_) = f A
clasohm@0
  1256
  in strip end;
clasohm@0
  1257
clasohm@0
  1258
(*Use the alist to rename all bound variables and some unknowns in a term
clasohm@0
  1259
  dpairs = current disagreement pairs;  tpairs = permanent ones (flexflex);
clasohm@0
  1260
  Preserves unknowns in tpairs and on lhs of dpairs. *)
clasohm@0
  1261
fun rename_bvs([],_,_,_) = I
clasohm@0
  1262
  | rename_bvs(al,dpairs,tpairs,B) =
wenzelm@250
  1263
    let val vars = foldr add_term_vars
wenzelm@250
  1264
                        (map fst dpairs @ map fst tpairs @ map snd tpairs, [])
wenzelm@250
  1265
        (*unknowns appearing elsewhere be preserved!*)
wenzelm@250
  1266
        val vids = map (#1 o #1 o dest_Var) vars;
wenzelm@250
  1267
        fun rename(t as Var((x,i),T)) =
wenzelm@250
  1268
                (case assoc(al,x) of
berghofe@1576
  1269
                   Some(y) => if x mem_string vids orelse y mem_string vids then t
wenzelm@250
  1270
                              else Var((y,i),T)
wenzelm@250
  1271
                 | None=> t)
clasohm@0
  1272
          | rename(Abs(x,T,t)) =
berghofe@1576
  1273
              Abs(case assoc_string(al,x) of Some(y) => y | None => x,
wenzelm@250
  1274
                  T, rename t)
clasohm@0
  1275
          | rename(f$t) = rename f $ rename t
clasohm@0
  1276
          | rename(t) = t;
wenzelm@250
  1277
        fun strip_ren Ai = strip_apply rename (Ai,B)
clasohm@0
  1278
    in strip_ren end;
clasohm@0
  1279
clasohm@0
  1280
(*Function to rename bounds/unknowns in the argument, lifted over B*)
clasohm@0
  1281
fun rename_bvars(dpairs, tpairs, B) =
wenzelm@250
  1282
        rename_bvs(foldr match_bvars (dpairs,[]), dpairs, tpairs, B);
clasohm@0
  1283
clasohm@0
  1284
clasohm@0
  1285
(*** RESOLUTION ***)
clasohm@0
  1286
lcp@721
  1287
(** Lifting optimizations **)
lcp@721
  1288
clasohm@0
  1289
(*strip off pairs of assumptions/parameters in parallel -- they are
clasohm@0
  1290
  identical because of lifting*)
wenzelm@250
  1291
fun strip_assums2 (Const("==>", _) $ _ $ B1,
wenzelm@250
  1292
                   Const("==>", _) $ _ $ B2) = strip_assums2 (B1,B2)
clasohm@0
  1293
  | strip_assums2 (Const("all",_)$Abs(a,T,t1),
wenzelm@250
  1294
                   Const("all",_)$Abs(_,_,t2)) =
clasohm@0
  1295
      let val (B1,B2) = strip_assums2 (t1,t2)
clasohm@0
  1296
      in  (Abs(a,T,B1), Abs(a,T,B2))  end
clasohm@0
  1297
  | strip_assums2 BB = BB;
clasohm@0
  1298
clasohm@0
  1299
lcp@721
  1300
(*Faster normalization: skip assumptions that were lifted over*)
lcp@721
  1301
fun norm_term_skip env 0 t = Envir.norm_term env t
lcp@721
  1302
  | norm_term_skip env n (Const("all",_)$Abs(a,T,t)) =
lcp@721
  1303
        let val Envir.Envir{iTs, ...} = env
wenzelm@1238
  1304
            val T' = typ_subst_TVars iTs T
wenzelm@1238
  1305
            (*Must instantiate types of parameters because they are flattened;
lcp@721
  1306
              this could be a NEW parameter*)
lcp@721
  1307
        in  all T' $ Abs(a, T', norm_term_skip env n t)  end
lcp@721
  1308
  | norm_term_skip env n (Const("==>", _) $ A $ B) =
wenzelm@1238
  1309
        implies $ A $ norm_term_skip env (n-1) B
lcp@721
  1310
  | norm_term_skip env n t = error"norm_term_skip: too few assumptions??";
lcp@721
  1311
lcp@721
  1312
clasohm@0
  1313
(*Composition of object rule r=(A1...Am/B) with proof state s=(B1...Bn/C)
wenzelm@250
  1314
  Unifies B with Bi, replacing subgoal i    (1 <= i <= n)
clasohm@0
  1315
  If match then forbid instantiations in proof state
clasohm@0
  1316
  If lifted then shorten the dpair using strip_assums2.
clasohm@0
  1317
  If eres_flg then simultaneously proves A1 by assumption.
wenzelm@250
  1318
  nsubgoal is the number of new subgoals (written m above).
clasohm@0
  1319
  Curried so that resolution calls dest_state only once.
clasohm@0
  1320
*)
paulson@1529
  1321
local open Sequence; exception COMPOSE
clasohm@0
  1322
in
wenzelm@250
  1323
fun bicompose_aux match (state, (stpairs, Bs, Bi, C), lifted)
clasohm@0
  1324
                        (eres_flg, orule, nsubgoal) =
paulson@1529
  1325
 let val Thm{der=sder, maxidx=smax, shyps=sshyps, hyps=shyps, ...} = state
paulson@1529
  1326
     and Thm{der=rder, maxidx=rmax, shyps=rshyps, hyps=rhyps, 
wenzelm@2386
  1327
             prop=rprop,...} = orule
paulson@1529
  1328
         (*How many hyps to skip over during normalization*)
wenzelm@1238
  1329
     and nlift = Logic.count_prems(strip_all_body Bi,
wenzelm@1238
  1330
                                   if eres_flg then ~1 else 0)
wenzelm@387
  1331
     val sign = merge_thm_sgs(state,orule);
clasohm@0
  1332
     (** Add new theorem with prop = '[| Bs; As |] ==> C' to thq **)
wenzelm@250
  1333
     fun addth As ((env as Envir.Envir {maxidx, ...}, tpairs), thq) =
wenzelm@250
  1334
       let val normt = Envir.norm_term env;
wenzelm@250
  1335
           (*perform minimal copying here by examining env*)
wenzelm@250
  1336
           val normp =
wenzelm@250
  1337
             if Envir.is_empty env then (tpairs, Bs @ As, C)
wenzelm@250
  1338
             else
wenzelm@250
  1339
             let val ntps = map (pairself normt) tpairs
paulson@2147
  1340
             in if Envir.above (smax, env) then
wenzelm@1238
  1341
                  (*no assignments in state; normalize the rule only*)
wenzelm@1238
  1342
                  if lifted
wenzelm@1238
  1343
                  then (ntps, Bs @ map (norm_term_skip env nlift) As, C)
wenzelm@1238
  1344
                  else (ntps, Bs @ map normt As, C)
paulson@1529
  1345
                else if match then raise COMPOSE
wenzelm@250
  1346
                else (*normalize the new rule fully*)
wenzelm@250
  1347
                  (ntps, map normt (Bs @ As), normt C)
wenzelm@250
  1348
             end
wenzelm@1258
  1349
           val th = (*tuned fix_shyps*)
paulson@1529
  1350
             Thm{sign = sign,
wenzelm@2386
  1351
                 der = infer_derivs (Bicompose(match, eres_flg,
wenzelm@2386
  1352
                                               1 + length Bs, nsubgoal, env),
wenzelm@2386
  1353
                                     [rder,sder]),
wenzelm@2386
  1354
                 maxidx = maxidx,
wenzelm@2386
  1355
                 shyps = add_env_sorts (env, union_sort(rshyps,sshyps)),
wenzelm@2386
  1356
                 hyps = union_term(rhyps,shyps),
wenzelm@2386
  1357
                 prop = Logic.rule_of normp}
paulson@1529
  1358
        in  cons(th, thq)  end  handle COMPOSE => thq
clasohm@0
  1359
     val (rtpairs,rhorn) = Logic.strip_flexpairs(rprop);
clasohm@0
  1360
     val (rAs,B) = Logic.strip_prems(nsubgoal, [], rhorn)
clasohm@0
  1361
       handle TERM _ => raise THM("bicompose: rule", 0, [orule,state]);
clasohm@0
  1362
     (*Modify assumptions, deleting n-th if n>0 for e-resolution*)
clasohm@0
  1363
     fun newAs(As0, n, dpairs, tpairs) =
clasohm@0
  1364
       let val As1 = if !Logic.auto_rename orelse not lifted then As0
wenzelm@250
  1365
                     else map (rename_bvars(dpairs,tpairs,B)) As0
clasohm@0
  1366
       in (map (Logic.flatten_params n) As1)
wenzelm@250
  1367
          handle TERM _ =>
wenzelm@250
  1368
          raise THM("bicompose: 1st premise", 0, [orule])
clasohm@0
  1369
       end;
paulson@2147
  1370
     val env = Envir.empty(Int.max(rmax,smax));
clasohm@0
  1371
     val BBi = if lifted then strip_assums2(B,Bi) else (B,Bi);
clasohm@0
  1372
     val dpairs = BBi :: (rtpairs@stpairs);
clasohm@0
  1373
     (*elim-resolution: try each assumption in turn.  Initially n=1*)
clasohm@0
  1374
     fun tryasms (_, _, []) = null
clasohm@0
  1375
       | tryasms (As, n, (t,u)::apairs) =
wenzelm@250
  1376
          (case pull(Unify.unifiers(sign, env, (t,u)::dpairs))  of
wenzelm@250
  1377
               None                   => tryasms (As, n+1, apairs)
wenzelm@250
  1378
             | cell as Some((_,tpairs),_) =>
wenzelm@250
  1379
                   its_right (addth (newAs(As, n, [BBi,(u,t)], tpairs)))
wenzelm@250
  1380
                       (seqof (fn()=> cell),
wenzelm@250
  1381
                        seqof (fn()=> pull (tryasms (As, n+1, apairs)))));
clasohm@0
  1382
     fun eres [] = raise THM("bicompose: no premises", 0, [orule,state])
clasohm@0
  1383
       | eres (A1::As) = tryasms (As, 1, Logic.assum_pairs A1);
clasohm@0
  1384
     (*ordinary resolution*)
clasohm@0
  1385
     fun res(None) = null
wenzelm@250
  1386
       | res(cell as Some((_,tpairs),_)) =
wenzelm@250
  1387
             its_right (addth(newAs(rev rAs, 0, [BBi], tpairs)))
wenzelm@250
  1388
                       (seqof (fn()=> cell), null)
clasohm@0
  1389
 in  if eres_flg then eres(rev rAs)
clasohm@0
  1390
     else res(pull(Unify.unifiers(sign, env, dpairs)))
clasohm@0
  1391
 end;
clasohm@0
  1392
end;  (*open Sequence*)
clasohm@0
  1393
clasohm@0
  1394
clasohm@0
  1395
fun bicompose match arg i state =
clasohm@0
  1396
    bicompose_aux match (state, dest_state(state,i), false) arg;
clasohm@0
  1397
clasohm@0
  1398
(*Quick test whether rule is resolvable with the subgoal with hyps Hs
clasohm@0
  1399
  and conclusion B.  If eres_flg then checks 1st premise of rule also*)
clasohm@0
  1400
fun could_bires (Hs, B, eres_flg, rule) =
clasohm@0
  1401
    let fun could_reshyp (A1::_) = exists (apl(A1,could_unify)) Hs
wenzelm@250
  1402
          | could_reshyp [] = false;  (*no premise -- illegal*)
wenzelm@250
  1403
    in  could_unify(concl_of rule, B) andalso
wenzelm@250
  1404
        (not eres_flg  orelse  could_reshyp (prems_of rule))
clasohm@0
  1405
    end;
clasohm@0
  1406
clasohm@0
  1407
(*Bi-resolution of a state with a list of (flag,rule) pairs.
clasohm@0
  1408
  Puts the rule above:  rule/state.  Renames vars in the rules. *)
wenzelm@250
  1409
fun biresolution match brules i state =
clasohm@0
  1410
    let val lift = lift_rule(state, i);
wenzelm@250
  1411
        val (stpairs, Bs, Bi, C) = dest_state(state,i)
wenzelm@250
  1412
        val B = Logic.strip_assums_concl Bi;
wenzelm@250
  1413
        val Hs = Logic.strip_assums_hyp Bi;
wenzelm@250
  1414
        val comp = bicompose_aux match (state, (stpairs, Bs, Bi, C), true);
wenzelm@250
  1415
        fun res [] = Sequence.null
wenzelm@250
  1416
          | res ((eres_flg, rule)::brules) =
wenzelm@250
  1417
              if could_bires (Hs, B, eres_flg, rule)
wenzelm@1160
  1418
              then Sequence.seqof (*delay processing remainder till needed*)
wenzelm@250
  1419
                  (fn()=> Some(comp (eres_flg, lift rule, nprems_of rule),
wenzelm@250
  1420
                               res brules))
wenzelm@250
  1421
              else res brules
clasohm@0
  1422
    in  Sequence.flats (res brules)  end;
clasohm@0
  1423
clasohm@0
  1424
clasohm@0
  1425
wenzelm@2509
  1426
(*** Meta Simplification ***)
clasohm@0
  1427
wenzelm@2509
  1428
(** diagnostics **)
clasohm@0
  1429
clasohm@0
  1430
exception SIMPLIFIER of string * thm;
clasohm@0
  1431
wenzelm@2509
  1432
fun prtm a sign t = (writeln a; writeln (Sign.string_of_term sign t));
wenzelm@3529
  1433
fun prtm_warning a sign t = (warning a; warning (Sign.string_of_term sign t));
berghofe@1580
  1434
nipkow@209
  1435
val trace_simp = ref false;
nipkow@209
  1436
wenzelm@3558
  1437
fun trace a = if ! trace_simp then writeln a else ();
wenzelm@2509
  1438
fun trace_warning a = if ! trace_simp then warning a else ();
wenzelm@2509
  1439
fun trace_term a sign t = if ! trace_simp then prtm a sign t else ();
wenzelm@2509
  1440
fun trace_term_warning a sign t = if ! trace_simp then prtm_warning a sign t else ();
wenzelm@2509
  1441
fun trace_thm a (Thm {sign, prop, ...}) = trace_term a sign prop;
wenzelm@2509
  1442
fun trace_thm_warning a (Thm {sign, prop, ...}) = trace_term_warning a sign prop;
nipkow@209
  1443
nipkow@209
  1444
berghofe@1580
  1445
wenzelm@2509
  1446
(** meta simp sets **)
wenzelm@2509
  1447
wenzelm@2509
  1448
(* basic components *)
berghofe@1580
  1449
wenzelm@2509
  1450
type rrule = {thm: thm, lhs: term, perm: bool};
wenzelm@2509
  1451
type cong = {thm: thm, lhs: term};
wenzelm@3550
  1452
type simproc = {name: string, proc: Sign.sg -> term -> thm option, lhs: cterm, id: stamp};
nipkow@288
  1453
wenzelm@3550
  1454
fun eq_rrule ({thm = Thm {prop = p1, ...}, ...}: rrule,
wenzelm@2509
  1455
  {thm = Thm {prop = p2, ...}, ...}: rrule) = p1 aconv p2;
wenzelm@2509
  1456
wenzelm@3550
  1457
fun eq_cong ({thm = Thm {prop = p1, ...}, ...}: cong,
wenzelm@3550
  1458
  {thm = Thm {prop = p2, ...}, ...}: cong) = p1 aconv p2;
wenzelm@3550
  1459
wenzelm@3550
  1460
fun eq_prem (Thm {prop = p1, ...}, Thm {prop = p2, ...}) = p1 aconv p2;
wenzelm@3550
  1461
wenzelm@3550
  1462
fun eq_simproc ({id = s1, ...}:simproc, {id = s2, ...}:simproc) = (s1 = s2);
wenzelm@3550
  1463
wenzelm@3550
  1464
fun mk_simproc (name, proc, lhs, id) =
wenzelm@3550
  1465
  {name = name, proc = proc, lhs = lhs, id = id};
wenzelm@2509
  1466
wenzelm@2509
  1467
wenzelm@2509
  1468
(* datatype mss *)
nipkow@288
  1469
wenzelm@2509
  1470
(*
wenzelm@2509
  1471
  A "mss" contains data needed during conversion:
wenzelm@2509
  1472
    rules: discrimination net of rewrite rules;
wenzelm@2509
  1473
    congs: association list of congruence rules;
wenzelm@2509
  1474
    procs: discrimination net of simplification procedures
wenzelm@2509
  1475
      (functions that prove rewrite rules on the fly);
wenzelm@2509
  1476
    bounds: names of bound variables already used
wenzelm@2509
  1477
      (for generating new names when rewriting under lambda abstractions);
wenzelm@2509
  1478
    prems: current premises;
wenzelm@2509
  1479
    mk_rews: turns simplification thms into rewrite rules;
wenzelm@2509
  1480
    termless: relation for ordered rewriting;
nipkow@1028
  1481
*)
clasohm@0
  1482
wenzelm@2509
  1483
datatype meta_simpset =
wenzelm@2509
  1484
  Mss of {
wenzelm@2509
  1485
    rules: rrule Net.net,
wenzelm@2509
  1486
    congs: (string * cong) list,
wenzelm@2509
  1487
    procs: simproc Net.net,
wenzelm@2509
  1488
    bounds: string list,
wenzelm@2509
  1489
    prems: thm list,
wenzelm@2509
  1490
    mk_rews: thm -> thm list,
wenzelm@2509
  1491
    termless: term * term -> bool};
wenzelm@2509
  1492
wenzelm@2509
  1493
fun mk_mss (rules, congs, procs, bounds, prems, mk_rews, termless) =
wenzelm@2509
  1494
  Mss {rules = rules, congs = congs, procs = procs, bounds = bounds,
wenzelm@2509
  1495
    prems = prems, mk_rews = mk_rews, termless = termless};
wenzelm@2509
  1496
wenzelm@2509
  1497
val empty_mss =
wenzelm@2509
  1498
  mk_mss (Net.empty, [], Net.empty, [], [], K [], Logic.termless);
wenzelm@2509
  1499
wenzelm@2509
  1500
wenzelm@2509
  1501
wenzelm@2509
  1502
(** simpset operations **)
wenzelm@2509
  1503
wenzelm@3550
  1504
(* dest_mss *)
wenzelm@3550
  1505
wenzelm@3550
  1506
fun dest_mss (Mss {rules, congs, procs, ...}) =
wenzelm@3550
  1507
  {simps = map (fn (_, {thm, ...}) => thm) (Net.dest rules),
wenzelm@3550
  1508
   congs = map (fn (_, {thm, ...}) => thm) congs,
wenzelm@3550
  1509
   procs =
wenzelm@3550
  1510
     map (fn (_, {name, lhs, id, ...}) => ((name, lhs), id)) (Net.dest procs)
wenzelm@3550
  1511
     |> partition_eq eq_snd
wenzelm@3550
  1512
     |> map (fn ps => (#1 (#1 (hd ps)), map (#2 o #1) ps))};
wenzelm@3550
  1513
wenzelm@3550
  1514
wenzelm@3550
  1515
(* merge_mss *)		(*NOTE: ignores mk_rews and termless of 2nd mss*)
wenzelm@3550
  1516
wenzelm@3550
  1517
fun merge_mss
wenzelm@3550
  1518
 (Mss {rules = rules1, congs = congs1, procs = procs1, bounds = bounds1,
wenzelm@3550
  1519
    prems = prems1, mk_rews, termless},
wenzelm@3550
  1520
  Mss {rules = rules2, congs = congs2, procs = procs2, bounds = bounds2,
wenzelm@3550
  1521
    prems = prems2, ...}) =
wenzelm@3550
  1522
      mk_mss
wenzelm@3550
  1523
       (Net.merge (rules1, rules2, eq_rrule),
wenzelm@3550
  1524
        generic_merge (eq_cong o pairself snd) I I congs1 congs2,
wenzelm@3550
  1525
        Net.merge (procs1, procs2, eq_simproc),
wenzelm@3550
  1526
        merge_lists bounds1 bounds2,
wenzelm@3550
  1527
        generic_merge eq_prem I I prems1 prems2,
wenzelm@3550
  1528
        mk_rews, termless);
wenzelm@3550
  1529
wenzelm@3550
  1530
wenzelm@2509
  1531
(* mk_rrule *)
wenzelm@2509
  1532
wenzelm@2509
  1533
fun vperm (Var _, Var _) = true
wenzelm@2509
  1534
  | vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t)
wenzelm@2509
  1535
  | vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2)
wenzelm@2509
  1536
  | vperm (t, u) = (t = u);
wenzelm@2509
  1537
wenzelm@2509
  1538
fun var_perm (t, u) =
wenzelm@2509
  1539
  vperm (t, u) andalso eq_set_term (term_vars t, term_vars u);
wenzelm@2509
  1540
wenzelm@2509
  1541
(*simple test for looping rewrite*)
wenzelm@2509
  1542
fun loops sign prems (lhs, rhs) =
nipkow@2792
  1543
   is_Var (head_of lhs)
wenzelm@2509
  1544
  orelse
wenzelm@2509
  1545
   (exists (apl (lhs, Logic.occs)) (rhs :: prems))
wenzelm@2509
  1546
  orelse
wenzelm@2509
  1547
   (null prems andalso
wenzelm@2509
  1548
    Pattern.matches (#tsig (Sign.rep_sg sign)) (lhs, rhs));
wenzelm@2509
  1549
(*the condition "null prems" in the last case is necessary because
wenzelm@2509
  1550
  conditional rewrites with extra variables in the conditions may terminate
wenzelm@2509
  1551
  although the rhs is an instance of the lhs. Example:
wenzelm@2509
  1552
  ?m < ?n ==> f(?n) == f(?m)*)
wenzelm@2509
  1553
wenzelm@2509
  1554
fun mk_rrule (thm as Thm {sign, prop, ...}) =
wenzelm@1238
  1555
  let
wenzelm@2509
  1556
    val prems = Logic.strip_imp_prems prop;
wenzelm@2509
  1557
    val concl = Logic.strip_imp_concl prop;
wenzelm@2509
  1558
    val (lhs, _) = Logic.dest_equals concl handle TERM _ =>
wenzelm@2509
  1559
      raise SIMPLIFIER ("Rewrite rule not a meta-equality", thm);
wenzelm@2509
  1560
    val econcl = Pattern.eta_contract concl;
wenzelm@2509
  1561
    val (elhs, erhs) = Logic.dest_equals econcl;
wenzelm@2509
  1562
    val perm = var_perm (elhs, erhs) andalso not (elhs aconv erhs)
wenzelm@2509
  1563
      andalso not (is_Var elhs);
wenzelm@2509
  1564
  in
wenzelm@2509
  1565
    if not ((term_vars erhs) subset
paulson@2671
  1566
        (union_term (term_vars elhs, List.concat(map term_vars prems)))) then
wenzelm@2509
  1567
      (prtm_warning "extra Var(s) on rhs" sign prop; None)
wenzelm@2509
  1568
    else if not perm andalso loops sign prems (elhs, erhs) then
wenzelm@2509
  1569
      (prtm_warning "ignoring looping rewrite rule" sign prop; None)
wenzelm@2509
  1570
    else Some {thm = thm, lhs = lhs, perm = perm}
clasohm@0
  1571
  end;
clasohm@0
  1572
wenzelm@2509
  1573
wenzelm@2509
  1574
(* add_simps *)
nipkow@87
  1575
wenzelm@2509
  1576
fun add_simp
wenzelm@2509
  1577
  (mss as Mss {rules, congs, procs, bounds, prems, mk_rews, termless},
wenzelm@2509
  1578
    thm as Thm {sign, prop, ...}) =
wenzelm@2509
  1579
  (case mk_rrule thm of
nipkow@87
  1580
    None => mss
wenzelm@2509
  1581
  | Some (rrule as {lhs, ...}) =>
nipkow@209
  1582
      (trace_thm "Adding rewrite rule:" thm;
wenzelm@2509
  1583
        mk_mss (Net.insert_term ((lhs, rrule), rules, eq_rrule) handle Net.INSERT =>
wenzelm@2509
  1584
          (prtm_warning "ignoring duplicate rewrite rule" sign prop; rules),
wenzelm@2509
  1585
            congs, procs, bounds, prems, mk_rews, termless)));
clasohm@0
  1586
clasohm@0
  1587
val add_simps = foldl add_simp;
wenzelm@2509
  1588
wenzelm@2509
  1589
fun mss_of thms = add_simps (empty_mss, thms);
wenzelm@2509
  1590
wenzelm@2509
  1591
wenzelm@2509
  1592
(* del_simps *)
wenzelm@2509
  1593
wenzelm@2509
  1594
fun del_simp
wenzelm@2509
  1595
  (mss as Mss {rules, congs, procs, bounds, prems, mk_rews, termless},
wenzelm@2509
  1596
    thm as Thm {sign, prop, ...}) =
wenzelm@2509
  1597
  (case mk_rrule thm of
wenzelm@2509
  1598
    None => mss
wenzelm@2509
  1599
  | Some (rrule as {lhs, ...}) =>
wenzelm@2509
  1600
      mk_mss (Net.delete_term ((lhs, rrule), rules, eq_rrule) handle Net.DELETE =>
wenzelm@2509
  1601
        (prtm_warning "rewrite rule not in simpset" sign prop; rules),
wenzelm@2509
  1602
          congs, procs, bounds, prems, mk_rews, termless));
wenzelm@2509
  1603
nipkow@87
  1604
val del_simps = foldl del_simp;
clasohm@0
  1605
wenzelm@2509
  1606
oheimb@2626
  1607
(* add_congs *)
clasohm@0
  1608
wenzelm@2509
  1609
fun add_cong (Mss {rules, congs, procs, bounds, prems, mk_rews, termless}, thm) =
wenzelm@2509
  1610
  let
wenzelm@2509
  1611
    val (lhs, _) = Logic.dest_equals (concl_of thm) handle TERM _ =>
wenzelm@2509
  1612
      raise SIMPLIFIER ("Congruence not a meta-equality", thm);
wenzelm@2509
  1613
(*   val lhs = Pattern.eta_contract lhs; *)
wenzelm@2509
  1614
    val (a, _) = dest_Const (head_of lhs) handle TERM _ =>
wenzelm@2509
  1615
      raise SIMPLIFIER ("Congruence must start with a constant", thm);
wenzelm@2509
  1616
  in
wenzelm@2509
  1617
    mk_mss (rules, (a, {lhs = lhs, thm = thm}) :: congs, procs, bounds,
wenzelm@2509
  1618
      prems, mk_rews, termless)
clasohm@0
  1619
  end;
clasohm@0
  1620
clasohm@0
  1621
val (op add_congs) = foldl add_cong;
clasohm@0
  1622
wenzelm@2509
  1623
oheimb@2626
  1624
(* del_congs *)
oheimb@2626
  1625
oheimb@2626
  1626
fun del_cong (Mss {rules, congs, procs, bounds, prems, mk_rews, termless}, thm) =
oheimb@2626
  1627
  let
oheimb@2626
  1628
    val (lhs, _) = Logic.dest_equals (concl_of thm) handle TERM _ =>
oheimb@2626
  1629
      raise SIMPLIFIER ("Congruence not a meta-equality", thm);
oheimb@2626
  1630
(*   val lhs = Pattern.eta_contract lhs; *)
oheimb@2626
  1631
    val (a, _) = dest_Const (head_of lhs) handle TERM _ =>
oheimb@2626
  1632
      raise SIMPLIFIER ("Congruence must start with a constant", thm);
oheimb@2626
  1633
  in
oheimb@2626
  1634
    mk_mss (rules, filter (fn (x,_)=> x<>a) congs, procs, bounds,
oheimb@2626
  1635
      prems, mk_rews, termless)
oheimb@2626
  1636
  end;
oheimb@2626
  1637
oheimb@2626
  1638
val (op del_congs) = foldl del_cong;
oheimb@2626
  1639
oheimb@2626
  1640
wenzelm@2509
  1641
(* add_simprocs *)
wenzelm@2509
  1642
wenzelm@3550
  1643
fun add_proc (mss as Mss {rules, congs, procs, bounds, prems, mk_rews, termless},
wenzelm@3550
  1644
    (name, lhs as Cterm {sign, t, ...}, proc, id)) =
wenzelm@3550
  1645
  (trace_term ("Adding simplification procedure " ^ name ^ " for:") sign t;
wenzelm@2509
  1646
    mk_mss (rules, congs,
wenzelm@3550
  1647
      Net.insert_term ((t, mk_simproc (name, proc, lhs, id)), procs, eq_simproc)
wenzelm@3550
  1648
        handle Net.INSERT => (trace_warning "ignored duplicate"; procs),
wenzelm@2509
  1649
        bounds, prems, mk_rews, termless));
clasohm@0
  1650
wenzelm@3550
  1651
fun add_simproc (mss, (name, lhss, proc, id)) =
wenzelm@3550
  1652
  foldl add_proc (mss, map (fn lhs => (name, lhs, proc, id)) lhss);
wenzelm@3550
  1653
wenzelm@2509
  1654
val add_simprocs = foldl add_simproc;
wenzelm@2509
  1655
wenzelm@2509
  1656
wenzelm@2509
  1657
(* del_simprocs *)
clasohm@0
  1658
wenzelm@3550
  1659
fun del_proc (mss as Mss {rules, congs, procs, bounds, prems, mk_rews, termless},
wenzelm@3550
  1660
    (name, lhs as Cterm {t, ...}, proc, id)) =
wenzelm@2509
  1661
  mk_mss (rules, congs,
wenzelm@3550
  1662
    Net.delete_term ((t, mk_simproc (name, proc, lhs, id)), procs, eq_simproc)
wenzelm@3550
  1663
      handle Net.DELETE => (trace_warning "simplification procedure not in simpset"; procs),
wenzelm@3550
  1664
      bounds, prems, mk_rews, termless);
wenzelm@3550
  1665
wenzelm@3550
  1666
fun del_simproc (mss, (name, lhss, proc, id)) =
wenzelm@3550
  1667
  foldl del_proc (mss, map (fn lhs => (name, lhs, proc, id)) lhss);
wenzelm@2509
  1668
wenzelm@2509
  1669
val del_simprocs = foldl del_simproc;
clasohm@0
  1670
clasohm@0
  1671
wenzelm@2509
  1672
(* prems *)
wenzelm@2509
  1673
wenzelm@2509
  1674
fun add_prems (Mss {rules, congs, procs, bounds, prems, mk_rews, termless}, thms) =
wenzelm@2509
  1675
  mk_mss (rules, congs, procs, bounds, thms @ prems, mk_rews, termless);
wenzelm@2509
  1676
wenzelm@2509
  1677
fun prems_of_mss (Mss {prems, ...}) = prems;
wenzelm@2509
  1678
wenzelm@2509
  1679
wenzelm@2509
  1680
(* mk_rews *)
wenzelm@2509
  1681
wenzelm@2509
  1682
fun set_mk_rews
wenzelm@2509
  1683
  (Mss {rules, congs, procs, bounds, prems, mk_rews = _, termless}, mk_rews) =
wenzelm@2509
  1684
    mk_mss (rules, congs, procs, bounds, prems, mk_rews, termless);
wenzelm@2509
  1685
wenzelm@2509
  1686
fun mk_rews_of_mss (Mss {mk_rews, ...}) = mk_rews;
wenzelm@2509
  1687
wenzelm@2509
  1688
wenzelm@2509
  1689
(* termless *)
wenzelm@2509
  1690
wenzelm@2509
  1691
fun set_termless
wenzelm@2509
  1692
  (Mss {rules, congs, procs, bounds, prems, mk_rews, termless = _}, termless) =
wenzelm@2509
  1693
    mk_mss (rules, congs, procs, bounds, prems, mk_rews, termless);
wenzelm@2509
  1694
wenzelm@2509
  1695
wenzelm@2509
  1696
wenzelm@2509
  1697
(** rewriting **)
wenzelm@2509
  1698
wenzelm@2509
  1699
(*
wenzelm@2509
  1700
  Uses conversions, omitting proofs for efficiency.  See:
wenzelm@2509
  1701
    L C Paulson, A higher-order implementation of rewriting,
wenzelm@2509
  1702
    Science of Computer Programming 3 (1983), pages 119-149.
wenzelm@2509
  1703
*)
clasohm@0
  1704
clasohm@0
  1705
type prover = meta_simpset -> thm -> thm option;
clasohm@0
  1706
type termrec = (Sign.sg * term list) * term;
clasohm@0
  1707
type conv = meta_simpset -> termrec -> termrec;
clasohm@0
  1708
paulson@1529
  1709
fun check_conv (thm as Thm{shyps,hyps,prop,sign,der,maxidx,...}, prop0, ders) =
nipkow@432
  1710
  let fun err() = (trace_thm "Proved wrong thm (Check subgoaler?)" thm;
nipkow@432
  1711
                   trace_term "Should have proved" sign prop0;
nipkow@432
  1712
                   None)
clasohm@0
  1713
      val (lhs0,_) = Logic.dest_equals(Logic.strip_imp_concl prop0)
clasohm@0
  1714
  in case prop of
clasohm@0
  1715
       Const("==",_) $ lhs $ rhs =>
clasohm@0
  1716
         if (lhs = lhs0) orelse
nipkow@427
  1717
            (lhs aconv Envir.norm_term (Envir.empty 0) lhs0)
paulson@1529
  1718
         then (trace_thm "SUCCEEDED" thm; 
wenzelm@2386
  1719
               Some(shyps, hyps, maxidx, rhs, der::ders))
clasohm@0
  1720
         else err()
clasohm@0
  1721
     | _ => err()
clasohm@0
  1722
  end;
clasohm@0
  1723
nipkow@659
  1724
fun ren_inst(insts,prop,pat,obj) =
nipkow@659
  1725
  let val ren = match_bvs(pat,obj,[])
nipkow@659
  1726
      fun renAbs(Abs(x,T,b)) =
berghofe@1576
  1727
            Abs(case assoc_string(ren,x) of None => x | Some(y) => y, T, renAbs(b))
nipkow@659
  1728
        | renAbs(f$t) = renAbs(f) $ renAbs(t)
nipkow@659
  1729
        | renAbs(t) = t
nipkow@659
  1730
  in subst_vars insts (if null(ren) then prop else renAbs(prop)) end;
nipkow@678
  1731
wenzelm@1258
  1732
fun add_insts_sorts ((iTs, is), Ss) =
wenzelm@1258
  1733
  add_typs_sorts (map snd iTs, add_terms_sorts (map snd is, Ss));
wenzelm@1258
  1734
nipkow@659
  1735
wenzelm@2509
  1736
(* mk_procrule *)
wenzelm@2509
  1737
wenzelm@2509
  1738
fun mk_procrule (thm as Thm {sign, prop, ...}) =
wenzelm@2509
  1739
  let
wenzelm@2509
  1740
    val prems = Logic.strip_imp_prems prop;
wenzelm@2509
  1741
    val concl = Logic.strip_imp_concl prop;
wenzelm@2509
  1742
    val (lhs, _) = Logic.dest_equals concl handle TERM _ =>
wenzelm@2509
  1743
      raise SIMPLIFIER ("Rewrite rule not a meta-equality", thm);
wenzelm@2509
  1744
    val econcl = Pattern.eta_contract concl;
wenzelm@2509
  1745
    val (elhs, erhs) = Logic.dest_equals econcl;
wenzelm@2509
  1746
  in
wenzelm@2509
  1747
    if not ((term_vars erhs) subset
paulson@2671
  1748
        (union_term (term_vars elhs, List.concat(map term_vars prems)))) 
paulson@2671
  1749
    then (prtm_warning "extra Var(s) on rhs" sign prop; [])
wenzelm@2509
  1750
    else [{thm = thm, lhs = lhs, perm = false}]
wenzelm@2509
  1751
  end;
wenzelm@2509
  1752
wenzelm@2509
  1753
wenzelm@2509
  1754
(* conversion to apply the meta simpset to a term *)
wenzelm@2509
  1755
wenzelm@2509
  1756
(*
wenzelm@2509
  1757
  we try in order:
wenzelm@2509
  1758
    (1) beta reduction
wenzelm@2509
  1759
    (2) unconditional rewrite rules
wenzelm@2509
  1760
    (3) conditional rewrite rules
wenzelm@3550
  1761
    (4) simplification procedures
wenzelm@2509
  1762
*)
wenzelm@2509
  1763
wenzelm@2509
  1764
fun rewritec (prover,signt) (mss as Mss{rules, procs, mk_rews, termless, ...}) 
paulson@2147
  1765
             (shypst,hypst,maxt,t,ders) =
wenzelm@3550
  1766
  let
wenzelm@3550
  1767
      val tsigt = #tsig(Sign.rep_sg signt);
wenzelm@3550
  1768
      fun rew {thm as Thm{sign,der,maxidx,shyps,hyps,prop,...}, lhs, perm} =
wenzelm@250
  1769
        let val unit = if Sign.subsig(sign,signt) then ()
berghofe@1580
  1770
                  else (trace_thm_warning "rewrite rule from different theory"
clasohm@446
  1771
                          thm;
nipkow@208
  1772
                        raise Pattern.MATCH)
paulson@2147
  1773
            val rprop = if maxt = ~1 then prop
paulson@2147
  1774
                        else Logic.incr_indexes([],maxt+1) prop;
paulson@2147
  1775
            val rlhs = if maxt = ~1 then lhs
nipkow@1065
  1776
                       else fst(Logic.dest_equals(Logic.strip_imp_concl rprop))
wenzelm@3550
  1777
            val insts = Pattern.match tsigt (rlhs,t);
nipkow@1065
  1778
            val prop' = ren_inst(insts,rprop,rlhs,t);
paulson@2177
  1779
            val hyps' = union_term(hyps,hypst);
paulson@2177
  1780
            val shyps' = add_insts_sorts (insts, union_sort(shyps,shypst));
nipkow@1065
  1781
            val maxidx' = maxidx_of_term prop'
wenzelm@2386
  1782
            val ct' = Cterm{sign = signt,       (*used for deriv only*)
wenzelm@2386
  1783
                            t = prop',
wenzelm@2386
  1784
                            T = propT,
wenzelm@2386
  1785
                            maxidx = maxidx'}
wenzelm@3550
  1786
            val der' = infer_derivs (RewriteC ct', [der]);
paulson@1529
  1787
            val thm' = Thm{sign = signt, 
wenzelm@2386
  1788
                           der = der',
wenzelm@2386
  1789
                           shyps = shyps',
wenzelm@2386
  1790
                           hyps = hyps',
paulson@1529
  1791
                           prop = prop',
wenzelm@2386
  1792
                           maxidx = maxidx'}
nipkow@427
  1793
            val (lhs',rhs') = Logic.dest_equals(Logic.strip_imp_concl prop')
nipkow@427
  1794
        in if perm andalso not(termless(rhs',lhs')) then None else
nipkow@427
  1795
           if Logic.count_prems(prop',0) = 0
paulson@1529
  1796
           then (trace_thm "Rewriting:" thm'; 
wenzelm@2386
  1797
                 Some(shyps', hyps', maxidx', rhs', der'::ders))
clasohm@0
  1798
           else (trace_thm "Trying to rewrite:" thm';
clasohm@0
  1799
                 case prover mss thm' of
clasohm@0
  1800
                   None       => (trace_thm "FAILED" thm'; None)
paulson@1529
  1801
                 | Some(thm2) => check_conv(thm2,prop',ders))
clasohm@0
  1802
        end
clasohm@0
  1803
nipkow@225
  1804
      fun rews [] = None
wenzelm@2509
  1805
        | rews (rrule :: rrules) =
nipkow@225
  1806
            let val opt = rew rrule handle Pattern.MATCH => None
nipkow@225
  1807
            in case opt of None => rews rrules | some => some end;
wenzelm@3550
  1808
oheimb@1659
  1809
      fun sort_rrules rrs = let
wenzelm@2386
  1810
        fun is_simple {thm as Thm{prop,...}, lhs, perm} = case prop of 
wenzelm@2386
  1811
                                        Const("==",_) $ _ $ _ => true
wenzelm@2386
  1812
                                        | _                   => false 
wenzelm@2386
  1813
        fun sort []        (re1,re2) = re1 @ re2
wenzelm@2386
  1814
        |   sort (rr::rrs) (re1,re2) = if is_simple rr 
wenzelm@2386
  1815
                                       then sort rrs (rr::re1,re2)
wenzelm@2386
  1816
                                       else sort rrs (re1,rr::re2)
oheimb@1659
  1817
      in sort rrs ([],[]) 
oheimb@1659
  1818
      end
wenzelm@2509
  1819
wenzelm@3550
  1820
      fun proc_rews _ ([]:simproc list) = None
wenzelm@3550
  1821
        | proc_rews eta_t ({name, proc, lhs = Cterm {t = plhs, ...}, ...} :: ps) =
wenzelm@3550
  1822
            if Pattern.matches tsigt (plhs, t) then
wenzelm@3558
  1823
             (trace_term ("Trying procedure " ^ name ^ " on:") signt eta_t;
wenzelm@3558
  1824
              case proc signt eta_t of
wenzelm@3558
  1825
                None => (trace "FAILED"; proc_rews eta_t ps)
wenzelm@3550
  1826
              | Some raw_thm =>
wenzelm@3558
  1827
                 (trace_thm ("Procedure " ^ name ^ " proved rewrite rule:") raw_thm;
wenzelm@3550
  1828
                   (case rews (mk_procrule raw_thm) of
wenzelm@3558
  1829
                     None => (trace "IGNORED"; proc_rews eta_t ps)
wenzelm@3550
  1830
                   | some => some)))
wenzelm@3550
  1831
            else proc_rews eta_t ps;
wenzelm@2509
  1832
  in
nipkow@2792
  1833
    (case t of
wenzelm@3550
  1834
      Abs (_, _, body) $ u =>
wenzelm@2509
  1835
        Some (shypst, hypst, maxt, subst_bound (u, body), ders)
wenzelm@2509
  1836
     | _ =>
nipkow@2792
  1837
      (case rews (sort_rrules (Net.match_term rules t)) of
wenzelm@3012
  1838
        None => proc_rews (Pattern.eta_contract t) (Net.match_term procs t)
wenzelm@2509
  1839
      | some => some))
clasohm@0
  1840
  end;
clasohm@0
  1841
wenzelm@2509
  1842
wenzelm@2509
  1843
(* conversion to apply a congruence rule to a term *)
wenzelm@2509
  1844
paulson@2147
  1845
fun congc (prover,signt) {thm=cong,lhs=lhs} (shypst,hypst,maxt,t,ders) =
paulson@1529
  1846
  let val Thm{sign,der,shyps,hyps,maxidx,prop,...} = cong
nipkow@208
  1847
      val unit = if Sign.subsig(sign,signt) then ()
nipkow@208
  1848
                 else error("Congruence rule from different theory")
nipkow@208
  1849
      val tsig = #tsig(Sign.rep_sg signt)
paulson@2147
  1850
      val rprop = if maxt = ~1 then prop
paulson@2147
  1851
                  else Logic.incr_indexes([],maxt+1) prop;
paulson@2147
  1852
      val rlhs = if maxt = ~1 then lhs
nipkow@1065
  1853
                 else fst(Logic.dest_equals(Logic.strip_imp_concl rprop))
nipkow@1569
  1854
      val insts = Pattern.match tsig (rlhs,t)
nipkow@1569
  1855
      (* Pattern.match can raise Pattern.MATCH;
nipkow@1569
  1856
         is handled when congc is called *)
nipkow@1065
  1857
      val prop' = ren_inst(insts,rprop,rlhs,t);
paulson@2177
  1858
      val shyps' = add_insts_sorts (insts, union_sort(shyps,shypst))
paulson@1529
  1859
      val maxidx' = maxidx_of_term prop'
wenzelm@2386
  1860
      val ct' = Cterm{sign = signt,     (*used for deriv only*)
wenzelm@2386
  1861
                      t = prop',
wenzelm@2386
  1862
                      T = propT,
wenzelm@2386
  1863
                      maxidx = maxidx'}
paulson@1529
  1864
      val thm' = Thm{sign = signt, 
wenzelm@3550
  1865
                     der = infer_derivs (CongC ct', [der]),
wenzelm@2386
  1866
                     shyps = shyps',
wenzelm@2386
  1867
                     hyps = union_term(hyps,hypst),
paulson@1529
  1868
                     prop = prop',
wenzelm@2386
  1869
                     maxidx = maxidx'};
clasohm@0
  1870
      val unit = trace_thm "Applying congruence rule" thm';
nipkow@112
  1871
      fun err() = error("Failed congruence proof!")
clasohm@0
  1872
clasohm@0
  1873
  in case prover thm' of
nipkow@112
  1874
       None => err()
paulson@1529
  1875
     | Some(thm2) => (case check_conv(thm2,prop',ders) of
nipkow@405
  1876
                        None => err() | some => some)
clasohm@0
  1877
  end;
clasohm@0
  1878
clasohm@0
  1879
nipkow@405
  1880
nipkow@214
  1881
fun bottomc ((simprem,useprem),prover,sign) =
paulson@1529
  1882
 let fun botc fail mss trec =
wenzelm@2386
  1883
          (case subc mss trec of
wenzelm@2386
  1884
             some as Some(trec1) =>
wenzelm@2386
  1885
               (case rewritec (prover,sign) mss trec1 of
wenzelm@2386
  1886
                  Some(trec2) => botc false mss trec2
wenzelm@2386
  1887
                | None => some)
wenzelm@2386
  1888
           | None =>
wenzelm@2386
  1889
               (case rewritec (prover,sign) mss trec of
wenzelm@2386
  1890
                  Some(trec2) => botc false mss trec2
wenzelm@2386
  1891
                | None => if fail then None else Some(trec)))
clasohm@0
  1892
paulson@1529
  1893
     and try_botc mss trec = (case botc true mss trec of
wenzelm@2386
  1894
                                Some(trec1) => trec1
wenzelm@2386
  1895
                              | None => trec)
nipkow@405
  1896
wenzelm@2509
  1897
     and subc (mss as Mss{rules,congs,procs,bounds,prems,mk_rews,termless})
wenzelm@2386
  1898
              (trec as (shyps,hyps,maxidx,t0,ders)) =
paulson@1529
  1899
       (case t0 of
wenzelm@2386
  1900
           Abs(a,T,t) =>
wenzelm@2386
  1901
             let val b = variant bounds a
wenzelm@2386
  1902
                 val v = Free("." ^ b,T)
wenzelm@2509
  1903
                 val mss' = mk_mss (rules, congs, procs, b :: bounds, prems, mk_rews, termless)
wenzelm@2386
  1904
             in case botc true mss' 
wenzelm@2386
  1905
                       (shyps,hyps,maxidx,subst_bound (v,t),ders) of
wenzelm@2386
  1906
                  Some(shyps',hyps',maxidx',t',ders') =>
wenzelm@2386
  1907
                    Some(shyps', hyps', maxidx',
wenzelm@2386
  1908
                         Abs(a, T, abstract_over(v,t')),
wenzelm@2386
  1909
                         ders')
wenzelm@2386
  1910
                | None => None
wenzelm@2386
  1911
             end
wenzelm@2386
  1912
         | t$u => (case t of
wenzelm@2386
  1913
             Const("==>",_)$s  => Some(impc(shyps,hyps,maxidx,s,u,mss,ders))
wenzelm@2386
  1914
           | Abs(_,_,body) =>
wenzelm@2386
  1915
               let val trec = (shyps,hyps,maxidx,subst_bound (u,body),ders)
wenzelm@2386
  1916
               in case subc mss trec of
wenzelm@2386
  1917
                    None => Some(trec)
wenzelm@2386
  1918
                  | trec => trec
wenzelm@2386
  1919
               end
wenzelm@2386
  1920
           | _  =>
wenzelm@2386
  1921
               let fun appc() =
wenzelm@2386
  1922
                     (case botc true mss (shyps,hyps,maxidx,t,ders) of
wenzelm@2386
  1923
                        Some(shyps1,hyps1,maxidx1,t1,ders1) =>
wenzelm@2386
  1924
                          (case botc true mss (shyps1,hyps1,maxidx,u,ders1) of
wenzelm@2386
  1925
                             Some(shyps2,hyps2,maxidx2,u1,ders2) =>
wenzelm@2386
  1926
                               Some(shyps2, hyps2, Int.max(maxidx1,maxidx2),
wenzelm@2386
  1927
                                    t1$u1, ders2)
wenzelm@2386
  1928
                           | None =>
wenzelm@2386
  1929
                               Some(shyps1, hyps1, Int.max(maxidx1,maxidx), t1$u,
wenzelm@2386
  1930
                                    ders1))
wenzelm@2386
  1931
                      | None =>
wenzelm@2386
  1932
                          (case botc true mss (shyps,hyps,maxidx,u,ders) of
wenzelm@2386
  1933
                             Some(shyps1,hyps1,maxidx1,u1,ders1) =>
wenzelm@2386
  1934
                               Some(shyps1, hyps1, Int.max(maxidx,maxidx1), 
wenzelm@2386
  1935
                                    t$u1, ders1)
wenzelm@2386
  1936
                           | None => None))
wenzelm@2386
  1937
                   val (h,ts) = strip_comb t
wenzelm@2386
  1938
               in case h of
wenzelm@2386
  1939
                    Const(a,_) =>
wenzelm@2386
  1940
                      (case assoc_string(congs,a) of
wenzelm@2386
  1941
                         None => appc()
wenzelm@2386
  1942
                       | Some(cong) => (congc (prover mss,sign) cong trec
nipkow@1569
  1943
                                        handle Pattern.MATCH => appc() ) )
wenzelm@2386
  1944
                  | _ => appc()
wenzelm@2386
  1945
               end)
wenzelm@2386
  1946
         | _ => None)
clasohm@0
  1947
paulson@1529
  1948
     and impc(shyps, hyps, maxidx, s, u, mss as Mss{mk_rews,...}, ders) =
paulson@1529
  1949
       let val (shyps1,hyps1,_,s1,ders1) =
wenzelm@2386
  1950
             if simprem then try_botc mss (shyps,hyps,maxidx,s,ders)
wenzelm@2386
  1951
                        else (shyps,hyps,0,s,ders);
wenzelm@2386
  1952
           val maxidx1 = maxidx_of_term s1
wenzelm@2386
  1953
           val mss1 =
nipkow@2535
  1954
             if not useprem then mss else
nipkow@2620
  1955
             if maxidx1 <> ~1 then (trace_term_warning
nipkow@2535
  1956
"Cannot add premise as rewrite rule because it contains (type) unknowns:"
nipkow@2535
  1957
                                                  sign s1; mss)
wenzelm@2386
  1958
             else let val thm = assume (Cterm{sign=sign, t=s1, 
wenzelm@2386
  1959
                                              T=propT, maxidx=maxidx1})
wenzelm@2386
  1960
                  in add_simps(add_prems(mss,[thm]), mk_rews thm) end
wenzelm@2386
  1961
           val (shyps2,hyps2,maxidx2,u1,ders2) = 
wenzelm@2386
  1962
               try_botc mss1 (shyps1,hyps1,maxidx,u,ders1)
wenzelm@2386
  1963
           val hyps3 = if gen_mem (op aconv) (s1, hyps1) 
wenzelm@2386
  1964
                       then hyps2 else hyps2\s1
paulson@2147
  1965
       in (shyps2, hyps3, Int.max(maxidx1,maxidx2), 
wenzelm@2386
  1966
           Logic.mk_implies(s1,u1), ders2) 
paulson@1529
  1967
       end
clasohm@0
  1968
paulson@1529
  1969
 in try_botc end;
clasohm@0
  1970
clasohm@0
  1971
clasohm@0
  1972
(*** Meta-rewriting: rewrites t to u and returns the theorem t==u ***)
wenzelm@2509
  1973
wenzelm@2509
  1974
(*
wenzelm@2509
  1975
  Parameters:
wenzelm@2509
  1976
    mode = (simplify A, use A in simplifying B) when simplifying A ==> B
wenzelm@2509
  1977
    mss: contains equality theorems of the form [|p1,...|] ==> t==u
wenzelm@2509
  1978
    prover: how to solve premises in conditional rewrites and congruences
clasohm@0
  1979
*)
wenzelm@2509
  1980
wenzelm@2509
  1981
(* FIXME: check that #bounds(mss) does not "occur" in ct alread *)
wenzelm@2509
  1982
nipkow@214
  1983
fun rewrite_cterm mode mss prover ct =
lcp@229
  1984
  let val {sign, t, T, maxidx} = rep_cterm ct;
paulson@2147
  1985
      val (shyps,hyps,maxu,u,ders) =
paulson@1529
  1986
        bottomc (mode,prover,sign) mss 
wenzelm@2386
  1987
                (add_term_sorts(t,[]), [], maxidx, t, []);
clasohm@0
  1988
      val prop = Logic.mk_equals(t,u)
wenzelm@1258
  1989
  in
paulson@1529
  1990
      Thm{sign = sign, 
wenzelm@2386
  1991
          der = infer_derivs (Rewrite_cterm ct, ders),
wenzelm@2386
  1992
          maxidx = Int.max (maxidx,maxu),
wenzelm@2386
  1993
          shyps = shyps, 
wenzelm@2386
  1994
          hyps = hyps, 
paulson@1529
  1995
          prop = prop}
clasohm@0
  1996
  end
clasohm@0
  1997
paulson@1539
  1998
wenzelm@2509
  1999
wenzelm@2509
  2000
(*** Oracles ***)
wenzelm@2509
  2001
paulson@1539
  2002
fun invoke_oracle (thy, sign, exn) =
paulson@1539
  2003
    case #oraopt(rep_theory thy) of
wenzelm@2386
  2004
        None => raise THM ("No oracle in supplied theory", 0, [])
paulson@1539
  2005
      | Some oracle => 
wenzelm@2386
  2006
            let val sign' = Sign.merge(sign_of thy, sign)
wenzelm@2386
  2007
                val (prop, T, maxidx) = 
wenzelm@2386
  2008
                    Sign.certify_term sign' (oracle (sign', exn))
paulson@1539
  2009
            in if T<>propT then
paulson@1539
  2010
                  raise THM("Oracle's result must have type prop", 0, [])
wenzelm@2386
  2011
               else fix_shyps [] []
wenzelm@2386
  2012
                     (Thm {sign = sign', 
wenzelm@2386
  2013
                           der = Join (Oracle(thy,sign,exn), []),
wenzelm@2386
  2014
                           maxidx = maxidx,
wenzelm@2386
  2015
                           shyps = [], 
wenzelm@2386
  2016
                           hyps = [], 
wenzelm@2386
  2017
                           prop = prop})
paulson@1539
  2018
            end;
paulson@1539
  2019
clasohm@0
  2020
end;
paulson@1503
  2021
paulson@1503
  2022
open Thm;