src/Pure/logic.ML
author paulson
Fri Jan 21 13:55:07 2005 +0100 (2005-01-21)
changeset 15451 c6c8786b9921
parent 14137 c57ec95e7763
child 15454 4b339d3907a0
permissions -rw-r--r--
fixed thin_tac with higher-level assumptions by removing the old code to
handle the iterated introduction of parameters
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
clasohm@0
     9
infix occs;
clasohm@0
    10
wenzelm@9460
    11
signature LOGIC =
wenzelm@4345
    12
sig
nipkow@5041
    13
  val is_all            : term -> bool
wenzelm@9460
    14
  val mk_equals         : term * term -> term
wenzelm@9460
    15
  val dest_equals       : term -> term * term
nipkow@3963
    16
  val is_equals         : term -> bool
wenzelm@9460
    17
  val mk_implies        : term * term -> term
wenzelm@9460
    18
  val dest_implies      : term -> term * term
nipkow@5041
    19
  val is_implies        : term -> bool
wenzelm@9460
    20
  val list_implies      : term list * term -> term
wenzelm@9460
    21
  val strip_imp_prems   : term -> term list
wenzelm@9460
    22
  val strip_imp_concl   : term -> term
wenzelm@9460
    23
  val strip_prems       : int * term list * term -> term list * term
wenzelm@9460
    24
  val count_prems       : term * int -> int
wenzelm@12137
    25
  val mk_conjunction    : term * term -> term
wenzelm@12757
    26
  val mk_conjunction_list: term list -> term
berghofe@13659
    27
  val strip_horn        : term -> term list * term
wenzelm@9460
    28
  val mk_cond_defpair   : term list -> term * term -> string * term
wenzelm@9460
    29
  val mk_defpair        : term * term -> string * term
wenzelm@9460
    30
  val mk_type           : typ -> term
wenzelm@9460
    31
  val dest_type         : term -> typ
wenzelm@9460
    32
  val mk_inclass        : typ * class -> term
wenzelm@9460
    33
  val dest_inclass      : term -> typ * class
wenzelm@9460
    34
  val goal_const        : term
wenzelm@9460
    35
  val mk_goal           : term -> term
wenzelm@9460
    36
  val dest_goal         : term -> term
wenzelm@9460
    37
  val occs              : term * term -> bool
wenzelm@9460
    38
  val close_form        : term -> term
wenzelm@9460
    39
  val incr_indexes      : typ list * int -> term -> term
wenzelm@9460
    40
  val lift_fns          : term * int -> (term -> term) * (term -> term)
wenzelm@9460
    41
  val strip_assums_hyp  : term -> term list
wenzelm@9460
    42
  val strip_assums_concl: term -> term
wenzelm@9460
    43
  val strip_params      : term -> (string * typ) list
wenzelm@9667
    44
  val has_meta_prems    : term -> int -> bool
wenzelm@9460
    45
  val flatten_params    : int -> term -> term
wenzelm@9460
    46
  val auto_rename       : bool ref
wenzelm@9460
    47
  val set_rename_prefix : string -> unit
clasohm@0
    48
  val list_rename_params: string list * term -> term
wenzelm@9460
    49
  val assum_pairs       : term -> (term*term)list
wenzelm@9460
    50
  val varify            : term -> term
wenzelm@9460
    51
  val unvarify          : term -> term
berghofe@13799
    52
  val get_goal          : term -> int -> term
berghofe@14107
    53
  val goal_params       : term -> int -> term * term list
berghofe@13799
    54
  val prems_of_goal     : term -> int -> term list
berghofe@13799
    55
  val concl_of_goal     : term -> int -> term
wenzelm@4345
    56
end;
clasohm@0
    57
paulson@1500
    58
structure Logic : LOGIC =
clasohm@0
    59
struct
wenzelm@398
    60
wenzelm@4345
    61
clasohm@0
    62
(*** Abstract syntax operations on the meta-connectives ***)
clasohm@0
    63
nipkow@5041
    64
(** all **)
nipkow@5041
    65
nipkow@5041
    66
fun is_all (Const ("all", _) $ _) = true
nipkow@5041
    67
  | is_all _ = false;
nipkow@5041
    68
nipkow@5041
    69
clasohm@0
    70
(** equality **)
clasohm@0
    71
paulson@1835
    72
(*Make an equality.  DOES NOT CHECK TYPE OF u*)
lcp@64
    73
fun mk_equals(t,u) = equals(fastype_of t) $ t $ u;
clasohm@0
    74
clasohm@0
    75
fun dest_equals (Const("==",_) $ t $ u)  =  (t,u)
clasohm@0
    76
  | dest_equals t = raise TERM("dest_equals", [t]);
clasohm@0
    77
wenzelm@637
    78
fun is_equals (Const ("==", _) $ _ $ _) = true
wenzelm@637
    79
  | is_equals _ = false;
wenzelm@637
    80
wenzelm@637
    81
clasohm@0
    82
(** implies **)
clasohm@0
    83
clasohm@0
    84
fun mk_implies(A,B) = implies $ A $ B;
clasohm@0
    85
clasohm@0
    86
fun dest_implies (Const("==>",_) $ A $ B)  =  (A,B)
clasohm@0
    87
  | dest_implies A = raise TERM("dest_implies", [A]);
clasohm@0
    88
nipkow@5041
    89
fun is_implies (Const ("==>", _) $ _ $ _) = true
nipkow@5041
    90
  | is_implies _ = false;
nipkow@5041
    91
wenzelm@4822
    92
clasohm@0
    93
(** nested implications **)
clasohm@0
    94
clasohm@0
    95
(* [A1,...,An], B  goes to  A1==>...An==>B  *)
clasohm@0
    96
fun list_implies ([], B) = B : term
clasohm@0
    97
  | list_implies (A::AS, B) = implies $ A $ list_implies(AS,B);
clasohm@0
    98
clasohm@0
    99
(* A1==>...An==>B  goes to  [A1,...,An], where B is not an implication *)
clasohm@0
   100
fun strip_imp_prems (Const("==>", _) $ A $ B) = A :: strip_imp_prems B
clasohm@0
   101
  | strip_imp_prems _ = [];
clasohm@0
   102
clasohm@0
   103
(* A1==>...An==>B  goes to B, where B is not an implication *)
clasohm@0
   104
fun strip_imp_concl (Const("==>", _) $ A $ B) = strip_imp_concl B
clasohm@0
   105
  | strip_imp_concl A = A : term;
clasohm@0
   106
clasohm@0
   107
(*Strip and return premises: (i, [], A1==>...Ai==>B)
wenzelm@9460
   108
    goes to   ([Ai, A(i-1),...,A1] , B)         (REVERSED)
clasohm@0
   109
  if  i<0 or else i too big then raises  TERM*)
wenzelm@9460
   110
fun strip_prems (0, As, B) = (As, B)
wenzelm@9460
   111
  | strip_prems (i, As, Const("==>", _) $ A $ B) =
wenzelm@9460
   112
        strip_prems (i-1, A::As, B)
clasohm@0
   113
  | strip_prems (_, As, A) = raise TERM("strip_prems", A::As);
clasohm@0
   114
clasohm@0
   115
(*Count premises -- quicker than (length ostrip_prems) *)
clasohm@0
   116
fun count_prems (Const("==>", _) $ A $ B, n) = count_prems (B,n+1)
clasohm@0
   117
  | count_prems (_,n) = n;
clasohm@0
   118
berghofe@13659
   119
(*strip a proof state (Horn clause):
berghofe@13659
   120
  B1 ==> ... Bn ==> C   goes to   ([B1, ..., Bn], C)    *)
berghofe@13659
   121
fun strip_horn A = (strip_imp_prems A, strip_imp_concl A);
berghofe@13659
   122
wenzelm@4822
   123
wenzelm@12137
   124
(** conjunction **)
wenzelm@12137
   125
wenzelm@12137
   126
fun mk_conjunction (t, u) =
wenzelm@12137
   127
  Term.list_all ([("C", propT)], mk_implies (list_implies ([t, u], Bound 0), Bound 0));
wenzelm@12137
   128
wenzelm@12757
   129
fun mk_conjunction_list [] = Term.all propT $ Abs ("dummy", propT, mk_implies (Bound 0, Bound 0))
wenzelm@12757
   130
  | mk_conjunction_list ts = foldr1 mk_conjunction ts;
wenzelm@12137
   131
wenzelm@12137
   132
wenzelm@4822
   133
(** definitions **)
wenzelm@4822
   134
wenzelm@4822
   135
fun mk_cond_defpair As (lhs, rhs) =
wenzelm@4822
   136
  (case Term.head_of lhs of
wenzelm@4822
   137
    Const (name, _) =>
wenzelm@4822
   138
      (Sign.base_name name ^ "_def", list_implies (As, mk_equals (lhs, rhs)))
wenzelm@4822
   139
  | _ => raise TERM ("Malformed definition: head of lhs not a constant", [lhs, rhs]));
wenzelm@4822
   140
wenzelm@4822
   141
fun mk_defpair lhs_rhs = mk_cond_defpair [] lhs_rhs;
wenzelm@4822
   142
wenzelm@4822
   143
wenzelm@398
   144
(** types as terms **)
wenzelm@398
   145
wenzelm@398
   146
fun mk_type ty = Const ("TYPE", itselfT ty);
wenzelm@398
   147
wenzelm@398
   148
fun dest_type (Const ("TYPE", Type ("itself", [ty]))) = ty
wenzelm@398
   149
  | dest_type t = raise TERM ("dest_type", [t]);
wenzelm@398
   150
wenzelm@4822
   151
wenzelm@447
   152
(** class constraints **)
wenzelm@398
   153
wenzelm@398
   154
fun mk_inclass (ty, c) =
wenzelm@398
   155
  Const (Sign.const_of_class c, itselfT ty --> propT) $ mk_type ty;
wenzelm@398
   156
wenzelm@398
   157
fun dest_inclass (t as Const (c_class, _) $ ty) =
wenzelm@398
   158
      ((dest_type ty, Sign.class_of_const c_class)
wenzelm@398
   159
        handle TERM _ => raise TERM ("dest_inclass", [t]))
wenzelm@398
   160
  | dest_inclass t = raise TERM ("dest_inclass", [t]);
wenzelm@398
   161
clasohm@0
   162
wenzelm@9460
   163
(** atomic goals **)
wenzelm@9460
   164
wenzelm@9460
   165
val goal_const = Const ("Goal", propT --> propT);
wenzelm@9460
   166
fun mk_goal t = goal_const $ t;
wenzelm@9460
   167
wenzelm@9460
   168
fun dest_goal (Const ("Goal", _) $ t) = t
wenzelm@9460
   169
  | dest_goal t = raise TERM ("dest_goal", [t]);
wenzelm@9460
   170
wenzelm@9460
   171
clasohm@0
   172
(*** Low-level term operations ***)
clasohm@0
   173
clasohm@0
   174
(*Does t occur in u?  Or is alpha-convertible to u?
clasohm@0
   175
  The term t must contain no loose bound variables*)
nipkow@4631
   176
fun t occs u = exists_subterm (fn s => t aconv s) u;
clasohm@0
   177
clasohm@0
   178
(*Close up a formula over all free variables by quantification*)
clasohm@0
   179
fun close_form A =
wenzelm@4443
   180
  list_all_free (sort_wrt fst (map dest_Free (term_frees A)), A);
clasohm@0
   181
clasohm@0
   182
clasohm@0
   183
(*** Specialized operations for resolution... ***)
clasohm@0
   184
clasohm@0
   185
(*For all variables in the term, increment indexnames and lift over the Us
clasohm@0
   186
    result is ?Gidx(B.(lev+n-1),...,B.lev) where lev is abstraction level *)
wenzelm@9460
   187
fun incr_indexes (Us: typ list, inc:int) t =
wenzelm@9460
   188
  let fun incr (Var ((a,i), T), lev) =
wenzelm@9460
   189
                Unify.combound (Var((a, i+inc), Us---> incr_tvar inc T),
wenzelm@9460
   190
                                lev, length Us)
wenzelm@9460
   191
        | incr (Abs (a,T,body), lev) =
wenzelm@9460
   192
                Abs (a, incr_tvar inc T, incr(body,lev+1))
wenzelm@9460
   193
        | incr (Const(a,T),_) = Const(a, incr_tvar inc T)
wenzelm@9460
   194
        | incr (Free(a,T),_) = Free(a, incr_tvar inc T)
wenzelm@9460
   195
        | incr (f$t, lev) = incr(f,lev) $ incr(t,lev)
wenzelm@9460
   196
        | incr (t,lev) = t
clasohm@0
   197
  in  incr(t,0)  end;
clasohm@0
   198
clasohm@0
   199
(*Make lifting functions from subgoal and increment.
clasohm@0
   200
    lift_abs operates on tpairs (unification constraints)
clasohm@0
   201
    lift_all operates on propositions     *)
clasohm@0
   202
fun lift_fns (B,inc) =
clasohm@0
   203
  let fun lift_abs (Us, Const("==>", _) $ _ $ B) u = lift_abs (Us,B) u
wenzelm@9460
   204
        | lift_abs (Us, Const("all",_)$Abs(a,T,t)) u =
wenzelm@9460
   205
              Abs(a, T, lift_abs (T::Us, t) u)
wenzelm@9460
   206
        | lift_abs (Us, _) u = incr_indexes(rev Us, inc) u
clasohm@0
   207
      fun lift_all (Us, Const("==>", _) $ A $ B) u =
wenzelm@9460
   208
              implies $ A $ lift_all (Us,B) u
wenzelm@9460
   209
        | lift_all (Us, Const("all",_)$Abs(a,T,t)) u =
wenzelm@9460
   210
              all T $ Abs(a, T, lift_all (T::Us,t) u)
wenzelm@9460
   211
        | lift_all (Us, _) u = incr_indexes(rev Us, inc) u;
clasohm@0
   212
  in  (lift_abs([],B), lift_all([],B))  end;
clasohm@0
   213
clasohm@0
   214
(*Strips assumptions in goal, yielding list of hypotheses.   *)
clasohm@0
   215
fun strip_assums_hyp (Const("==>", _) $ H $ B) = H :: strip_assums_hyp B
clasohm@0
   216
  | strip_assums_hyp (Const("all",_)$Abs(a,T,t)) = strip_assums_hyp t
clasohm@0
   217
  | strip_assums_hyp B = [];
clasohm@0
   218
clasohm@0
   219
(*Strips assumptions in goal, yielding conclusion.   *)
clasohm@0
   220
fun strip_assums_concl (Const("==>", _) $ H $ B) = strip_assums_concl B
clasohm@0
   221
  | strip_assums_concl (Const("all",_)$Abs(a,T,t)) = strip_assums_concl t
clasohm@0
   222
  | strip_assums_concl B = B;
clasohm@0
   223
clasohm@0
   224
(*Make a list of all the parameters in a subgoal, even if nested*)
clasohm@0
   225
fun strip_params (Const("==>", _) $ H $ B) = strip_params B
clasohm@0
   226
  | strip_params (Const("all",_)$Abs(a,T,t)) = (a,T) :: strip_params t
clasohm@0
   227
  | strip_params B = [];
clasohm@0
   228
wenzelm@9667
   229
(*test for meta connectives in prems of a 'subgoal'*)
wenzelm@9667
   230
fun has_meta_prems prop i =
wenzelm@9667
   231
  let
wenzelm@9667
   232
    fun is_meta (Const ("==>", _) $ _ $ _) = true
wenzelm@10442
   233
      | is_meta (Const ("==", _) $ _ $ _) = true
wenzelm@9667
   234
      | is_meta (Const ("all", _) $ _) = true
wenzelm@9667
   235
      | is_meta _ = false;
wenzelm@9667
   236
  in
berghofe@13659
   237
    (case strip_prems (i, [], prop) of
wenzelm@9667
   238
      (B :: _, _) => exists is_meta (strip_assums_hyp B)
wenzelm@9667
   239
    | _ => false) handle TERM _ => false
wenzelm@9667
   240
  end;
wenzelm@9483
   241
clasohm@0
   242
(*Removes the parameters from a subgoal and renumber bvars in hypotheses,
wenzelm@9460
   243
    where j is the total number of parameters (precomputed)
clasohm@0
   244
  If n>0 then deletes assumption n. *)
wenzelm@9460
   245
fun remove_params j n A =
clasohm@0
   246
    if j=0 andalso n<=0 then A  (*nothing left to do...*)
clasohm@0
   247
    else case A of
wenzelm@9460
   248
        Const("==>", _) $ H $ B =>
wenzelm@9460
   249
          if n=1 then                           (remove_params j (n-1) B)
wenzelm@9460
   250
          else implies $ (incr_boundvars j H) $ (remove_params j (n-1) B)
clasohm@0
   251
      | Const("all",_)$Abs(a,T,t) => remove_params (j-1) n t
clasohm@0
   252
      | _ => if n>0 then raise TERM("remove_params", [A])
clasohm@0
   253
             else A;
clasohm@0
   254
clasohm@0
   255
(** Auto-renaming of parameters in subgoals **)
clasohm@0
   256
clasohm@0
   257
val auto_rename = ref false
clasohm@0
   258
and rename_prefix = ref "ka";
clasohm@0
   259
clasohm@0
   260
(*rename_prefix is not exported; it is set by this function.*)
clasohm@0
   261
fun set_rename_prefix a =
wenzelm@4693
   262
    if a<>"" andalso forall Symbol.is_letter (Symbol.explode a)
clasohm@0
   263
    then  (rename_prefix := a;  auto_rename := true)
clasohm@0
   264
    else  error"rename prefix must be nonempty and consist of letters";
clasohm@0
   265
clasohm@0
   266
(*Makes parameters in a goal have distinctive names (not guaranteed unique!)
clasohm@0
   267
  A name clash could cause the printer to rename bound vars;
clasohm@0
   268
    then res_inst_tac would not work properly.*)
clasohm@0
   269
fun rename_vars (a, []) = []
clasohm@0
   270
  | rename_vars (a, (_,T)::vars) =
wenzelm@12902
   271
        (a,T) :: rename_vars (Symbol.bump_string a, vars);
clasohm@0
   272
clasohm@0
   273
(*Move all parameters to the front of the subgoal, renaming them apart;
clasohm@0
   274
  if n>0 then deletes assumption n. *)
clasohm@0
   275
fun flatten_params n A =
clasohm@0
   276
    let val params = strip_params A;
wenzelm@9460
   277
        val vars = if !auto_rename
wenzelm@9460
   278
                   then rename_vars (!rename_prefix, params)
wenzelm@9460
   279
                   else ListPair.zip (variantlist(map #1 params,[]),
wenzelm@9460
   280
                                      map #2 params)
clasohm@0
   281
    in  list_all (vars, remove_params (length vars) n A)
clasohm@0
   282
    end;
clasohm@0
   283
clasohm@0
   284
(*Makes parameters in a goal have the names supplied by the list cs.*)
clasohm@0
   285
fun list_rename_params (cs, Const("==>", _) $ A $ B) =
clasohm@0
   286
      implies $ A $ list_rename_params (cs, B)
wenzelm@9460
   287
  | list_rename_params (c::cs, Const("all",_)$Abs(_,T,t)) =
clasohm@0
   288
      all T $ Abs(c, T, list_rename_params (cs, t))
clasohm@0
   289
  | list_rename_params (cs, B) = B;
clasohm@0
   290
paulson@15451
   291
(*** Treatmsent of "assume", "erule", etc. ***)
clasohm@0
   292
paulson@15451
   293
(*Strips assumptions in goal yielding  
paulson@15451
   294
   HS = [Hn,...,H1],   params = [xm,...,x1], and B,
paulson@15451
   295
  where x1...xm are the parameters. This version (21.1.2005) REQUIRES 
paulson@15451
   296
  the the parameters to be flattened, but it allows erule to work on 
paulson@15451
   297
  assumptions of the form !!x. phi. Any !! after the outermost string
paulson@15451
   298
  will be regarded as belonging to the conclusion, and left untouched.
paulson@15451
   299
  Used ONLY by assum_pairs. *)
paulson@15451
   300
fun strip_assums_imp (Hs, Const("==>", _) $ H $ B) = strip_assums_imp (H::Hs, B)
paulson@15451
   301
  | strip_assums_imp (Hs, B) = (Hs, B);
clasohm@0
   302
paulson@15451
   303
(*Strips OUTER parameters only, unlike similar legacy versions.*)
paulson@15451
   304
fun strip_assums_all (params, Const("all",_)$Abs(a,T,t)) =
paulson@15451
   305
      strip_assums_all ((a,T)::params, t)
paulson@15451
   306
  | strip_assums_all (params, B) = (params, B);
clasohm@0
   307
clasohm@0
   308
(*Produces disagreement pairs, one for each assumption proof, in order.
clasohm@0
   309
  A is the first premise of the lifted rule, and thus has the form
clasohm@0
   310
    H1 ==> ... Hk ==> B   and the pairs are (H1,B),...,(Hk,B) *)
clasohm@0
   311
fun assum_pairs A =
paulson@15451
   312
  let val (params, A') = strip_assums_all ([],A)
paulson@15451
   313
      val (Hs,B) = strip_assums_imp ([],A')
paulson@15451
   314
      fun abspar t = Unify.rlist_abs(params, t)
paulson@15451
   315
      val D = abspar B
paulson@15451
   316
      fun pairrev ([], pairs) = pairs
paulson@15451
   317
        | pairrev (H::Hs, pairs) = pairrev(Hs,  (abspar H, D) :: pairs)
paulson@15451
   318
  in  pairrev (Hs,[])
clasohm@0
   319
  end;
clasohm@0
   320
clasohm@0
   321
(*Converts Frees to Vars and TFrees to TVars so that axioms can be written
clasohm@0
   322
  without (?) everywhere*)
clasohm@0
   323
fun varify (Const(a,T)) = Const(a, Type.varifyT T)
clasohm@0
   324
  | varify (Free(a,T)) = Var((a,0), Type.varifyT T)
clasohm@0
   325
  | varify (Var(ixn,T)) = Var(ixn, Type.varifyT T)
clasohm@0
   326
  | varify (Abs (a,T,body)) = Abs (a, Type.varifyT T, varify body)
clasohm@0
   327
  | varify (f$t) = varify f $ varify t
clasohm@0
   328
  | varify t = t;
clasohm@0
   329
lcp@546
   330
(*Inverse of varify.  Converts axioms back to their original form.*)
lcp@585
   331
fun unvarify (Const(a,T))    = Const(a, Type.unvarifyT T)
lcp@585
   332
  | unvarify (Var((a,0), T)) = Free(a, Type.unvarifyT T)
lcp@585
   333
  | unvarify (Var(ixn,T))    = Var(ixn, Type.unvarifyT T)  (*non-0 index!*)
lcp@585
   334
  | unvarify (Abs (a,T,body)) = Abs (a, Type.unvarifyT T, unvarify body)
lcp@546
   335
  | unvarify (f$t) = unvarify f $ unvarify t
lcp@546
   336
  | unvarify t = t;
lcp@546
   337
berghofe@13799
   338
berghofe@13799
   339
(*Get subgoal i*)
berghofe@13799
   340
fun get_goal st i = List.nth (strip_imp_prems st, i-1)
berghofe@14107
   341
  handle Subscript => error "Goal number out of range";
berghofe@13799
   342
berghofe@13799
   343
(*reverses parameters for substitution*)
berghofe@13799
   344
fun goal_params st i =
berghofe@13799
   345
  let val gi = get_goal st i
berghofe@14137
   346
      val rfrees = map Free (rename_wrt_term gi (strip_params gi))
berghofe@13799
   347
  in (gi, rfrees) end;
berghofe@13799
   348
berghofe@13799
   349
fun concl_of_goal st i =
berghofe@13799
   350
  let val (gi, rfrees) = goal_params st i
berghofe@13799
   351
      val B = strip_assums_concl gi
berghofe@13799
   352
  in subst_bounds (rfrees, B) end;
berghofe@13799
   353
berghofe@13799
   354
fun prems_of_goal st i =
berghofe@13799
   355
  let val (gi, rfrees) = goal_params st i
berghofe@13799
   356
      val As = strip_assums_hyp gi
berghofe@13799
   357
  in map (fn A => subst_bounds (rfrees, A)) As end;
berghofe@13799
   358
clasohm@0
   359
end;