src/Pure/logic.ML
author wenzelm
Tue Apr 11 16:00:02 2006 +0200 (2006-04-11)
changeset 19406 410b9d9bf9a1
parent 19391 4812d28c90a6
child 19425 e0d7d9373faf
permissions -rw-r--r--
added mk_classrel, dest_classrel, mk_arities, dest_arity (from axclass.ML);
tuned;
wenzelm@9460
     1
(*  Title:      Pure/logic.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@9460
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   Cambridge University 1992
clasohm@0
     5
wenzelm@9460
     6
Abstract syntax operations of the Pure meta-logic.
clasohm@0
     7
*)
clasohm@0
     8
wenzelm@9460
     9
signature LOGIC =
wenzelm@4345
    10
sig
wenzelm@18181
    11
  val is_all: term -> bool
wenzelm@18762
    12
  val dest_all: term -> typ * term
wenzelm@18181
    13
  val mk_equals: term * term -> term
wenzelm@18181
    14
  val dest_equals: term -> term * term
wenzelm@18181
    15
  val is_equals: term -> bool
wenzelm@18181
    16
  val mk_implies: term * term -> term
wenzelm@18181
    17
  val dest_implies: term -> term * term
wenzelm@18181
    18
  val is_implies: term -> bool
wenzelm@18181
    19
  val list_implies: term list * term -> term
wenzelm@18181
    20
  val strip_imp_prems: term -> term list
wenzelm@18181
    21
  val strip_imp_concl: term -> term
wenzelm@18181
    22
  val strip_prems: int * term list * term -> term list * term
wenzelm@18181
    23
  val count_prems: term * int -> int
wenzelm@18181
    24
  val nth_prem: int * term -> term
wenzelm@19125
    25
  val conjunction: term
wenzelm@18181
    26
  val mk_conjunction: term * term -> term
wenzelm@12757
    27
  val mk_conjunction_list: term list -> term
wenzelm@18499
    28
  val mk_conjunction_list2: term list list -> term
wenzelm@18469
    29
  val dest_conjunction: term -> term * term
wenzelm@18469
    30
  val dest_conjunctions: term -> term list
wenzelm@18181
    31
  val strip_horn: term -> term list * term
wenzelm@18938
    32
  val dest_type: term -> typ
wenzelm@18938
    33
  val const_of_class: class -> string
wenzelm@18938
    34
  val class_of_const: string -> class
wenzelm@18938
    35
  val mk_inclass: typ * class -> term
wenzelm@18938
    36
  val dest_inclass: term -> typ * class
wenzelm@19406
    37
  val mk_classrel: class * class -> term
wenzelm@19406
    38
  val dest_classrel: term -> class * class
wenzelm@19406
    39
  val mk_arities: string * sort list * sort -> term list
wenzelm@19406
    40
  val dest_arity: term -> string * sort list * class
wenzelm@18938
    41
  val dest_def: Pretty.pp -> (term -> bool) -> (string -> bool) -> (string -> bool) ->
wenzelm@18938
    42
    term -> (term * term) * term
wenzelm@18938
    43
  val abs_def: term -> term * term
wenzelm@18181
    44
  val mk_cond_defpair: term list -> term * term -> string * term
wenzelm@18181
    45
  val mk_defpair: term * term -> string * term
wenzelm@18181
    46
  val mk_type: typ -> term
wenzelm@18181
    47
  val protectC: term
wenzelm@18181
    48
  val protect: term -> term
wenzelm@18181
    49
  val unprotect: term -> term
wenzelm@18181
    50
  val occs: term * term -> bool
wenzelm@18181
    51
  val close_form: term -> term
wenzelm@18938
    52
  val combound: term * int * int -> term
wenzelm@18938
    53
  val rlist_abs: (string * typ) list * term -> term
wenzelm@18181
    54
  val incr_indexes: typ list * int -> term -> term
wenzelm@18181
    55
  val incr_tvar: int -> typ -> typ
wenzelm@18181
    56
  val lift_abs: int -> term -> term -> term
wenzelm@18181
    57
  val lift_all: int -> term -> term -> term
wenzelm@18181
    58
  val strip_assums_hyp: term -> term list
wenzelm@9460
    59
  val strip_assums_concl: term -> term
wenzelm@18181
    60
  val strip_params: term -> (string * typ) list
wenzelm@18181
    61
  val has_meta_prems: term -> int -> bool
wenzelm@18181
    62
  val flatten_params: int -> term -> term
wenzelm@18181
    63
  val auto_rename: bool ref
wenzelm@18181
    64
  val set_rename_prefix: string -> unit
clasohm@0
    65
  val list_rename_params: string list * term -> term
wenzelm@18181
    66
  val assum_pairs: int * term -> (term*term)list
wenzelm@18181
    67
  val varify: term -> term
wenzelm@18181
    68
  val unvarify: term -> term
wenzelm@18181
    69
  val get_goal: term -> int -> term
wenzelm@18181
    70
  val goal_params: term -> int -> term * term list
wenzelm@18181
    71
  val prems_of_goal: term -> int -> term list
wenzelm@18181
    72
  val concl_of_goal: term -> int -> term
wenzelm@4345
    73
end;
clasohm@0
    74
paulson@1500
    75
structure Logic : LOGIC =
clasohm@0
    76
struct
wenzelm@398
    77
wenzelm@4345
    78
clasohm@0
    79
(*** Abstract syntax operations on the meta-connectives ***)
clasohm@0
    80
nipkow@5041
    81
(** all **)
nipkow@5041
    82
nipkow@5041
    83
fun is_all (Const ("all", _) $ _) = true
nipkow@5041
    84
  | is_all _ = false;
nipkow@5041
    85
wenzelm@18762
    86
fun dest_all (Const ("all", Type ("fun", [Type ("fun", [T, _]), _])) $ A) = (T, A)
wenzelm@18762
    87
  | dest_all t = raise TERM ("dest_all", [t]);
wenzelm@18762
    88
wenzelm@18762
    89
nipkow@5041
    90
clasohm@0
    91
(** equality **)
clasohm@0
    92
paulson@1835
    93
(*Make an equality.  DOES NOT CHECK TYPE OF u*)
lcp@64
    94
fun mk_equals(t,u) = equals(fastype_of t) $ t $ u;
clasohm@0
    95
clasohm@0
    96
fun dest_equals (Const("==",_) $ t $ u)  =  (t,u)
clasohm@0
    97
  | dest_equals t = raise TERM("dest_equals", [t]);
clasohm@0
    98
wenzelm@637
    99
fun is_equals (Const ("==", _) $ _ $ _) = true
wenzelm@637
   100
  | is_equals _ = false;
wenzelm@637
   101
wenzelm@637
   102
clasohm@0
   103
(** implies **)
clasohm@0
   104
clasohm@0
   105
fun mk_implies(A,B) = implies $ A $ B;
clasohm@0
   106
clasohm@0
   107
fun dest_implies (Const("==>",_) $ A $ B)  =  (A,B)
clasohm@0
   108
  | dest_implies A = raise TERM("dest_implies", [A]);
clasohm@0
   109
nipkow@5041
   110
fun is_implies (Const ("==>", _) $ _ $ _) = true
nipkow@5041
   111
  | is_implies _ = false;
nipkow@5041
   112
wenzelm@4822
   113
clasohm@0
   114
(** nested implications **)
clasohm@0
   115
clasohm@0
   116
(* [A1,...,An], B  goes to  A1==>...An==>B  *)
wenzelm@18181
   117
fun list_implies ([], B) = B
wenzelm@18181
   118
  | list_implies (A::As, B) = implies $ A $ list_implies(As,B);
clasohm@0
   119
clasohm@0
   120
(* A1==>...An==>B  goes to  [A1,...,An], where B is not an implication *)
clasohm@0
   121
fun strip_imp_prems (Const("==>", _) $ A $ B) = A :: strip_imp_prems B
clasohm@0
   122
  | strip_imp_prems _ = [];
clasohm@0
   123
clasohm@0
   124
(* A1==>...An==>B  goes to B, where B is not an implication *)
clasohm@0
   125
fun strip_imp_concl (Const("==>", _) $ A $ B) = strip_imp_concl B
clasohm@0
   126
  | strip_imp_concl A = A : term;
clasohm@0
   127
clasohm@0
   128
(*Strip and return premises: (i, [], A1==>...Ai==>B)
wenzelm@9460
   129
    goes to   ([Ai, A(i-1),...,A1] , B)         (REVERSED)
clasohm@0
   130
  if  i<0 or else i too big then raises  TERM*)
wenzelm@9460
   131
fun strip_prems (0, As, B) = (As, B)
wenzelm@9460
   132
  | strip_prems (i, As, Const("==>", _) $ A $ B) =
wenzelm@9460
   133
        strip_prems (i-1, A::As, B)
clasohm@0
   134
  | strip_prems (_, As, A) = raise TERM("strip_prems", A::As);
clasohm@0
   135
wenzelm@16130
   136
(*Count premises -- quicker than (length o strip_prems) *)
clasohm@0
   137
fun count_prems (Const("==>", _) $ A $ B, n) = count_prems (B,n+1)
clasohm@0
   138
  | count_prems (_,n) = n;
clasohm@0
   139
wenzelm@16130
   140
(*Select Ai from A1 ==>...Ai==>B*)
wenzelm@16130
   141
fun nth_prem (1, Const ("==>", _) $ A $ _) = A
wenzelm@16130
   142
  | nth_prem (i, Const ("==>", _) $ _ $ B) = nth_prem (i - 1, B)
wenzelm@16130
   143
  | nth_prem (_, A) = raise TERM ("nth_prem", [A]);
wenzelm@16130
   144
berghofe@13659
   145
(*strip a proof state (Horn clause):
berghofe@13659
   146
  B1 ==> ... Bn ==> C   goes to   ([B1, ..., Bn], C)    *)
berghofe@13659
   147
fun strip_horn A = (strip_imp_prems A, strip_imp_concl A);
berghofe@13659
   148
wenzelm@4822
   149
wenzelm@12137
   150
(** conjunction **)
wenzelm@12137
   151
wenzelm@19125
   152
val conjunction = Const ("ProtoPure.conjunction", propT --> propT --> propT);
wenzelm@19125
   153
wenzelm@18499
   154
(*A && B*)
wenzelm@19125
   155
fun mk_conjunction (A, B) = conjunction $ A $ B;
wenzelm@12137
   156
wenzelm@18499
   157
(*A && B && C -- improper*)
wenzelm@12757
   158
fun mk_conjunction_list [] = Term.all propT $ Abs ("dummy", propT, mk_implies (Bound 0, Bound 0))
wenzelm@12757
   159
  | mk_conjunction_list ts = foldr1 mk_conjunction ts;
wenzelm@12137
   160
wenzelm@18499
   161
(*(A1 && B1 && C1) && (A2 && B2 && C2 && D2) && A3 && B3 -- improper*)
wenzelm@18499
   162
fun mk_conjunction_list2 tss =
wenzelm@18499
   163
  mk_conjunction_list (map mk_conjunction_list (filter_out null tss));
wenzelm@18499
   164
wenzelm@18499
   165
(*A && B*)
wenzelm@19125
   166
fun dest_conjunction (Const ("ProtoPure.conjunction", _) $ A $ B) = (A, B)
wenzelm@18469
   167
  | dest_conjunction t = raise TERM ("dest_conjunction", [t]);
wenzelm@18469
   168
wenzelm@18499
   169
(*((A && B) && C) && D && E -- flat*)
wenzelm@18469
   170
fun dest_conjunctions t =
wenzelm@18469
   171
  (case try dest_conjunction t of
wenzelm@18469
   172
    NONE => [t]
wenzelm@18469
   173
  | SOME (A, B) => dest_conjunctions A @ dest_conjunctions B);
wenzelm@18469
   174
wenzelm@18469
   175
wenzelm@12137
   176
wenzelm@398
   177
(** types as terms **)
wenzelm@398
   178
wenzelm@19391
   179
fun mk_type ty = Const ("TYPE", Term.itselfT ty);
wenzelm@398
   180
wenzelm@398
   181
fun dest_type (Const ("TYPE", Type ("itself", [ty]))) = ty
wenzelm@398
   182
  | dest_type t = raise TERM ("dest_type", [t]);
wenzelm@398
   183
wenzelm@4822
   184
wenzelm@19406
   185
wenzelm@19406
   186
(** type classes **)
wenzelm@19406
   187
wenzelm@19406
   188
(* const names *)
wenzelm@398
   189
wenzelm@18938
   190
val classN = "_class";
wenzelm@18938
   191
wenzelm@18938
   192
val const_of_class = suffix classN;
wenzelm@19406
   193
wenzelm@18938
   194
fun class_of_const c = unsuffix classN c
wenzelm@18938
   195
  handle Fail _ => raise TERM ("class_of_const: bad name " ^ quote c, []);
wenzelm@18938
   196
wenzelm@19406
   197
wenzelm@19406
   198
(* class constraints *)
wenzelm@19406
   199
wenzelm@398
   200
fun mk_inclass (ty, c) =
wenzelm@19391
   201
  Const (const_of_class c, Term.itselfT ty --> propT) $ mk_type ty;
wenzelm@398
   202
wenzelm@19406
   203
fun dest_inclass (t as Const (c_class, _) $ ty) = (dest_type ty, class_of_const c_class)
wenzelm@398
   204
  | dest_inclass t = raise TERM ("dest_inclass", [t]);
wenzelm@398
   205
clasohm@0
   206
wenzelm@19406
   207
(* class relations *)
wenzelm@19406
   208
wenzelm@19406
   209
fun mk_classrel (c1, c2) = mk_inclass (Term.aT [c1], c2);
wenzelm@19406
   210
wenzelm@19406
   211
fun dest_classrel tm =
wenzelm@19406
   212
  (case dest_inclass tm of
wenzelm@19406
   213
    (TVar (_, [c1]), c2) => (c1, c2)
wenzelm@19406
   214
  | _ => raise TERM ("dest_classrel", [tm]));
wenzelm@19406
   215
wenzelm@19406
   216
wenzelm@19406
   217
(* type arities *)
wenzelm@19406
   218
wenzelm@19406
   219
fun mk_arities (t, Ss, S) =
wenzelm@19406
   220
  let val T = Type (t, ListPair.map TFree (Term.invent_names [] "'a" (length Ss), Ss))
wenzelm@19406
   221
  in map (fn c => mk_inclass (T, c)) S end;
wenzelm@19406
   222
wenzelm@19406
   223
fun dest_arity tm =
wenzelm@19406
   224
  let
wenzelm@19406
   225
    fun err () = raise TERM ("dest_arity", [tm]);
wenzelm@19406
   226
wenzelm@19406
   227
    val (ty, c) = dest_inclass tm;
wenzelm@19406
   228
    val (t, tvars) =
wenzelm@19406
   229
      (case ty of
wenzelm@19406
   230
        Type (t, tys) => (t, map dest_TVar tys handle TYPE _ => err ())
wenzelm@19406
   231
      | _ => err ());
wenzelm@19406
   232
    val Ss =
wenzelm@19406
   233
      if has_duplicates (eq_fst (op =)) tvars then err ()
wenzelm@19406
   234
      else map snd tvars;
wenzelm@19406
   235
  in (t, Ss, c) end;
wenzelm@19406
   236
wenzelm@19406
   237
wenzelm@18938
   238
wenzelm@18938
   239
(** definitions **)
wenzelm@18938
   240
wenzelm@19103
   241
fun term_kind (Const _) = "existing constant "
wenzelm@19103
   242
  | term_kind (Free _) = "free variable "
wenzelm@19103
   243
  | term_kind (Bound _) = "bound variable "
wenzelm@19103
   244
  | term_kind _ = "";
wenzelm@19103
   245
wenzelm@18938
   246
(*c x == t[x] to !!x. c x == t[x]*)
wenzelm@18938
   247
fun dest_def pp check_head is_fixed is_fixedT eq =
wenzelm@18938
   248
  let
wenzelm@18938
   249
    fun err msg = raise TERM (msg, [eq]);
wenzelm@19071
   250
    val eq_vars = Term.strip_all_vars eq;
wenzelm@19071
   251
    val eq_body = Term.strip_all_body eq;
wenzelm@19071
   252
wenzelm@19071
   253
    val display_terms = commas_quote o map (Pretty.string_of_term pp o Syntax.bound_vars eq_vars);
wenzelm@18938
   254
    val display_types = commas_quote o map (Pretty.string_of_typ pp);
wenzelm@18938
   255
wenzelm@19071
   256
    val (raw_lhs, rhs) = dest_equals eq_body handle TERM _ => err "Not a meta-equality (==)";
wenzelm@19071
   257
    val lhs = Envir.beta_eta_contract raw_lhs;
wenzelm@19071
   258
    val (head, args) = Term.strip_comb lhs;
wenzelm@18938
   259
    val head_tfrees = Term.add_tfrees head [];
wenzelm@18938
   260
wenzelm@18938
   261
    fun check_arg (Bound _) = true
wenzelm@18938
   262
      | check_arg (Free (x, _)) = not (is_fixed x)
wenzelm@18938
   263
      | check_arg (Const ("TYPE", Type ("itself", [TFree _]))) = true
wenzelm@18938
   264
      | check_arg _ = false;
wenzelm@18938
   265
    fun close_arg (Bound _) t = t
wenzelm@18938
   266
      | close_arg x t = Term.all (Term.fastype_of x) $ lambda x t;
wenzelm@18938
   267
wenzelm@18938
   268
    val lhs_bads = filter_out check_arg args;
wenzelm@18964
   269
    val lhs_dups = duplicates (op aconv) args;
wenzelm@18938
   270
    val rhs_extras = Term.fold_aterms (fn v as Free (x, _) =>
wenzelm@18938
   271
      if is_fixed x orelse member (op aconv) args v then I
wenzelm@18938
   272
      else insert (op aconv) v | _ => I) rhs [];
wenzelm@18938
   273
    val rhs_extrasT = Term.fold_aterms (Term.fold_types (fn v as TFree (a, S) =>
wenzelm@18938
   274
      if is_fixedT a orelse member (op =) head_tfrees (a, S) then I
wenzelm@18938
   275
      else insert (op =) v | _ => I)) rhs [];
wenzelm@18938
   276
  in
wenzelm@18938
   277
    if not (check_head head) then
wenzelm@19103
   278
      err ("Bad head of lhs: " ^ term_kind head ^ display_terms [head])
wenzelm@18938
   279
    else if not (null lhs_bads) then
wenzelm@18938
   280
      err ("Bad arguments on lhs: " ^ display_terms lhs_bads)
wenzelm@18938
   281
    else if not (null lhs_dups) then
wenzelm@18938
   282
      err ("Duplicate arguments on lhs: " ^ display_terms lhs_dups)
wenzelm@18938
   283
    else if not (null rhs_extras) then
wenzelm@18938
   284
      err ("Extra variables on rhs: " ^ display_terms rhs_extras)
wenzelm@18938
   285
    else if not (null rhs_extrasT) then
wenzelm@18938
   286
      err ("Extra type variables on rhs: " ^ display_types rhs_extrasT)
wenzelm@18938
   287
    else if exists_subterm (fn t => t aconv head) rhs then
wenzelm@18938
   288
      err "Entity to be defined occurs on rhs"
wenzelm@19071
   289
    else ((lhs, rhs), fold_rev close_arg args (Term.list_all (eq_vars, (mk_equals (lhs, rhs)))))
wenzelm@18938
   290
  end;
wenzelm@18938
   291
wenzelm@18938
   292
(*!!x. c x == t[x] to c == %x. t[x]*)
wenzelm@18938
   293
fun abs_def eq =
wenzelm@18938
   294
  let
wenzelm@18938
   295
    val body = Term.strip_all_body eq;
wenzelm@18938
   296
    val vars = map Free (Term.rename_wrt_term body (Term.strip_all_vars eq));
wenzelm@18938
   297
    val (lhs, rhs) = dest_equals (Term.subst_bounds (vars, body));
wenzelm@18938
   298
    val (lhs', args) = Term.strip_comb lhs;
wenzelm@18938
   299
    val rhs' = Term.list_abs_free (map Term.dest_Free args, rhs);
wenzelm@18938
   300
  in (lhs', rhs') end;
wenzelm@18938
   301
wenzelm@18938
   302
fun mk_cond_defpair As (lhs, rhs) =
wenzelm@18938
   303
  (case Term.head_of lhs of
wenzelm@18938
   304
    Const (name, _) =>
wenzelm@18938
   305
      (NameSpace.base name ^ "_def", list_implies (As, mk_equals (lhs, rhs)))
wenzelm@18938
   306
  | _ => raise TERM ("Malformed definition: head of lhs not a constant", [lhs, rhs]));
wenzelm@18938
   307
wenzelm@18938
   308
fun mk_defpair lhs_rhs = mk_cond_defpair [] lhs_rhs;
wenzelm@18938
   309
wenzelm@18938
   310
wenzelm@19406
   311
wenzelm@18029
   312
(** protected propositions **)
wenzelm@9460
   313
wenzelm@18029
   314
val protectC = Const ("prop", propT --> propT);
wenzelm@18029
   315
fun protect t = protectC $ t;
wenzelm@9460
   316
wenzelm@18029
   317
fun unprotect (Const ("prop", _) $ t) = t
wenzelm@18029
   318
  | unprotect t = raise TERM ("unprotect", [t]);
wenzelm@9460
   319
wenzelm@9460
   320
wenzelm@18181
   321
clasohm@0
   322
(*** Low-level term operations ***)
clasohm@0
   323
clasohm@0
   324
(*Does t occur in u?  Or is alpha-convertible to u?
clasohm@0
   325
  The term t must contain no loose bound variables*)
wenzelm@16846
   326
fun occs (t, u) = exists_subterm (fn s => t aconv s) u;
clasohm@0
   327
clasohm@0
   328
(*Close up a formula over all free variables by quantification*)
clasohm@0
   329
fun close_form A =
wenzelm@4443
   330
  list_all_free (sort_wrt fst (map dest_Free (term_frees A)), A);
clasohm@0
   331
clasohm@0
   332
wenzelm@18938
   333
clasohm@0
   334
(*** Specialized operations for resolution... ***)
clasohm@0
   335
wenzelm@18938
   336
(*computes t(Bound(n+k-1),...,Bound(n))  *)
wenzelm@18938
   337
fun combound (t, n, k) =
wenzelm@18938
   338
    if  k>0  then  combound (t,n+1,k-1) $ (Bound n)  else  t;
wenzelm@18938
   339
wenzelm@18938
   340
(* ([xn,...,x1], t)   ======>   (x1,...,xn)t *)
wenzelm@18938
   341
fun rlist_abs ([], body) = body
wenzelm@18938
   342
  | rlist_abs ((a,T)::pairs, body) = rlist_abs(pairs, Abs(a, T, body));
wenzelm@18938
   343
wenzelm@18938
   344
wenzelm@16879
   345
local exception SAME in
wenzelm@16879
   346
wenzelm@16879
   347
fun incrT k =
wenzelm@16879
   348
  let
wenzelm@16879
   349
    fun incr (TVar ((a, i), S)) = TVar ((a, i + k), S)
wenzelm@16879
   350
      | incr (Type (a, Ts)) = Type (a, incrs Ts)
wenzelm@16879
   351
      | incr _ = raise SAME
wenzelm@16879
   352
    and incrs (T :: Ts) =
wenzelm@16879
   353
        (incr T :: (incrs Ts handle SAME => Ts)
wenzelm@16879
   354
          handle SAME => T :: incrs Ts)
wenzelm@16879
   355
      | incrs [] = raise SAME;
wenzelm@16879
   356
  in incr end;
wenzelm@16879
   357
clasohm@0
   358
(*For all variables in the term, increment indexnames and lift over the Us
clasohm@0
   359
    result is ?Gidx(B.(lev+n-1),...,B.lev) where lev is abstraction level *)
paulson@17120
   360
fun incr_indexes ([], 0) t = t
wenzelm@18029
   361
  | incr_indexes (Ts, k) t =
wenzelm@16879
   362
  let
wenzelm@18029
   363
    val n = length Ts;
wenzelm@16879
   364
    val incrT = if k = 0 then I else incrT k;
wenzelm@16879
   365
wenzelm@16879
   366
    fun incr lev (Var ((x, i), T)) =
wenzelm@18938
   367
          combound (Var ((x, i + k), Ts ---> (incrT T handle SAME => T)), lev, n)
wenzelm@16879
   368
      | incr lev (Abs (x, T, body)) =
wenzelm@16879
   369
          (Abs (x, incrT T, incr (lev + 1) body handle SAME => body)
wenzelm@16879
   370
            handle SAME => Abs (x, T, incr (lev + 1) body))
wenzelm@16879
   371
      | incr lev (t $ u) =
wenzelm@16879
   372
          (incr lev t $ (incr lev u handle SAME => u)
wenzelm@16879
   373
            handle SAME => t $ incr lev u)
wenzelm@16879
   374
      | incr _ (Const (c, T)) = Const (c, incrT T)
wenzelm@16879
   375
      | incr _ (Free (x, T)) = Free (x, incrT T)
wenzelm@16879
   376
      | incr _ (t as Bound _) = t;
wenzelm@16879
   377
  in incr 0 t handle SAME => t end;
wenzelm@16879
   378
wenzelm@16879
   379
fun incr_tvar 0 T = T
wenzelm@16879
   380
  | incr_tvar k T = incrT k T handle SAME => T;
wenzelm@16879
   381
wenzelm@16879
   382
end;
wenzelm@16879
   383
clasohm@0
   384
wenzelm@18248
   385
(* Lifting functions from subgoal and increment:
wenzelm@18029
   386
    lift_abs operates on terms
wenzelm@18029
   387
    lift_all operates on propositions *)
wenzelm@18029
   388
wenzelm@18029
   389
fun lift_abs inc =
wenzelm@18029
   390
  let
wenzelm@18029
   391
    fun lift Ts (Const ("==>", _) $ _ $ B) t = lift Ts B t
wenzelm@18248
   392
      | lift Ts (Const ("all", _) $ Abs (a, T, B)) t = Abs (a, T, lift (T :: Ts) B t)
wenzelm@18029
   393
      | lift Ts _ t = incr_indexes (rev Ts, inc) t;
wenzelm@18029
   394
  in lift [] end;
wenzelm@18029
   395
wenzelm@18029
   396
fun lift_all inc =
wenzelm@18029
   397
  let
wenzelm@18029
   398
    fun lift Ts ((c as Const ("==>", _)) $ A $ B) t = c $ A $ lift Ts B t
wenzelm@18248
   399
      | lift Ts ((c as Const ("all", _)) $ Abs (a, T, B)) t = c $ Abs (a, T, lift (T :: Ts) B t)
wenzelm@18029
   400
      | lift Ts _ t = incr_indexes (rev Ts, inc) t;
wenzelm@18029
   401
  in lift [] end;
clasohm@0
   402
clasohm@0
   403
(*Strips assumptions in goal, yielding list of hypotheses.   *)
clasohm@0
   404
fun strip_assums_hyp (Const("==>", _) $ H $ B) = H :: strip_assums_hyp B
clasohm@0
   405
  | strip_assums_hyp (Const("all",_)$Abs(a,T,t)) = strip_assums_hyp t
clasohm@0
   406
  | strip_assums_hyp B = [];
clasohm@0
   407
clasohm@0
   408
(*Strips assumptions in goal, yielding conclusion.   *)
clasohm@0
   409
fun strip_assums_concl (Const("==>", _) $ H $ B) = strip_assums_concl B
clasohm@0
   410
  | strip_assums_concl (Const("all",_)$Abs(a,T,t)) = strip_assums_concl t
clasohm@0
   411
  | strip_assums_concl B = B;
clasohm@0
   412
clasohm@0
   413
(*Make a list of all the parameters in a subgoal, even if nested*)
clasohm@0
   414
fun strip_params (Const("==>", _) $ H $ B) = strip_params B
clasohm@0
   415
  | strip_params (Const("all",_)$Abs(a,T,t)) = (a,T) :: strip_params t
clasohm@0
   416
  | strip_params B = [];
clasohm@0
   417
wenzelm@9667
   418
(*test for meta connectives in prems of a 'subgoal'*)
wenzelm@9667
   419
fun has_meta_prems prop i =
wenzelm@9667
   420
  let
wenzelm@9667
   421
    fun is_meta (Const ("==>", _) $ _ $ _) = true
wenzelm@10442
   422
      | is_meta (Const ("==", _) $ _ $ _) = true
wenzelm@9667
   423
      | is_meta (Const ("all", _) $ _) = true
wenzelm@9667
   424
      | is_meta _ = false;
wenzelm@9667
   425
  in
berghofe@13659
   426
    (case strip_prems (i, [], prop) of
wenzelm@9667
   427
      (B :: _, _) => exists is_meta (strip_assums_hyp B)
wenzelm@9667
   428
    | _ => false) handle TERM _ => false
wenzelm@9667
   429
  end;
wenzelm@9483
   430
clasohm@0
   431
(*Removes the parameters from a subgoal and renumber bvars in hypotheses,
wenzelm@9460
   432
    where j is the total number of parameters (precomputed)
clasohm@0
   433
  If n>0 then deletes assumption n. *)
wenzelm@9460
   434
fun remove_params j n A =
clasohm@0
   435
    if j=0 andalso n<=0 then A  (*nothing left to do...*)
clasohm@0
   436
    else case A of
wenzelm@9460
   437
        Const("==>", _) $ H $ B =>
wenzelm@9460
   438
          if n=1 then                           (remove_params j (n-1) B)
wenzelm@9460
   439
          else implies $ (incr_boundvars j H) $ (remove_params j (n-1) B)
clasohm@0
   440
      | Const("all",_)$Abs(a,T,t) => remove_params (j-1) n t
clasohm@0
   441
      | _ => if n>0 then raise TERM("remove_params", [A])
clasohm@0
   442
             else A;
clasohm@0
   443
clasohm@0
   444
(** Auto-renaming of parameters in subgoals **)
clasohm@0
   445
clasohm@0
   446
val auto_rename = ref false
clasohm@0
   447
and rename_prefix = ref "ka";
clasohm@0
   448
clasohm@0
   449
(*rename_prefix is not exported; it is set by this function.*)
clasohm@0
   450
fun set_rename_prefix a =
wenzelm@4693
   451
    if a<>"" andalso forall Symbol.is_letter (Symbol.explode a)
clasohm@0
   452
    then  (rename_prefix := a;  auto_rename := true)
clasohm@0
   453
    else  error"rename prefix must be nonempty and consist of letters";
clasohm@0
   454
clasohm@0
   455
(*Makes parameters in a goal have distinctive names (not guaranteed unique!)
clasohm@0
   456
  A name clash could cause the printer to rename bound vars;
clasohm@0
   457
    then res_inst_tac would not work properly.*)
clasohm@0
   458
fun rename_vars (a, []) = []
clasohm@0
   459
  | rename_vars (a, (_,T)::vars) =
wenzelm@12902
   460
        (a,T) :: rename_vars (Symbol.bump_string a, vars);
clasohm@0
   461
clasohm@0
   462
(*Move all parameters to the front of the subgoal, renaming them apart;
clasohm@0
   463
  if n>0 then deletes assumption n. *)
clasohm@0
   464
fun flatten_params n A =
clasohm@0
   465
    let val params = strip_params A;
wenzelm@9460
   466
        val vars = if !auto_rename
wenzelm@9460
   467
                   then rename_vars (!rename_prefix, params)
wenzelm@9460
   468
                   else ListPair.zip (variantlist(map #1 params,[]),
wenzelm@9460
   469
                                      map #2 params)
clasohm@0
   470
    in  list_all (vars, remove_params (length vars) n A)
clasohm@0
   471
    end;
clasohm@0
   472
clasohm@0
   473
(*Makes parameters in a goal have the names supplied by the list cs.*)
clasohm@0
   474
fun list_rename_params (cs, Const("==>", _) $ A $ B) =
clasohm@0
   475
      implies $ A $ list_rename_params (cs, B)
wenzelm@9460
   476
  | list_rename_params (c::cs, Const("all",_)$Abs(_,T,t)) =
clasohm@0
   477
      all T $ Abs(c, T, list_rename_params (cs, t))
clasohm@0
   478
  | list_rename_params (cs, B) = B;
clasohm@0
   479
paulson@15451
   480
(*** Treatmsent of "assume", "erule", etc. ***)
clasohm@0
   481
wenzelm@16879
   482
(*Strips assumptions in goal yielding
paulson@15451
   483
   HS = [Hn,...,H1],   params = [xm,...,x1], and B,
wenzelm@16879
   484
  where x1...xm are the parameters. This version (21.1.2005) REQUIRES
wenzelm@16879
   485
  the the parameters to be flattened, but it allows erule to work on
paulson@15451
   486
  assumptions of the form !!x. phi. Any !! after the outermost string
paulson@15451
   487
  will be regarded as belonging to the conclusion, and left untouched.
paulson@15454
   488
  Used ONLY by assum_pairs.
paulson@15454
   489
      Unless nasms<0, it can terminate the recursion early; that allows
paulson@15454
   490
  erule to work on assumptions of the form P==>Q.*)
paulson@15454
   491
fun strip_assums_imp (0, Hs, B) = (Hs, B)  (*recursion terminated by nasms*)
wenzelm@16879
   492
  | strip_assums_imp (nasms, Hs, Const("==>", _) $ H $ B) =
paulson@15454
   493
      strip_assums_imp (nasms-1, H::Hs, B)
paulson@15454
   494
  | strip_assums_imp (_, Hs, B) = (Hs, B); (*recursion terminated by B*)
paulson@15454
   495
clasohm@0
   496
paulson@15451
   497
(*Strips OUTER parameters only, unlike similar legacy versions.*)
paulson@15451
   498
fun strip_assums_all (params, Const("all",_)$Abs(a,T,t)) =
paulson@15451
   499
      strip_assums_all ((a,T)::params, t)
paulson@15451
   500
  | strip_assums_all (params, B) = (params, B);
clasohm@0
   501
clasohm@0
   502
(*Produces disagreement pairs, one for each assumption proof, in order.
clasohm@0
   503
  A is the first premise of the lifted rule, and thus has the form
paulson@15454
   504
    H1 ==> ... Hk ==> B   and the pairs are (H1,B),...,(Hk,B).
paulson@15454
   505
  nasms is the number of assumptions in the original subgoal, needed when B
paulson@15454
   506
    has the form B1 ==> B2: it stops B1 from being taken as an assumption. *)
paulson@15454
   507
fun assum_pairs(nasms,A) =
paulson@15451
   508
  let val (params, A') = strip_assums_all ([],A)
paulson@15454
   509
      val (Hs,B) = strip_assums_imp (nasms,[],A')
wenzelm@18938
   510
      fun abspar t = rlist_abs(params, t)
paulson@15451
   511
      val D = abspar B
paulson@15451
   512
      fun pairrev ([], pairs) = pairs
paulson@15451
   513
        | pairrev (H::Hs, pairs) = pairrev(Hs,  (abspar H, D) :: pairs)
paulson@15451
   514
  in  pairrev (Hs,[])
clasohm@0
   515
  end;
clasohm@0
   516
wenzelm@18938
   517
(*Converts Frees to Vars and TFrees to TVars*)
wenzelm@16862
   518
fun varify (Const(a, T)) = Const (a, Type.varifyT T)
wenzelm@16862
   519
  | varify (Free (a, T)) = Var ((a, 0), Type.varifyT T)
wenzelm@16862
   520
  | varify (Var (ixn, T)) = Var (ixn, Type.varifyT T)
wenzelm@16862
   521
  | varify (t as Bound _) = t
wenzelm@16862
   522
  | varify (Abs (a, T, body)) = Abs (a, Type.varifyT T, varify body)
wenzelm@16862
   523
  | varify (f $ t) = varify f $ varify t;
clasohm@0
   524
wenzelm@18938
   525
(*Inverse of varify.*)
wenzelm@16862
   526
fun unvarify (Const (a, T)) = Const (a, Type.unvarifyT T)
wenzelm@16862
   527
  | unvarify (Free (a, T)) = Free (a, Type.unvarifyT T)
wenzelm@16862
   528
  | unvarify (Var ((a, 0), T)) = Free (a, Type.unvarifyT T)
wenzelm@16862
   529
  | unvarify (Var (ixn, T)) = Var (ixn, Type.unvarifyT T)  (*non-0 index!*)
wenzelm@16862
   530
  | unvarify (t as Bound _) = t
wenzelm@16862
   531
  | unvarify (Abs (a, T, body)) = Abs (a, Type.unvarifyT T, unvarify body)
wenzelm@16862
   532
  | unvarify (f $ t) = unvarify f $ unvarify t;
lcp@546
   533
berghofe@13799
   534
wenzelm@16862
   535
(* goal states *)
wenzelm@16862
   536
wenzelm@16862
   537
fun get_goal st i = nth_prem (i, st)
wenzelm@16862
   538
  handle TERM _ => error "Goal number out of range";
berghofe@13799
   539
berghofe@13799
   540
(*reverses parameters for substitution*)
berghofe@13799
   541
fun goal_params st i =
berghofe@13799
   542
  let val gi = get_goal st i
berghofe@14137
   543
      val rfrees = map Free (rename_wrt_term gi (strip_params gi))
berghofe@13799
   544
  in (gi, rfrees) end;
berghofe@13799
   545
berghofe@13799
   546
fun concl_of_goal st i =
berghofe@13799
   547
  let val (gi, rfrees) = goal_params st i
berghofe@13799
   548
      val B = strip_assums_concl gi
berghofe@13799
   549
  in subst_bounds (rfrees, B) end;
berghofe@13799
   550
berghofe@13799
   551
fun prems_of_goal st i =
berghofe@13799
   552
  let val (gi, rfrees) = goal_params st i
berghofe@13799
   553
      val As = strip_assums_hyp gi
berghofe@13799
   554
  in map (fn A => subst_bounds (rfrees, A)) As end;
berghofe@13799
   555
clasohm@0
   556
end;