src/Pure/term.ML
author wenzelm
Thu Jul 27 23:28:23 2006 +0200 (2006-07-27)
changeset 20239 620a3f297072
parent 20199 3170fea83ae7
child 20331 ccdd1592f5ff
permissions -rw-r--r--
declare_term_names: cover types as well;
removed unused zero_var_indexesT;
tuned;
wenzelm@9536
     1
(*  Title:      Pure/term.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@9536
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   Cambridge University 1992
clasohm@1364
     5
wenzelm@4444
     6
Simply typed lambda-calculus: types, terms, and basic operations.
clasohm@0
     7
*)
clasohm@0
     8
clasohm@1364
     9
infix 9  $;
clasohm@1364
    10
infixr 5 -->;
wenzelm@4444
    11
infixr --->;
wenzelm@4444
    12
infix aconv;
clasohm@1364
    13
wenzelm@4444
    14
signature BASIC_TERM =
wenzelm@4444
    15
sig
wenzelm@4444
    16
  type indexname
wenzelm@4444
    17
  type class
wenzelm@4444
    18
  type sort
wenzelm@14829
    19
  type arity
wenzelm@4444
    20
  datatype typ =
wenzelm@4444
    21
    Type  of string * typ list |
wenzelm@4444
    22
    TFree of string * sort |
wenzelm@4444
    23
    TVar  of indexname * sort
wenzelm@16537
    24
  datatype term =
wenzelm@16537
    25
    Const of string * typ |
wenzelm@16537
    26
    Free of string * typ |
wenzelm@16537
    27
    Var of indexname * typ |
wenzelm@16537
    28
    Bound of int |
wenzelm@16537
    29
    Abs of string * typ * term |
wenzelm@17756
    30
    $ of term * term
wenzelm@16537
    31
  exception TYPE of string * typ list * term list
wenzelm@16537
    32
  exception TERM of string * term list
wenzelm@16710
    33
  val dummyT: typ
wenzelm@16710
    34
  val no_dummyT: typ -> typ
wenzelm@4444
    35
  val --> : typ * typ -> typ
wenzelm@4444
    36
  val ---> : typ list * typ -> typ
wenzelm@16710
    37
  val dest_Type: typ -> string * typ list
wenzelm@16710
    38
  val dest_TVar: typ -> indexname * sort
wenzelm@16710
    39
  val dest_TFree: typ -> string * sort
wenzelm@16710
    40
  val is_Bound: term -> bool
wenzelm@16710
    41
  val is_Const: term -> bool
wenzelm@16710
    42
  val is_Free: term -> bool
wenzelm@16710
    43
  val is_Var: term -> bool
wenzelm@4444
    44
  val is_TVar: typ -> bool
wenzelm@16710
    45
  val dest_Const: term -> string * typ
wenzelm@16710
    46
  val dest_Free: term -> string * typ
wenzelm@16710
    47
  val dest_Var: term -> indexname * typ
wenzelm@4444
    48
  val domain_type: typ -> typ
wenzelm@4480
    49
  val range_type: typ -> typ
wenzelm@4444
    50
  val binder_types: typ -> typ list
wenzelm@4444
    51
  val body_type: typ -> typ
wenzelm@4444
    52
  val strip_type: typ -> typ list * typ
wenzelm@16710
    53
  val type_of1: typ list * term -> typ
wenzelm@4444
    54
  val type_of: term -> typ
wenzelm@16710
    55
  val fastype_of1: typ list * term -> typ
wenzelm@4444
    56
  val fastype_of: term -> typ
wenzelm@10806
    57
  val list_abs: (string * typ) list * term -> term
haftmann@18927
    58
  val strip_abs: term -> (string * typ) list * term
wenzelm@4444
    59
  val strip_abs_body: term -> term
wenzelm@4444
    60
  val strip_abs_vars: term -> (string * typ) list
wenzelm@4444
    61
  val strip_qnt_body: string -> term -> term
wenzelm@4444
    62
  val strip_qnt_vars: string -> term -> (string * typ) list
wenzelm@4444
    63
  val list_comb: term * term list -> term
wenzelm@4444
    64
  val strip_comb: term -> term * term list
wenzelm@4444
    65
  val head_of: term -> term
wenzelm@4444
    66
  val size_of_term: term -> int
haftmann@18847
    67
  val map_atyps: (typ -> typ) -> typ -> typ
haftmann@18847
    68
  val map_aterms: (term -> term) -> term -> term
wenzelm@4444
    69
  val map_type_tvar: (indexname * sort -> typ) -> typ -> typ
wenzelm@4444
    70
  val map_type_tfree: (string * sort -> typ) -> typ -> typ
wenzelm@4444
    71
  val map_term_types: (typ -> typ) -> term -> term
wenzelm@16943
    72
  val fold_atyps: (typ -> 'a -> 'a) -> typ -> 'a -> 'a
wenzelm@16943
    73
  val fold_aterms: (term -> 'a -> 'a) -> term -> 'a -> 'a
wenzelm@16943
    74
  val fold_term_types: (term -> typ -> 'a -> 'a) -> term -> 'a -> 'a
wenzelm@16943
    75
  val fold_types: (typ -> 'a -> 'a) -> term -> 'a -> 'a
haftmann@18927
    76
  val it_term_types: (typ * 'a -> 'a) -> term * 'a -> 'a
wenzelm@16943
    77
  val add_term_names: term * string list -> string list
wenzelm@16710
    78
  val aconv: term * term -> bool
wenzelm@16710
    79
  val aconvs: term list * term list -> bool
wenzelm@16537
    80
  structure Vartab: TABLE
wenzelm@16537
    81
  structure Typtab: TABLE
wenzelm@16537
    82
  structure Termtab: TABLE
wenzelm@4444
    83
  val propT: typ
wenzelm@4444
    84
  val implies: term
wenzelm@4444
    85
  val all: typ -> term
wenzelm@4444
    86
  val equals: typ -> term
wenzelm@4444
    87
  val strip_all_body: term -> term
wenzelm@4444
    88
  val strip_all_vars: term -> (string * typ) list
wenzelm@4444
    89
  val incr_bv: int * int * term -> term
wenzelm@4444
    90
  val incr_boundvars: int -> term -> term
wenzelm@4444
    91
  val add_loose_bnos: term * int * int list -> int list
wenzelm@4444
    92
  val loose_bnos: term -> int list
wenzelm@4444
    93
  val loose_bvar: term * int -> bool
wenzelm@4444
    94
  val loose_bvar1: term * int -> bool
wenzelm@4444
    95
  val subst_bounds: term list * term -> term
wenzelm@4444
    96
  val subst_bound: term * term -> term
wenzelm@4444
    97
  val betapply: term * term -> term
wenzelm@18183
    98
  val betapplys: term * term list -> term
wenzelm@4444
    99
  val eq_ix: indexname * indexname -> bool
wenzelm@4444
   100
  val could_unify: term * term -> bool
wenzelm@4444
   101
  val subst_free: (term * term) list -> term -> term
wenzelm@4444
   102
  val abstract_over: term * term -> term
wenzelm@11922
   103
  val lambda: term -> term -> term
wenzelm@4444
   104
  val absfree: string * typ * term -> term
wenzelm@17786
   105
  val absdummy: typ * term -> term
wenzelm@4444
   106
  val list_abs_free: (string * typ) list * term -> term
wenzelm@4444
   107
  val list_all_free: (string * typ) list * term -> term
wenzelm@4444
   108
  val list_all: (string * typ) list * term -> term
wenzelm@16710
   109
  val subst_atomic: (term * term) list -> term -> term
wenzelm@16710
   110
  val typ_subst_atomic: (typ * typ) list -> typ -> typ
wenzelm@16710
   111
  val subst_atomic_types: (typ * typ) list -> term -> term
wenzelm@16710
   112
  val typ_subst_TVars: (indexname * typ) list -> typ -> typ
wenzelm@16710
   113
  val subst_TVars: (indexname * typ) list -> term -> term
wenzelm@16710
   114
  val subst_Vars: (indexname * term) list -> term -> term
wenzelm@16710
   115
  val subst_vars: (indexname * typ) list * (indexname * term) list -> term -> term
wenzelm@16710
   116
  val is_first_order: string list -> term -> bool
wenzelm@4444
   117
  val maxidx_of_typ: typ -> int
wenzelm@4444
   118
  val maxidx_of_typs: typ list -> int
wenzelm@4444
   119
  val maxidx_of_term: term -> int
wenzelm@4444
   120
  val add_term_consts: term * string list -> string list
nipkow@13646
   121
  val term_consts: term -> string list
wenzelm@19909
   122
  val exists_subtype: (typ -> bool) -> typ -> bool
wenzelm@16943
   123
  val exists_subterm: (term -> bool) -> term -> bool
wenzelm@16710
   124
  val exists_Const: (string * typ -> bool) -> term -> bool
wenzelm@16710
   125
  val add_term_free_names: term * string list -> string list
wenzelm@16710
   126
  val add_typ_tvars: typ * (indexname * sort) list -> (indexname * sort) list
wenzelm@16710
   127
  val add_typ_tfree_names: typ * string list -> string list
wenzelm@16710
   128
  val add_typ_tfrees: typ * (string * sort) list -> (string * sort) list
wenzelm@16710
   129
  val add_typ_varnames: typ * string list -> string list
wenzelm@16710
   130
  val add_term_tvars: term * (indexname * sort) list -> (indexname * sort) list
wenzelm@16710
   131
  val add_term_tfrees: term * (string * sort) list -> (string * sort) list
wenzelm@16710
   132
  val add_term_tfree_names: term * string list -> string list
wenzelm@16710
   133
  val add_term_tvarnames: term * string list -> string list
wenzelm@16710
   134
  val typ_tfrees: typ -> (string * sort) list
wenzelm@16710
   135
  val typ_tvars: typ -> (indexname * sort) list
wenzelm@16710
   136
  val term_tfrees: term -> (string * sort) list
wenzelm@16710
   137
  val term_tvars: term -> (indexname * sort) list
wenzelm@16710
   138
  val add_typ_ixns: indexname list * typ -> indexname list
wenzelm@16710
   139
  val add_term_tvar_ixns: term * indexname list -> indexname list
wenzelm@16710
   140
  val add_term_vars: term * term list -> term list
wenzelm@16710
   141
  val term_vars: term -> term list
wenzelm@4444
   142
  val add_term_frees: term * term list -> term list
wenzelm@4444
   143
  val term_frees: term -> term list
wenzelm@20160
   144
  val rename_wrt_term: term -> (string * 'a) list -> (string * 'a) list
wenzelm@15986
   145
  val show_question_marks: bool ref
wenzelm@4444
   146
end;
clasohm@0
   147
wenzelm@4444
   148
signature TERM =
wenzelm@4444
   149
sig
wenzelm@4444
   150
  include BASIC_TERM
wenzelm@19394
   151
  val aT: sort -> typ
wenzelm@19394
   152
  val itselfT: typ -> typ
wenzelm@19394
   153
  val a_itselfT: typ
wenzelm@16710
   154
  val argument_type_of: term -> typ
wenzelm@16943
   155
  val add_tvarsT: typ -> (indexname * sort) list -> (indexname * sort) list
wenzelm@16943
   156
  val add_tvars: term -> (indexname * sort) list -> (indexname * sort) list
wenzelm@16943
   157
  val add_vars: term -> (indexname * typ) list -> (indexname * typ) list
wenzelm@16943
   158
  val add_tfreesT: typ -> (string * sort) list -> (string * sort) list
wenzelm@16943
   159
  val add_tfrees: term -> (string * sort) list -> (string * sort) list
wenzelm@16943
   160
  val add_frees: term -> (string * typ) list -> (string * typ) list
wenzelm@20199
   161
  val add_varnames: term -> indexname list -> indexname list
haftmann@20109
   162
  val strip_abs_eta: int -> term -> (string * typ) list * term
wenzelm@16678
   163
  val fast_indexname_ord: indexname * indexname -> order
wenzelm@16537
   164
  val indexname_ord: indexname * indexname -> order
wenzelm@16537
   165
  val sort_ord: sort * sort -> order
wenzelm@16537
   166
  val typ_ord: typ * typ -> order
wenzelm@16678
   167
  val fast_term_ord: term * term -> order
wenzelm@16537
   168
  val term_ord: term * term -> order
wenzelm@16537
   169
  val hd_ord: term * term -> order
wenzelm@16537
   170
  val termless: term * term -> bool
ballarin@20129
   171
  val term_lpo: (term -> int) -> term * term -> order
wenzelm@12981
   172
  val match_bvars: (term * term) * (string * string) list -> (string * string) list
wenzelm@12981
   173
  val rename_abs: term -> term -> term -> term option
wenzelm@16943
   174
  val eq_tvar: (indexname * sort) * (indexname * sort) -> bool
wenzelm@16882
   175
  val eq_var: (indexname * typ) * (indexname * typ) -> bool
wenzelm@16943
   176
  val tvar_ord: (indexname * sort) * (indexname * sort) -> order
wenzelm@16943
   177
  val var_ord: (indexname * typ) * (indexname * typ) -> order
wenzelm@19909
   178
  val generalize: string list * string list -> int -> term -> term
wenzelm@19909
   179
  val generalizeT: string list -> int -> typ -> typ
wenzelm@20001
   180
  val generalize_option: string list * string list -> int -> term -> term option
wenzelm@20001
   181
  val generalizeT_option: string list -> int -> typ -> typ option
wenzelm@16882
   182
  val instantiate: ((indexname * sort) * typ) list * ((indexname * typ) * term) list
wenzelm@16882
   183
    -> term -> term
wenzelm@16882
   184
  val instantiateT: ((indexname * sort) * typ) list -> typ -> typ
wenzelm@20001
   185
  val instantiate_option: ((indexname * sort) * typ) list * ((indexname * typ) * term) list
wenzelm@20001
   186
    -> term -> term option
wenzelm@20001
   187
  val instantiateT_option: ((indexname * sort) * typ) list -> typ -> typ option
wenzelm@16710
   188
  val maxidx_typ: typ -> int -> int
wenzelm@16710
   189
  val maxidx_typs: typ list -> int -> int
wenzelm@16710
   190
  val maxidx_term: term -> int -> int
wenzelm@20239
   191
  val dest_abs: string * typ * term -> string * term
wenzelm@20148
   192
  val declare_term_names: term -> Name.context -> Name.context
wenzelm@20160
   193
  val variant_frees: term -> (string * 'a) list -> (string * 'a) list
wenzelm@16943
   194
  val zero_var_indexes: term -> term
wenzelm@16943
   195
  val zero_var_indexes_inst: term ->
wenzelm@16943
   196
    ((indexname * sort) * typ) list * ((indexname * typ) * term) list
wenzelm@9536
   197
  val dummy_patternN: string
wenzelm@18253
   198
  val dummy_pattern: typ -> term
wenzelm@9536
   199
  val no_dummy_patterns: term -> term
wenzelm@9536
   200
  val replace_dummy_patterns: int * term -> int * term
wenzelm@10552
   201
  val is_replaced_dummy_pattern: indexname -> bool
wenzelm@16035
   202
  val show_dummy_patterns: term -> term
wenzelm@14786
   203
  val string_of_vname: indexname -> string
wenzelm@14786
   204
  val string_of_vname': indexname -> string
wenzelm@4444
   205
end;
wenzelm@4444
   206
wenzelm@4444
   207
structure Term: TERM =
clasohm@1364
   208
struct
clasohm@0
   209
clasohm@0
   210
(*Indexnames can be quickly renamed by adding an offset to the integer part,
clasohm@0
   211
  for resolution.*)
wenzelm@16537
   212
type indexname = string * int;
clasohm@0
   213
wenzelm@4626
   214
(* Types are classified by sorts. *)
clasohm@0
   215
type class = string;
clasohm@0
   216
type sort  = class list;
wenzelm@14829
   217
type arity = string * sort list * sort;
clasohm@0
   218
clasohm@0
   219
(* The sorts attached to TFrees and TVars specify the sort of that variable *)
clasohm@0
   220
datatype typ = Type  of string * typ list
clasohm@0
   221
             | TFree of string * sort
wenzelm@9536
   222
             | TVar  of indexname * sort;
clasohm@0
   223
paulson@6033
   224
(*Terms.  Bound variables are indicated by depth number.
clasohm@0
   225
  Free variables, (scheme) variables and constants have names.
wenzelm@4626
   226
  An term is "closed" if every bound variable of level "lev"
wenzelm@13000
   227
  is enclosed by at least "lev" abstractions.
clasohm@0
   228
clasohm@0
   229
  It is possible to create meaningless terms containing loose bound vars
clasohm@0
   230
  or type mismatches.  But such terms are not allowed in rules. *)
clasohm@0
   231
wenzelm@13000
   232
datatype term =
clasohm@0
   233
    Const of string * typ
wenzelm@13000
   234
  | Free  of string * typ
clasohm@0
   235
  | Var   of indexname * typ
clasohm@0
   236
  | Bound of int
clasohm@0
   237
  | Abs   of string*typ*term
wenzelm@3965
   238
  | op $  of term*term;
clasohm@0
   239
wenzelm@16537
   240
(*Errors involving type mismatches*)
clasohm@0
   241
exception TYPE of string * typ list * term list;
clasohm@0
   242
wenzelm@16537
   243
(*Errors errors involving terms*)
clasohm@0
   244
exception TERM of string * term list;
clasohm@0
   245
clasohm@0
   246
(*Note variable naming conventions!
clasohm@0
   247
    a,b,c: string
clasohm@0
   248
    f,g,h: functions (including terms of function type)
clasohm@0
   249
    i,j,m,n: int
clasohm@0
   250
    t,u: term
clasohm@0
   251
    v,w: indexnames
clasohm@0
   252
    x,y: any
clasohm@0
   253
    A,B,C: term (denoting formulae)
clasohm@0
   254
    T,U: typ
clasohm@0
   255
*)
clasohm@0
   256
clasohm@0
   257
paulson@6033
   258
(** Types **)
paulson@6033
   259
wenzelm@16537
   260
(*dummy type for parsing and printing etc.*)
wenzelm@16537
   261
val dummyT = Type ("dummy", []);
wenzelm@16537
   262
wenzelm@16537
   263
fun no_dummyT typ =
wenzelm@16537
   264
  let
wenzelm@16537
   265
    fun check (T as Type ("dummy", _)) =
wenzelm@16537
   266
          raise TYPE ("Illegal occurrence of '_' dummy type", [T], [])
wenzelm@16537
   267
      | check (Type (_, Ts)) = List.app check Ts
wenzelm@16537
   268
      | check _ = ();
wenzelm@16537
   269
  in check typ; typ end;
wenzelm@16537
   270
paulson@6033
   271
fun S --> T = Type("fun",[S,T]);
paulson@6033
   272
paulson@6033
   273
(*handy for multiple args: [T1,...,Tn]--->T  gives  T1-->(T2--> ... -->T)*)
skalberg@15570
   274
val op ---> = Library.foldr (op -->);
paulson@6033
   275
paulson@6033
   276
fun dest_Type (Type x) = x
paulson@6033
   277
  | dest_Type T = raise TYPE ("dest_Type", [T], []);
dixon@15914
   278
fun dest_TVar (TVar x) = x
dixon@15914
   279
  | dest_TVar T = raise TYPE ("dest_TVar", [T], []);
dixon@15914
   280
fun dest_TFree (TFree x) = x
dixon@15914
   281
  | dest_TFree T = raise TYPE ("dest_TFree", [T], []);
paulson@6033
   282
wenzelm@16537
   283
clasohm@0
   284
(** Discriminators **)
clasohm@0
   285
nipkow@7318
   286
fun is_Bound (Bound _) = true
nipkow@7318
   287
  | is_Bound _         = false;
nipkow@7318
   288
clasohm@0
   289
fun is_Const (Const _) = true
clasohm@0
   290
  | is_Const _ = false;
clasohm@0
   291
clasohm@0
   292
fun is_Free (Free _) = true
clasohm@0
   293
  | is_Free _ = false;
clasohm@0
   294
clasohm@0
   295
fun is_Var (Var _) = true
clasohm@0
   296
  | is_Var _ = false;
clasohm@0
   297
clasohm@0
   298
fun is_TVar (TVar _) = true
clasohm@0
   299
  | is_TVar _ = false;
clasohm@0
   300
wenzelm@16537
   301
clasohm@0
   302
(** Destructors **)
clasohm@0
   303
clasohm@0
   304
fun dest_Const (Const x) =  x
clasohm@0
   305
  | dest_Const t = raise TERM("dest_Const", [t]);
clasohm@0
   306
clasohm@0
   307
fun dest_Free (Free x) =  x
clasohm@0
   308
  | dest_Free t = raise TERM("dest_Free", [t]);
clasohm@0
   309
clasohm@0
   310
fun dest_Var (Var x) =  x
clasohm@0
   311
  | dest_Var t = raise TERM("dest_Var", [t]);
clasohm@0
   312
clasohm@0
   313
paulson@4464
   314
fun domain_type (Type("fun", [T,_])) = T
paulson@4464
   315
and range_type  (Type("fun", [_,T])) = T;
paulson@4064
   316
clasohm@0
   317
(* maps  [T1,...,Tn]--->T  to the list  [T1,T2,...,Tn]*)
clasohm@0
   318
fun binder_types (Type("fun",[S,T])) = S :: binder_types T
clasohm@0
   319
  | binder_types _   =  [];
clasohm@0
   320
clasohm@0
   321
(* maps  [T1,...,Tn]--->T  to T*)
clasohm@0
   322
fun body_type (Type("fun",[S,T])) = body_type T
clasohm@0
   323
  | body_type T   =  T;
clasohm@0
   324
clasohm@0
   325
(* maps  [T1,...,Tn]--->T  to   ([T1,T2,...,Tn], T)  *)
clasohm@0
   326
fun strip_type T : typ list * typ =
clasohm@0
   327
  (binder_types T, body_type T);
clasohm@0
   328
clasohm@0
   329
clasohm@0
   330
(*Compute the type of the term, checking that combinations are well-typed
clasohm@0
   331
  Ts = [T0,T1,...] holds types of bound variables 0, 1, ...*)
clasohm@0
   332
fun type_of1 (Ts, Const (_,T)) = T
clasohm@0
   333
  | type_of1 (Ts, Free  (_,T)) = T
skalberg@15570
   334
  | type_of1 (Ts, Bound i) = (List.nth (Ts,i)
skalberg@15570
   335
        handle Subscript => raise TYPE("type_of: bound variable", [], [Bound i]))
clasohm@0
   336
  | type_of1 (Ts, Var (_,T)) = T
clasohm@0
   337
  | type_of1 (Ts, Abs (_,T,body)) = T --> type_of1(T::Ts, body)
wenzelm@13000
   338
  | type_of1 (Ts, f$u) =
clasohm@0
   339
      let val U = type_of1(Ts,u)
clasohm@0
   340
          and T = type_of1(Ts,f)
clasohm@0
   341
      in case T of
wenzelm@9536
   342
            Type("fun",[T1,T2]) =>
wenzelm@9536
   343
              if T1=U then T2  else raise TYPE
wenzelm@9536
   344
                    ("type_of: type mismatch in application", [T1,U], [f$u])
wenzelm@13000
   345
          | _ => raise TYPE
wenzelm@9536
   346
                    ("type_of: function type is expected in application",
wenzelm@9536
   347
                     [T,U], [f$u])
clasohm@0
   348
      end;
clasohm@0
   349
clasohm@0
   350
fun type_of t : typ = type_of1 ([],t);
clasohm@0
   351
clasohm@0
   352
(*Determines the type of a term, with minimal checking*)
wenzelm@13000
   353
fun fastype_of1 (Ts, f$u) =
lcp@61
   354
    (case fastype_of1 (Ts,f) of
wenzelm@9536
   355
        Type("fun",[_,T]) => T
wenzelm@9536
   356
        | _ => raise TERM("fastype_of: expected function type", [f$u]))
lcp@61
   357
  | fastype_of1 (_, Const (_,T)) = T
lcp@61
   358
  | fastype_of1 (_, Free (_,T)) = T
skalberg@15570
   359
  | fastype_of1 (Ts, Bound i) = (List.nth(Ts,i)
skalberg@15570
   360
         handle Subscript => raise TERM("fastype_of: Bound", [Bound i]))
wenzelm@13000
   361
  | fastype_of1 (_, Var (_,T)) = T
lcp@61
   362
  | fastype_of1 (Ts, Abs (_,T,u)) = T --> fastype_of1 (T::Ts, u);
lcp@61
   363
lcp@61
   364
fun fastype_of t : typ = fastype_of1 ([],t);
clasohm@0
   365
wenzelm@16678
   366
(*Determine the argument type of a function*)
wenzelm@16678
   367
fun argument_type_of tm =
wenzelm@16678
   368
  let
wenzelm@16678
   369
    fun argT i (Type ("fun", [T, U])) = if i = 0 then T else argT (i - 1) U
wenzelm@16678
   370
      | argT _ T = raise TYPE ("argument_type_of", [T], []);
wenzelm@16678
   371
wenzelm@16678
   372
    fun arg 0 _ (Abs (_, T, _)) = T
wenzelm@16678
   373
      | arg i Ts (Abs (_, T, t)) = arg (i - 1) (T :: Ts) t
wenzelm@16678
   374
      | arg i Ts (t $ _) = arg (i + 1) Ts t
wenzelm@16678
   375
      | arg i Ts a = argT i (fastype_of1 (Ts, a));
wenzelm@16678
   376
  in arg 0 [] tm end;
wenzelm@16678
   377
clasohm@0
   378
wenzelm@19473
   379
val list_abs = uncurry (fold_rev (fn (x, T) => fn t => Abs (x, T, t)));
wenzelm@10806
   380
haftmann@18927
   381
fun strip_abs (Abs (a, T, t)) =
haftmann@18927
   382
      let val (a', t') = strip_abs t
haftmann@18927
   383
      in ((a, T) :: a', t') end
haftmann@18927
   384
  | strip_abs t = ([], t);
haftmann@18927
   385
clasohm@0
   386
(* maps  (x1,...,xn)t   to   t  *)
wenzelm@13000
   387
fun strip_abs_body (Abs(_,_,t))  =  strip_abs_body t
clasohm@0
   388
  | strip_abs_body u  =  u;
clasohm@0
   389
clasohm@0
   390
(* maps  (x1,...,xn)t   to   [x1, ..., xn]  *)
wenzelm@13000
   391
fun strip_abs_vars (Abs(a,T,t))  =  (a,T) :: strip_abs_vars t
clasohm@0
   392
  | strip_abs_vars u  =  [] : (string*typ) list;
clasohm@0
   393
clasohm@0
   394
clasohm@0
   395
fun strip_qnt_body qnt =
clasohm@0
   396
let fun strip(tm as Const(c,_)$Abs(_,_,t)) = if c=qnt then strip t else tm
clasohm@0
   397
      | strip t = t
clasohm@0
   398
in strip end;
clasohm@0
   399
clasohm@0
   400
fun strip_qnt_vars qnt =
clasohm@0
   401
let fun strip(Const(c,_)$Abs(a,T,t)) = if c=qnt then (a,T)::strip t else []
clasohm@0
   402
      | strip t  =  [] : (string*typ) list
clasohm@0
   403
in strip end;
clasohm@0
   404
clasohm@0
   405
clasohm@0
   406
(* maps   (f, [t1,...,tn])  to  f(t1,...,tn) *)
skalberg@15570
   407
val list_comb : term * term list -> term = Library.foldl (op $);
clasohm@0
   408
clasohm@0
   409
clasohm@0
   410
(* maps   f(t1,...,tn)  to  (f, [t1,...,tn]) ; naturally tail-recursive*)
wenzelm@13000
   411
fun strip_comb u : term * term list =
clasohm@0
   412
    let fun stripc (f$t, ts) = stripc (f, t::ts)
wenzelm@13000
   413
        |   stripc  x =  x
clasohm@0
   414
    in  stripc(u,[])  end;
clasohm@0
   415
clasohm@0
   416
clasohm@0
   417
(* maps   f(t1,...,tn)  to  f , which is never a combination *)
clasohm@0
   418
fun head_of (f$t) = head_of f
clasohm@0
   419
  | head_of u = u;
clasohm@0
   420
clasohm@0
   421
wenzelm@16599
   422
(*number of atoms and abstractions in a term*)
wenzelm@16599
   423
fun size_of_term tm =
wenzelm@16599
   424
  let
wenzelm@16678
   425
    fun add_size (t $ u, n) = add_size (t, add_size (u, n))
wenzelm@16678
   426
      | add_size (Abs (_ ,_, t), n) = add_size (t, n + 1)
wenzelm@16678
   427
      | add_size (_, n) = n + 1;
wenzelm@16678
   428
  in add_size (tm, 0) end;
clasohm@0
   429
haftmann@18847
   430
fun map_atyps f (Type (a, Ts)) = Type (a, map (map_atyps f) Ts)
haftmann@18976
   431
  | map_atyps f T = f T;
haftmann@18847
   432
haftmann@18847
   433
fun map_aterms f (t $ u) = map_aterms f t $ map_aterms f u
haftmann@18847
   434
  | map_aterms f (Abs (a, T, t)) = Abs (a, T, map_aterms f t)
haftmann@18847
   435
  | map_aterms f t = f t;
haftmann@18847
   436
wenzelm@18981
   437
fun map_type_tvar f = map_atyps (fn TVar x => f x | T => T);
wenzelm@18981
   438
fun map_type_tfree f = map_atyps (fn TFree x => f x | T => T);
nipkow@949
   439
clasohm@0
   440
fun map_term_types f =
wenzelm@16678
   441
  let
wenzelm@16678
   442
    fun map_aux (Const (a, T)) = Const (a, f T)
wenzelm@16678
   443
      | map_aux (Free (a, T)) = Free (a, f T)
wenzelm@16678
   444
      | map_aux (Var (v, T)) = Var (v, f T)
wenzelm@16678
   445
      | map_aux (t as Bound _)  = t
wenzelm@16678
   446
      | map_aux (Abs (a, T, t)) = Abs (a, f T, map_aux t)
wenzelm@16678
   447
      | map_aux (t $ u) = map_aux t $ map_aux u;
wenzelm@16678
   448
  in map_aux end;
clasohm@0
   449
clasohm@0
   450
(* iterate a function over all types in a term *)
clasohm@0
   451
fun it_term_types f =
clasohm@0
   452
let fun iter(Const(_,T), a) = f(T,a)
clasohm@0
   453
      | iter(Free(_,T), a) = f(T,a)
clasohm@0
   454
      | iter(Var(_,T), a) = f(T,a)
clasohm@0
   455
      | iter(Abs(_,T,t), a) = iter(t,f(T,a))
clasohm@0
   456
      | iter(f$u, a) = iter(f, iter(u, a))
clasohm@0
   457
      | iter(Bound _, a) = a
clasohm@0
   458
in iter end
clasohm@0
   459
clasohm@0
   460
wenzelm@16943
   461
(* fold types and terms *)
wenzelm@16943
   462
wenzelm@16943
   463
(*fold atoms of type*)
wenzelm@16943
   464
fun fold_atyps f (Type (_, Ts)) = fold (fold_atyps f) Ts
wenzelm@16943
   465
  | fold_atyps f T = f T;
wenzelm@16943
   466
wenzelm@16943
   467
(*fold atoms of term*)
wenzelm@16943
   468
fun fold_aterms f (t $ u) = fold_aterms f t #> fold_aterms f u
wenzelm@16943
   469
  | fold_aterms f (Abs (_, _, t)) = fold_aterms f t
wenzelm@16943
   470
  | fold_aterms f a = f a;
wenzelm@16943
   471
wenzelm@16943
   472
(*fold types of term*)
wenzelm@16943
   473
fun fold_term_types f (t as Const (_, T)) = f t T
wenzelm@16943
   474
  | fold_term_types f (t as Free (_, T)) = f t T
wenzelm@16943
   475
  | fold_term_types f (t as Var (_, T)) = f t T
wenzelm@16943
   476
  | fold_term_types f (Bound _) = I
wenzelm@16943
   477
  | fold_term_types f (t as Abs (_, T, b)) = f t T #> fold_term_types f b
wenzelm@16943
   478
  | fold_term_types f (t $ u) = fold_term_types f t #> fold_term_types f u;
wenzelm@16943
   479
wenzelm@16943
   480
fun fold_types f = fold_term_types (K f);
wenzelm@16943
   481
wenzelm@16943
   482
(*collect variables*)
wenzelm@16943
   483
val add_tvarsT = fold_atyps (fn TVar v => insert (op =) v | _ => I);
wenzelm@16943
   484
val add_tvars = fold_types add_tvarsT;
wenzelm@16943
   485
val add_vars = fold_aterms (fn Var v => insert (op =) v | _ => I);
wenzelm@20199
   486
val add_varnames = fold_aterms (fn Var (xi, _) => insert (op =) xi | _ => I);
wenzelm@16943
   487
val add_tfreesT = fold_atyps (fn TFree v => insert (op =) v | _ => I);
wenzelm@16943
   488
val add_tfrees = fold_types add_tfreesT;
wenzelm@16943
   489
val add_frees = fold_aterms (fn Free v => insert (op =) v | _ => I);
wenzelm@16943
   490
wenzelm@16943
   491
wenzelm@16678
   492
(** Comparing terms, types, sorts etc. **)
wenzelm@16537
   493
wenzelm@16678
   494
(* fast syntactic comparison *)
wenzelm@16678
   495
wenzelm@16678
   496
fun fast_indexname_ord ((x, i), (y, j)) =
wenzelm@16678
   497
  (case int_ord (i, j) of EQUAL => fast_string_ord (x, y) | ord => ord);
wenzelm@16537
   498
wenzelm@16599
   499
fun sort_ord SS =
wenzelm@16599
   500
  if pointer_eq SS then EQUAL
wenzelm@16990
   501
  else dict_ord fast_string_ord SS;
wenzelm@16678
   502
wenzelm@16678
   503
local
wenzelm@16537
   504
wenzelm@16678
   505
fun cons_nr (TVar _) = 0
wenzelm@16678
   506
  | cons_nr (TFree _) = 1
wenzelm@16678
   507
  | cons_nr (Type _) = 2;
wenzelm@16537
   508
wenzelm@16678
   509
in
wenzelm@16537
   510
wenzelm@16537
   511
fun typ_ord TU =
wenzelm@16537
   512
  if pointer_eq TU then EQUAL
wenzelm@16537
   513
  else
wenzelm@16537
   514
    (case TU of
wenzelm@16678
   515
      (Type (a, Ts), Type (b, Us)) =>
wenzelm@16990
   516
        (case fast_string_ord (a, b) of EQUAL => dict_ord typ_ord (Ts, Us) | ord => ord)
wenzelm@16678
   517
    | (TFree (a, S), TFree (b, S')) =>
wenzelm@16678
   518
        (case fast_string_ord (a, b) of EQUAL => sort_ord (S, S') | ord => ord)
wenzelm@16678
   519
    | (TVar (xi, S), TVar (yj, S')) =>
wenzelm@16678
   520
        (case fast_indexname_ord (xi, yj) of EQUAL => sort_ord (S, S') | ord => ord)
wenzelm@16678
   521
    | (T, U) => int_ord (cons_nr T, cons_nr U));
wenzelm@16678
   522
wenzelm@16678
   523
end;
wenzelm@16678
   524
wenzelm@16678
   525
local
wenzelm@16678
   526
wenzelm@16678
   527
fun cons_nr (Const _) = 0
wenzelm@16678
   528
  | cons_nr (Free _) = 1
wenzelm@16678
   529
  | cons_nr (Var _) = 2
wenzelm@16678
   530
  | cons_nr (Bound _) = 3
wenzelm@16678
   531
  | cons_nr (Abs _) = 4
wenzelm@16678
   532
  | cons_nr (_ $ _) = 5;
wenzelm@16678
   533
wenzelm@16678
   534
fun struct_ord (Abs (_, _, t), Abs (_, _, u)) = struct_ord (t, u)
wenzelm@16678
   535
  | struct_ord (t1 $ t2, u1 $ u2) =
wenzelm@16678
   536
      (case struct_ord (t1, u1) of EQUAL => struct_ord (t2, u2) | ord => ord)
wenzelm@16678
   537
  | struct_ord (t, u) = int_ord (cons_nr t, cons_nr u);
wenzelm@16678
   538
wenzelm@16678
   539
fun atoms_ord (Abs (_, _, t), Abs (_, _, u)) = atoms_ord (t, u)
wenzelm@16678
   540
  | atoms_ord (t1 $ t2, u1 $ u2) =
wenzelm@16678
   541
      (case atoms_ord (t1, u1) of EQUAL => atoms_ord (t2, u2) | ord => ord)
wenzelm@16678
   542
  | atoms_ord (Const (a, _), Const (b, _)) = fast_string_ord (a, b)
wenzelm@16678
   543
  | atoms_ord (Free (x, _), Free (y, _)) = fast_string_ord (x, y)
wenzelm@16678
   544
  | atoms_ord (Var (xi, _), Var (yj, _)) = fast_indexname_ord (xi, yj)
wenzelm@16678
   545
  | atoms_ord (Bound i, Bound j) = int_ord (i, j)
wenzelm@16678
   546
  | atoms_ord _ = sys_error "atoms_ord";
wenzelm@16678
   547
wenzelm@16678
   548
fun types_ord (Abs (_, T, t), Abs (_, U, u)) =
wenzelm@16678
   549
      (case typ_ord (T, U) of EQUAL => types_ord (t, u) | ord => ord)
wenzelm@16678
   550
  | types_ord (t1 $ t2, u1 $ u2) =
wenzelm@16678
   551
      (case types_ord (t1, u1) of EQUAL => types_ord (t2, u2) | ord => ord)
wenzelm@16678
   552
  | types_ord (Const (_, T), Const (_, U)) = typ_ord (T, U)
wenzelm@16678
   553
  | types_ord (Free (_, T), Free (_, U)) = typ_ord (T, U)
wenzelm@16678
   554
  | types_ord (Var (_, T), Var (_, U)) = typ_ord (T, U)
wenzelm@16678
   555
  | types_ord (Bound _, Bound _) = EQUAL
wenzelm@16678
   556
  | types_ord _ = sys_error "types_ord";
wenzelm@16678
   557
wenzelm@16678
   558
in
wenzelm@16678
   559
wenzelm@16678
   560
fun fast_term_ord tu =
wenzelm@16678
   561
  if pointer_eq tu then EQUAL
wenzelm@16678
   562
  else
wenzelm@16678
   563
    (case struct_ord tu of
wenzelm@16678
   564
      EQUAL => (case atoms_ord tu of EQUAL => types_ord tu | ord => ord)
wenzelm@16678
   565
    | ord => ord);
wenzelm@16678
   566
wenzelm@16678
   567
fun op aconv tu = (fast_term_ord tu = EQUAL);
wenzelm@16678
   568
fun aconvs ts_us = (list_ord fast_term_ord ts_us = EQUAL);
wenzelm@16678
   569
wenzelm@16678
   570
structure Vartab = TableFun(type key = indexname val ord = fast_indexname_ord);
wenzelm@16678
   571
structure Typtab = TableFun(type key = typ val ord = typ_ord);
wenzelm@16678
   572
structure Termtab = TableFun(type key = term val ord = fast_term_ord);
wenzelm@16678
   573
wenzelm@16678
   574
end;
wenzelm@16537
   575
wenzelm@16537
   576
wenzelm@16537
   577
(* term_ord *)
wenzelm@16537
   578
wenzelm@16537
   579
(*a linear well-founded AC-compatible ordering for terms:
wenzelm@16537
   580
  s < t <=> 1. size(s) < size(t) or
wenzelm@16537
   581
            2. size(s) = size(t) and s=f(...) and t=g(...) and f<g or
wenzelm@16537
   582
            3. size(s) = size(t) and s=f(s1..sn) and t=f(t1..tn) and
wenzelm@16537
   583
               (s1..sn) < (t1..tn) (lexicographically)*)
wenzelm@16678
   584
wenzelm@16678
   585
fun indexname_ord ((x, i), (y, j)) =
wenzelm@16678
   586
  (case int_ord (i, j) of EQUAL => string_ord (x, y) | ord => ord);
wenzelm@16678
   587
wenzelm@16667
   588
local
wenzelm@16667
   589
wenzelm@16667
   590
fun hd_depth (t $ _, n) = hd_depth (t, n + 1)
wenzelm@16667
   591
  | hd_depth p = p;
wenzelm@16537
   592
wenzelm@16537
   593
fun dest_hd (Const (a, T)) = (((a, 0), T), 0)
wenzelm@16537
   594
  | dest_hd (Free (a, T)) = (((a, 0), T), 1)
wenzelm@16537
   595
  | dest_hd (Var v) = (v, 2)
wenzelm@16537
   596
  | dest_hd (Bound i) = ((("", i), dummyT), 3)
wenzelm@16537
   597
  | dest_hd (Abs (_, T, _)) = ((("", 0), T), 4);
wenzelm@16537
   598
wenzelm@16667
   599
in
wenzelm@16667
   600
wenzelm@16537
   601
fun term_ord tu =
wenzelm@16537
   602
  if pointer_eq tu then EQUAL
wenzelm@16537
   603
  else
wenzelm@16537
   604
    (case tu of
wenzelm@16537
   605
      (Abs (_, T, t), Abs(_, U, u)) =>
wenzelm@16537
   606
        (case term_ord (t, u) of EQUAL => typ_ord (T, U) | ord => ord)
wenzelm@16667
   607
    | (t, u) =>
wenzelm@16537
   608
        (case int_ord (size_of_term t, size_of_term u) of
wenzelm@16537
   609
          EQUAL =>
wenzelm@16943
   610
            (case prod_ord hd_ord int_ord (hd_depth (t, 0), hd_depth (u, 0)) of
wenzelm@16943
   611
              EQUAL => args_ord (t, u) | ord => ord)
wenzelm@16537
   612
        | ord => ord))
wenzelm@16537
   613
and hd_ord (f, g) =
wenzelm@16537
   614
  prod_ord (prod_ord indexname_ord typ_ord) int_ord (dest_hd f, dest_hd g)
wenzelm@16667
   615
and args_ord (f $ t, g $ u) =
wenzelm@16667
   616
      (case args_ord (f, g) of EQUAL => term_ord (t, u) | ord => ord)
wenzelm@16667
   617
  | args_ord _ = EQUAL;
wenzelm@16537
   618
wenzelm@16537
   619
fun termless tu = (term_ord tu = LESS);
wenzelm@16537
   620
wenzelm@16667
   621
end;
wenzelm@16667
   622
wenzelm@16667
   623
wenzelm@16667
   624
(** Lexicographic path order on terms **)
wenzelm@16667
   625
wenzelm@16667
   626
(*
nipkow@16570
   627
  See Baader & Nipkow, Term rewriting, CUP 1998.
nipkow@16570
   628
  Without variables.  Const, Var, Bound, Free and Abs are treated all as
nipkow@16570
   629
  constants.
nipkow@16570
   630
ballarin@20129
   631
  f_ord maps terms to integers and serves two purposes:
nipkow@16570
   632
  - Predicate on constant symbols.  Those that are not recognised by f_ord
nipkow@16570
   633
    must be mapped to ~1.
nipkow@16570
   634
  - Order on the recognised symbols.  These must be mapped to distinct
nipkow@16570
   635
    integers >= 0.
ballarin@20129
   636
  The argument of f_ord is never an application.
wenzelm@16667
   637
*)
nipkow@16570
   638
nipkow@16570
   639
local
ballarin@20129
   640
ballarin@20129
   641
fun unrecognized (Const (a, T)) = ((1, ((a, 0), T)), 0)
ballarin@20129
   642
  | unrecognized (Free (a, T)) = ((1, ((a, 0), T)), 0)
ballarin@20129
   643
  | unrecognized (Var v) = ((1, v), 1)
ballarin@20129
   644
  | unrecognized (Bound i) = ((1, (("", i), dummyT)), 2)
ballarin@20129
   645
  | unrecognized (Abs (_, T, _)) = ((1, (("", 0), T)), 3);
ballarin@20129
   646
ballarin@20129
   647
fun dest_hd f_ord t =
ballarin@20129
   648
      let val ord = f_ord t in
ballarin@20129
   649
        if ord = ~1 then unrecognized t else ((0, (("", ord), fastype_of t)), 0)
nipkow@16570
   650
      end
nipkow@16570
   651
nipkow@16570
   652
fun term_lpo f_ord (s, t) =
nipkow@16570
   653
  let val (f, ss) = strip_comb s and (g, ts) = strip_comb t in
nipkow@16570
   654
    if forall (fn si => term_lpo f_ord (si, t) = LESS) ss
nipkow@16570
   655
    then case hd_ord f_ord (f, g) of
wenzelm@16667
   656
        GREATER =>
wenzelm@16667
   657
          if forall (fn ti => term_lpo f_ord (s, ti) = GREATER) ts
wenzelm@16667
   658
          then GREATER else LESS
nipkow@16570
   659
      | EQUAL =>
wenzelm@16667
   660
          if forall (fn ti => term_lpo f_ord (s, ti) = GREATER) ts
wenzelm@16667
   661
          then list_ord (term_lpo f_ord) (ss, ts)
wenzelm@16667
   662
          else LESS
nipkow@16570
   663
      | LESS => LESS
nipkow@16570
   664
    else GREATER
nipkow@16570
   665
  end
nipkow@16570
   666
and hd_ord f_ord (f, g) = case (f, g) of
nipkow@16570
   667
    (Abs (_, T, t), Abs (_, U, u)) =>
nipkow@16570
   668
      (case term_lpo f_ord (t, u) of EQUAL => typ_ord (T, U) | ord => ord)
nipkow@16570
   669
  | (_, _) => prod_ord (prod_ord int_ord
nipkow@16570
   670
                  (prod_ord indexname_ord typ_ord)) int_ord
nipkow@16570
   671
                (dest_hd f_ord f, dest_hd f_ord g)
nipkow@16570
   672
in
nipkow@16570
   673
val term_lpo = term_lpo
nipkow@16570
   674
end;
nipkow@16570
   675
wenzelm@16537
   676
clasohm@0
   677
(** Connectives of higher order logic **)
clasohm@0
   678
wenzelm@19394
   679
fun aT S = TFree ("'a", S);
wenzelm@19394
   680
wenzelm@375
   681
fun itselfT ty = Type ("itself", [ty]);
wenzelm@14854
   682
val a_itselfT = itselfT (TFree ("'a", []));
wenzelm@375
   683
clasohm@0
   684
val propT : typ = Type("prop",[]);
clasohm@0
   685
clasohm@0
   686
val implies = Const("==>", propT-->propT-->propT);
clasohm@0
   687
clasohm@0
   688
fun all T = Const("all", (T-->propT)-->propT);
clasohm@0
   689
clasohm@0
   690
fun equals T = Const("==", T-->T-->propT);
clasohm@0
   691
clasohm@0
   692
(* maps  !!x1...xn. t   to   t  *)
wenzelm@13000
   693
fun strip_all_body (Const("all",_)$Abs(_,_,t))  =  strip_all_body t
clasohm@0
   694
  | strip_all_body t  =  t;
clasohm@0
   695
clasohm@0
   696
(* maps  !!x1...xn. t   to   [x1, ..., xn]  *)
clasohm@0
   697
fun strip_all_vars (Const("all",_)$Abs(a,T,t))  =
wenzelm@13000
   698
                (a,T) :: strip_all_vars t
clasohm@0
   699
  | strip_all_vars t  =  [] : (string*typ) list;
clasohm@0
   700
clasohm@0
   701
(*increments a term's non-local bound variables
clasohm@0
   702
  required when moving a term within abstractions
clasohm@0
   703
     inc is  increment for bound variables
clasohm@0
   704
     lev is  level at which a bound variable is considered 'loose'*)
wenzelm@13000
   705
fun incr_bv (inc, lev, u as Bound i) = if i>=lev then Bound(i+inc) else u
clasohm@0
   706
  | incr_bv (inc, lev, Abs(a,T,body)) =
wenzelm@9536
   707
        Abs(a, T, incr_bv(inc,lev+1,body))
wenzelm@13000
   708
  | incr_bv (inc, lev, f$t) =
clasohm@0
   709
      incr_bv(inc,lev,f) $ incr_bv(inc,lev,t)
clasohm@0
   710
  | incr_bv (inc, lev, u) = u;
clasohm@0
   711
clasohm@0
   712
fun incr_boundvars  0  t = t
clasohm@0
   713
  | incr_boundvars inc t = incr_bv(inc,0,t);
clasohm@0
   714
wenzelm@12981
   715
(*Scan a pair of terms; while they are similar,
wenzelm@12981
   716
  accumulate corresponding bound vars in "al"*)
wenzelm@12981
   717
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) =
wenzelm@12981
   718
      match_bvs(s, t, if x="" orelse y="" then al
wenzelm@12981
   719
                                          else (x,y)::al)
wenzelm@12981
   720
  | match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al))
wenzelm@12981
   721
  | match_bvs(_,_,al) = al;
wenzelm@12981
   722
wenzelm@12981
   723
(* strip abstractions created by parameters *)
wenzelm@12981
   724
fun match_bvars((s,t),al) = match_bvs(strip_abs_body s, strip_abs_body t, al);
wenzelm@12981
   725
wenzelm@12981
   726
fun rename_abs pat obj t =
wenzelm@12981
   727
  let
wenzelm@12981
   728
    val ren = match_bvs (pat, obj, []);
wenzelm@12981
   729
    fun ren_abs (Abs (x, T, b)) =
wenzelm@18942
   730
          Abs (the_default x (AList.lookup (op =) ren x), T, ren_abs b)
wenzelm@12981
   731
      | ren_abs (f $ t) = ren_abs f $ ren_abs t
wenzelm@12981
   732
      | ren_abs t = t
skalberg@15531
   733
  in if null ren then NONE else SOME (ren_abs t) end;
clasohm@0
   734
clasohm@0
   735
(*Accumulate all 'loose' bound vars referring to level 'lev' or beyond.
clasohm@0
   736
   (Bound 0) is loose at level 0 *)
wenzelm@13000
   737
fun add_loose_bnos (Bound i, lev, js) =
wenzelm@9536
   738
        if i<lev then js  else  (i-lev) ins_int js
clasohm@0
   739
  | add_loose_bnos (Abs (_,_,t), lev, js) = add_loose_bnos (t, lev+1, js)
clasohm@0
   740
  | add_loose_bnos (f$t, lev, js) =
wenzelm@13000
   741
        add_loose_bnos (f, lev, add_loose_bnos (t, lev, js))
clasohm@0
   742
  | add_loose_bnos (_, _, js) = js;
clasohm@0
   743
clasohm@0
   744
fun loose_bnos t = add_loose_bnos (t, 0, []);
clasohm@0
   745
clasohm@0
   746
(* loose_bvar(t,k) iff t contains a 'loose' bound variable referring to
clasohm@0
   747
   level k or beyond. *)
clasohm@0
   748
fun loose_bvar(Bound i,k) = i >= k
clasohm@0
   749
  | loose_bvar(f$t, k) = loose_bvar(f,k) orelse loose_bvar(t,k)
clasohm@0
   750
  | loose_bvar(Abs(_,_,t),k) = loose_bvar(t,k+1)
clasohm@0
   751
  | loose_bvar _ = false;
clasohm@0
   752
nipkow@2792
   753
fun loose_bvar1(Bound i,k) = i = k
nipkow@2792
   754
  | loose_bvar1(f$t, k) = loose_bvar1(f,k) orelse loose_bvar1(t,k)
nipkow@2792
   755
  | loose_bvar1(Abs(_,_,t),k) = loose_bvar1(t,k+1)
nipkow@2792
   756
  | loose_bvar1 _ = false;
clasohm@0
   757
clasohm@0
   758
(*Substitute arguments for loose bound variables.
clasohm@0
   759
  Beta-reduction of arg(n-1)...arg0 into t replacing (Bound i) with (argi).
wenzelm@4626
   760
  Note that for ((%x y. c) a b), the bound vars in c are x=1 and y=0
wenzelm@9536
   761
        and the appropriate call is  subst_bounds([b,a], c) .
clasohm@0
   762
  Loose bound variables >=n are reduced by "n" to
clasohm@0
   763
     compensate for the disappearance of lambdas.
clasohm@0
   764
*)
wenzelm@13000
   765
fun subst_bounds (args: term list, t) : term =
wenzelm@19065
   766
  let
wenzelm@19065
   767
    exception SAME;
wenzelm@19065
   768
    val n = length args;
wenzelm@19065
   769
    fun subst (t as Bound i, lev) =
wenzelm@19065
   770
         (if i < lev then raise SAME   (*var is locally bound*)
wenzelm@19065
   771
          else incr_boundvars lev (List.nth (args, i - lev))
wenzelm@19065
   772
            handle Subscript => Bound (i - n))  (*loose: change it*)
wenzelm@19065
   773
      | subst (Abs (a, T, body), lev) = Abs (a, T, subst (body, lev + 1))
wenzelm@19065
   774
      | subst (f $ t, lev) =
wenzelm@19065
   775
          (subst (f, lev) $ (subst (t, lev) handle SAME => t) handle SAME => f $ subst (t, lev))
wenzelm@19065
   776
      | subst _ = raise SAME;
wenzelm@19065
   777
  in case args of [] => t | _ => (subst (t, 0) handle SAME => t) end;
clasohm@0
   778
paulson@2192
   779
(*Special case: one argument*)
wenzelm@13000
   780
fun subst_bound (arg, t) : term =
wenzelm@19065
   781
  let
wenzelm@19065
   782
    exception SAME;
wenzelm@19065
   783
    fun subst (Bound i, lev) =
wenzelm@19065
   784
          if i < lev then raise SAME   (*var is locally bound*)
wenzelm@19065
   785
          else if i = lev then incr_boundvars lev arg
wenzelm@19065
   786
          else Bound (i - 1)   (*loose: change it*)
wenzelm@19065
   787
      | subst (Abs (a, T, body), lev) = Abs (a, T, subst (body, lev + 1))
wenzelm@19065
   788
      | subst (f $ t, lev) =
wenzelm@19065
   789
          (subst (f, lev) $ (subst (t, lev) handle SAME => t) handle SAME => f $ subst (t, lev))
wenzelm@19065
   790
      | subst _ = raise SAME;
wenzelm@19065
   791
  in subst (t, 0) handle SAME => t end;
paulson@2192
   792
clasohm@0
   793
(*beta-reduce if possible, else form application*)
paulson@2192
   794
fun betapply (Abs(_,_,t), u) = subst_bound (u,t)
clasohm@0
   795
  | betapply (f,u) = f$u;
clasohm@0
   796
wenzelm@18183
   797
val betapplys = Library.foldl betapply;
wenzelm@18183
   798
wenzelm@14786
   799
haftmann@20109
   800
(*unfolding abstractions with substitution
haftmann@20109
   801
  of bound variables and implicit eta-expansion*)
haftmann@20109
   802
fun strip_abs_eta k t =
haftmann@20109
   803
  let
wenzelm@20122
   804
    val used = fold_aterms (fn Free (v, _) => Name.declare v | _ => I) t Name.context;
haftmann@20109
   805
    fun strip_abs t (0, used) = (([], t), (0, used))
haftmann@20109
   806
      | strip_abs (Abs (v, T, t)) (k, used) =
haftmann@20109
   807
          let
wenzelm@20122
   808
            val ([v'], used') = Name.variants [v] used;
haftmann@20109
   809
            val t' = subst_bound (Free (v, T), t);
wenzelm@20122
   810
            val ((vs, t''), (k', used'')) = strip_abs t' (k - 1, used');
wenzelm@20122
   811
          in (((v', T) :: vs, t''), (k', used'')) end
haftmann@20109
   812
      | strip_abs t (k, used) = (([], t), (k, used));
haftmann@20109
   813
    fun expand_eta [] t _ = ([], t)
haftmann@20109
   814
      | expand_eta (T::Ts) t used =
haftmann@20109
   815
          let
wenzelm@20122
   816
            val ([v], used') = Name.variants [""] used;
wenzelm@20122
   817
            val (vs, t') = expand_eta Ts (t $ Free (v, T)) used';
haftmann@20109
   818
          in ((v, T) :: vs, t') end;
haftmann@20109
   819
    val ((vs1, t'), (k', used')) = strip_abs t (k, used);
haftmann@20109
   820
    val Ts = (fst o chop k' o fst o strip_type o fastype_of) t';
haftmann@20109
   821
    val (vs2, t'') = expand_eta Ts t' used';
haftmann@20109
   822
  in (vs1 @ vs2, t'') end;
haftmann@20109
   823
haftmann@20109
   824
wenzelm@20199
   825
(* comparing variables *)
wenzelm@16882
   826
wenzelm@16724
   827
fun eq_ix ((x, i): indexname, (y, j)) = i = j andalso x = y;
paulson@2192
   828
wenzelm@16943
   829
fun eq_tvar ((xi, S: sort), (xi', S')) = eq_ix (xi, xi') andalso S = S';
wenzelm@16943
   830
fun eq_var ((xi, T: typ), (xi', T')) = eq_ix (xi, xi') andalso T = T';
wenzelm@16943
   831
wenzelm@16943
   832
val tvar_ord = prod_ord indexname_ord sort_ord;
wenzelm@16943
   833
val var_ord = prod_ord indexname_ord typ_ord;
wenzelm@16882
   834
wenzelm@16882
   835
wenzelm@13000
   836
(*A fast unification filter: true unless the two terms cannot be unified.
clasohm@0
   837
  Terms must be NORMAL.  Treats all Vars as distinct. *)
clasohm@0
   838
fun could_unify (t,u) =
clasohm@0
   839
  let fun matchrands (f$t, g$u) = could_unify(t,u) andalso  matchrands(f,g)
wenzelm@9536
   840
        | matchrands _ = true
clasohm@0
   841
  in case (head_of t , head_of u) of
wenzelm@9536
   842
        (_, Var _) => true
clasohm@0
   843
      | (Var _, _) => true
clasohm@0
   844
      | (Const(a,_), Const(b,_)) =>  a=b andalso matchrands(t,u)
clasohm@0
   845
      | (Free(a,_), Free(b,_)) =>  a=b andalso matchrands(t,u)
clasohm@0
   846
      | (Bound i, Bound j) =>  i=j andalso matchrands(t,u)
clasohm@0
   847
      | (Abs _, _) =>  true   (*because of possible eta equality*)
clasohm@0
   848
      | (_, Abs _) =>  true
clasohm@0
   849
      | _ => false
clasohm@0
   850
  end;
clasohm@0
   851
clasohm@0
   852
(*Substitute new for free occurrences of old in a term*)
clasohm@0
   853
fun subst_free [] = (fn t=>t)
clasohm@0
   854
  | subst_free pairs =
wenzelm@13000
   855
      let fun substf u =
haftmann@17314
   856
            case AList.lookup (op aconv) pairs u of
skalberg@15531
   857
                SOME u' => u'
skalberg@15531
   858
              | NONE => (case u of Abs(a,T,t) => Abs(a, T, substf t)
wenzelm@9536
   859
                                 | t$u' => substf t $ substf u'
wenzelm@9536
   860
                                 | _ => u)
clasohm@0
   861
      in  substf  end;
clasohm@0
   862
wenzelm@13000
   863
(*Abstraction of the term "body" over its occurrences of v,
clasohm@0
   864
    which must contain no loose bound variables.
clasohm@0
   865
  The resulting term is ready to become the body of an Abs.*)
wenzelm@16882
   866
fun abstract_over (v, body) =
wenzelm@16882
   867
  let
wenzelm@16990
   868
    exception SAME;
wenzelm@16990
   869
    fun abs lev tm =
wenzelm@16990
   870
      if v aconv tm then Bound lev
wenzelm@16882
   871
      else
wenzelm@16990
   872
        (case tm of
wenzelm@16990
   873
          Abs (a, T, t) => Abs (a, T, abs (lev + 1) t)
wenzelm@16990
   874
        | t $ u => (abs lev t $ (abs lev u handle SAME => u) handle SAME => t $ abs lev u)
wenzelm@16990
   875
        | _ => raise SAME);
wenzelm@16990
   876
  in abs 0 body handle SAME => body end;
clasohm@0
   877
wenzelm@18975
   878
fun lambda (v as Const (x, T)) t = Abs (NameSpace.base x, T, abstract_over (v, t))
wenzelm@18942
   879
  | lambda (v as Free (x, T)) t = Abs (x, T, abstract_over (v, t))
berghofe@13665
   880
  | lambda (v as Var ((x, _), T)) t = Abs (x, T, abstract_over (v, t))
berghofe@13665
   881
  | lambda v t = raise TERM ("lambda", [v, t]);
clasohm@0
   882
clasohm@0
   883
(*Form an abstraction over a free variable.*)
clasohm@0
   884
fun absfree (a,T,body) = Abs(a, T, abstract_over (Free(a,T), body));
wenzelm@17786
   885
fun absdummy (T, body) = Abs ("uu", T, body);
clasohm@0
   886
clasohm@0
   887
(*Abstraction over a list of free variables*)
clasohm@0
   888
fun list_abs_free ([ ] ,     t) = t
wenzelm@13000
   889
  | list_abs_free ((a,T)::vars, t) =
clasohm@0
   890
      absfree(a, T, list_abs_free(vars,t));
clasohm@0
   891
clasohm@0
   892
(*Quantification over a list of free variables*)
clasohm@0
   893
fun list_all_free ([], t: term) = t
wenzelm@13000
   894
  | list_all_free ((a,T)::vars, t) =
clasohm@0
   895
        (all T) $ (absfree(a, T, list_all_free(vars,t)));
clasohm@0
   896
clasohm@0
   897
(*Quantification over a list of variables (already bound in body) *)
clasohm@0
   898
fun list_all ([], t) = t
wenzelm@13000
   899
  | list_all ((a,T)::vars, t) =
clasohm@0
   900
        (all T) $ (Abs(a, T, list_all(vars,t)));
clasohm@0
   901
wenzelm@16678
   902
(*Replace the ATOMIC term ti by ui;    inst = [(t1,u1), ..., (tn,un)].
clasohm@0
   903
  A simultaneous substitution:  [ (a,b), (b,a) ] swaps a and b.  *)
wenzelm@16678
   904
fun subst_atomic [] tm = tm
wenzelm@16678
   905
  | subst_atomic inst tm =
wenzelm@16678
   906
      let
wenzelm@16678
   907
        fun subst (Abs (a, T, body)) = Abs (a, T, subst body)
wenzelm@16678
   908
          | subst (t $ u) = subst t $ subst u
wenzelm@18942
   909
          | subst t = the_default t (AList.lookup (op aconv) inst t);
wenzelm@16678
   910
      in subst tm end;
clasohm@0
   911
wenzelm@16678
   912
(*Replace the ATOMIC type Ti by Ui;    inst = [(T1,U1), ..., (Tn,Un)].*)
wenzelm@16678
   913
fun typ_subst_atomic [] ty = ty
wenzelm@16678
   914
  | typ_subst_atomic inst ty =
wenzelm@16678
   915
      let
wenzelm@16678
   916
        fun subst (Type (a, Ts)) = Type (a, map subst Ts)
wenzelm@18942
   917
          | subst T = the_default T (AList.lookup (op = : typ * typ -> bool) inst T);
wenzelm@16678
   918
      in subst ty end;
berghofe@15797
   919
wenzelm@16678
   920
fun subst_atomic_types [] tm = tm
wenzelm@16678
   921
  | subst_atomic_types inst tm = map_term_types (typ_subst_atomic inst) tm;
wenzelm@16678
   922
wenzelm@16678
   923
fun typ_subst_TVars [] ty = ty
wenzelm@16678
   924
  | typ_subst_TVars inst ty =
wenzelm@16678
   925
      let
wenzelm@16678
   926
        fun subst (Type (a, Ts)) = Type (a, map subst Ts)
wenzelm@18942
   927
          | subst (T as TVar (xi, _)) = the_default T (AList.lookup (op =) inst xi)
wenzelm@16678
   928
          | subst T = T;
wenzelm@16678
   929
      in subst ty end;
clasohm@0
   930
wenzelm@16678
   931
fun subst_TVars [] tm = tm
wenzelm@16678
   932
  | subst_TVars inst tm = map_term_types (typ_subst_TVars inst) tm;
clasohm@0
   933
wenzelm@16678
   934
fun subst_Vars [] tm = tm
wenzelm@16678
   935
  | subst_Vars inst tm =
wenzelm@16678
   936
      let
wenzelm@18942
   937
        fun subst (t as Var (xi, _)) = the_default t (AList.lookup (op =) inst xi)
wenzelm@16678
   938
          | subst (Abs (a, T, t)) = Abs (a, T, subst t)
wenzelm@16678
   939
          | subst (t $ u) = subst t $ subst u
wenzelm@16678
   940
          | subst t = t;
wenzelm@16678
   941
      in subst tm end;
clasohm@0
   942
wenzelm@16678
   943
fun subst_vars ([], []) tm = tm
wenzelm@16678
   944
  | subst_vars ([], inst) tm = subst_Vars inst tm
wenzelm@16678
   945
  | subst_vars (instT, inst) tm =
wenzelm@16678
   946
      let
wenzelm@16678
   947
        fun subst (Const (a, T)) = Const (a, typ_subst_TVars instT T)
wenzelm@16678
   948
          | subst (Free (a, T)) = Free (a, typ_subst_TVars instT T)
wenzelm@16678
   949
          | subst (t as Var (xi, T)) =
haftmann@17271
   950
              (case AList.lookup (op =) inst xi of
wenzelm@16678
   951
                NONE => Var (xi, typ_subst_TVars instT T)
wenzelm@16678
   952
              | SOME t => t)
wenzelm@16678
   953
          | subst (t as Bound _) = t
wenzelm@16678
   954
          | subst (Abs (a, T, t)) = Abs (a, typ_subst_TVars instT T, subst t)
wenzelm@16678
   955
          | subst (t $ u) = subst t $ subst u;
wenzelm@16678
   956
      in subst tm end;
clasohm@0
   957
clasohm@0
   958
wenzelm@19909
   959
(* generalization of fixed variables *)
wenzelm@19909
   960
wenzelm@19909
   961
local exception SAME in
wenzelm@19909
   962
wenzelm@19909
   963
fun generalizeT_same [] _ _ = raise SAME
wenzelm@19909
   964
  | generalizeT_same tfrees idx ty =
wenzelm@19909
   965
      let
wenzelm@19909
   966
        fun gen_typ (Type (a, Ts)) = Type (a, gen_typs Ts)
wenzelm@19909
   967
          | gen_typ (TFree (a, S)) =
wenzelm@19909
   968
              if member (op =) tfrees a then TVar ((a, idx), S)
wenzelm@19909
   969
              else raise SAME
wenzelm@19909
   970
          | gen_typ _ = raise SAME
wenzelm@19909
   971
        and gen_typs (T :: Ts) =
wenzelm@19909
   972
            (gen_typ T :: (gen_typs Ts handle SAME => Ts)
wenzelm@19909
   973
              handle SAME => T :: gen_typs Ts)
wenzelm@19909
   974
          | gen_typs [] = raise SAME;
wenzelm@19909
   975
      in gen_typ ty end;
wenzelm@19909
   976
wenzelm@20001
   977
fun generalize_same ([], []) _ _ = raise SAME
wenzelm@20001
   978
  | generalize_same (tfrees, frees) idx tm =
wenzelm@19909
   979
      let
wenzelm@19909
   980
        val genT = generalizeT_same tfrees idx;
wenzelm@19909
   981
        fun gen (Free (x, T)) =
wenzelm@20082
   982
              if member (op =) frees x then
wenzelm@20082
   983
                Var (Name.clean_index (x, idx), genT T handle SAME => T)
wenzelm@19909
   984
              else Free (x, genT T)
wenzelm@19909
   985
          | gen (Var (xi, T)) = Var (xi, genT T)
wenzelm@19909
   986
          | gen (Const (c, T)) = Const (c, genT T)
wenzelm@19909
   987
          | gen (Bound _) = raise SAME
wenzelm@19909
   988
          | gen (Abs (x, T, t)) =
wenzelm@19909
   989
              (Abs (x, genT T, gen t handle SAME => t)
wenzelm@19909
   990
                handle SAME => Abs (x, T, gen t))
wenzelm@19909
   991
          | gen (t $ u) = (gen t $ (gen u handle SAME => u) handle SAME => t $ gen u);
wenzelm@20001
   992
      in gen tm end;
wenzelm@19909
   993
wenzelm@20001
   994
fun generalize names i tm = generalize_same names i tm handle SAME => tm;
wenzelm@20001
   995
fun generalizeT names i ty = generalizeT_same names i ty handle SAME => ty;
wenzelm@20001
   996
wenzelm@20001
   997
fun generalize_option names i tm = SOME (generalize_same names i tm) handle SAME => NONE;
wenzelm@20001
   998
fun generalizeT_option names i ty = SOME (generalizeT_same names i ty) handle SAME => NONE;
wenzelm@19909
   999
wenzelm@19909
  1000
end;
wenzelm@19909
  1001
wenzelm@19909
  1002
wenzelm@16943
  1003
(* instantiation of schematic variables (types before terms) *)
wenzelm@16882
  1004
wenzelm@16882
  1005
local exception SAME in
wenzelm@16882
  1006
wenzelm@16943
  1007
fun instantiateT_same [] _ = raise SAME
wenzelm@16943
  1008
  | instantiateT_same instT ty =
wenzelm@16882
  1009
      let
wenzelm@16882
  1010
        fun subst_typ (Type (a, Ts)) = Type (a, subst_typs Ts)
wenzelm@16882
  1011
          | subst_typ (TVar v) =
haftmann@17314
  1012
              (case AList.lookup eq_tvar instT v of
wenzelm@16882
  1013
                SOME T => T
wenzelm@16882
  1014
              | NONE => raise SAME)
wenzelm@16882
  1015
          | subst_typ _ = raise SAME
wenzelm@16882
  1016
        and subst_typs (T :: Ts) =
wenzelm@16882
  1017
            (subst_typ T :: (subst_typs Ts handle SAME => Ts)
wenzelm@16882
  1018
              handle SAME => T :: subst_typs Ts)
wenzelm@16882
  1019
          | subst_typs [] = raise SAME;
wenzelm@16882
  1020
      in subst_typ ty end;
wenzelm@16882
  1021
wenzelm@20001
  1022
fun instantiate_same ([], []) _ = raise SAME
wenzelm@20001
  1023
  | instantiate_same (instT, inst) tm =
wenzelm@16882
  1024
      let
wenzelm@16943
  1025
        val substT = instantiateT_same instT;
wenzelm@16943
  1026
        fun subst (Const (c, T)) = Const (c, substT T)
wenzelm@16943
  1027
          | subst (Free (x, T)) = Free (x, substT T)
wenzelm@16882
  1028
          | subst (Var (xi, T)) =
wenzelm@16943
  1029
              let val (T', same) = (substT T, false) handle SAME => (T, true) in
haftmann@17314
  1030
                (case AList.lookup eq_var inst (xi, T') of
wenzelm@16882
  1031
                   SOME t => t
wenzelm@16882
  1032
                 | NONE => if same then raise SAME else Var (xi, T'))
wenzelm@16882
  1033
              end
wenzelm@16882
  1034
          | subst (Bound _) = raise SAME
wenzelm@16882
  1035
          | subst (Abs (x, T, t)) =
wenzelm@16943
  1036
              (Abs (x, substT T, subst t handle SAME => t)
wenzelm@16882
  1037
                handle SAME => Abs (x, T, subst t))
wenzelm@16882
  1038
          | subst (t $ u) = (subst t $ (subst u handle SAME => u) handle SAME => t $ subst u);
wenzelm@20001
  1039
      in subst tm end;
wenzelm@16882
  1040
wenzelm@20001
  1041
fun instantiate insts tm = instantiate_same insts tm handle SAME => tm;
wenzelm@20001
  1042
fun instantiateT insts ty = instantiateT_same insts ty handle SAME => ty;
wenzelm@20001
  1043
wenzelm@20001
  1044
fun instantiate_option insts tm = SOME (instantiate_same insts tm) handle SAME => NONE;
wenzelm@20001
  1045
fun instantiateT_option insts ty = SOME (instantiateT_same insts ty) handle SAME => NONE;
wenzelm@16882
  1046
wenzelm@16882
  1047
end;
wenzelm@16882
  1048
wenzelm@16882
  1049
paulson@15573
  1050
(** Identifying first-order terms **)
paulson@15573
  1051
wenzelm@20199
  1052
(*Differs from proofterm/is_fun in its treatment of TVar*)
wenzelm@20199
  1053
fun is_funtype (Type("fun",[_,_])) = true
wenzelm@20199
  1054
  | is_funtype _ = false;
wenzelm@20199
  1055
paulson@15573
  1056
(*Argument Ts is a reverse list of binder types, needed if term t contains Bound vars*)
paulson@15573
  1057
fun has_not_funtype Ts t = not (is_funtype (fastype_of1 (Ts,t)));
paulson@15573
  1058
wenzelm@16537
  1059
(*First order means in all terms of the form f(t1,...,tn) no argument has a
paulson@16589
  1060
  function type. The supplied quantifiers are excluded: their argument always
paulson@16589
  1061
  has a function type through a recursive call into its body.*)
wenzelm@16667
  1062
fun is_first_order quants =
paulson@16589
  1063
  let fun first_order1 Ts (Abs (_,T,body)) = first_order1 (T::Ts) body
wenzelm@16667
  1064
        | first_order1 Ts (Const(q,_) $ Abs(a,T,body)) =
wenzelm@16667
  1065
            q mem_string quants  andalso   (*it is a known quantifier*)
paulson@16589
  1066
            not (is_funtype T)   andalso first_order1 (T::Ts) body
wenzelm@16667
  1067
        | first_order1 Ts t =
wenzelm@16667
  1068
            case strip_comb t of
wenzelm@16667
  1069
                 (Var _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
wenzelm@16667
  1070
               | (Free _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
wenzelm@16667
  1071
               | (Const _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
wenzelm@16667
  1072
               | (Bound _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
wenzelm@16667
  1073
               | (Abs _, ts) => false (*not in beta-normal form*)
wenzelm@16667
  1074
               | _ => error "first_order: unexpected case"
paulson@16589
  1075
    in  first_order1 []  end;
paulson@15573
  1076
wenzelm@16710
  1077
wenzelm@16990
  1078
(* maximum index of typs and terms *)
clasohm@0
  1079
wenzelm@16710
  1080
fun maxidx_typ (TVar ((_, j), _)) i = Int.max (i, j)
wenzelm@16710
  1081
  | maxidx_typ (Type (_, Ts)) i = maxidx_typs Ts i
wenzelm@16710
  1082
  | maxidx_typ (TFree _) i = i
wenzelm@16710
  1083
and maxidx_typs [] i = i
wenzelm@16710
  1084
  | maxidx_typs (T :: Ts) i = maxidx_typs Ts (maxidx_typ T i);
clasohm@0
  1085
wenzelm@16710
  1086
fun maxidx_term (Var ((_, j), T)) i = maxidx_typ T (Int.max (i, j))
wenzelm@16710
  1087
  | maxidx_term (Const (_, T)) i = maxidx_typ T i
wenzelm@16710
  1088
  | maxidx_term (Free (_, T)) i = maxidx_typ T i
wenzelm@16710
  1089
  | maxidx_term (Bound _) i = i
wenzelm@16710
  1090
  | maxidx_term (Abs (_, T, t)) i = maxidx_term t (maxidx_typ T i)
wenzelm@16710
  1091
  | maxidx_term (t $ u) i = maxidx_term u (maxidx_term t i);
clasohm@0
  1092
wenzelm@16710
  1093
fun maxidx_of_typ T = maxidx_typ T ~1;
wenzelm@16710
  1094
fun maxidx_of_typs Ts = maxidx_typs Ts ~1;
wenzelm@16710
  1095
fun maxidx_of_term t = maxidx_term t ~1;
berghofe@13665
  1096
clasohm@0
  1097
clasohm@0
  1098
clasohm@0
  1099
(**** Syntax-related declarations ****)
clasohm@0
  1100
wenzelm@19909
  1101
(* substructure *)
wenzelm@4017
  1102
wenzelm@19909
  1103
fun exists_subtype P =
wenzelm@19909
  1104
  let
wenzelm@19909
  1105
    fun ex ty = P ty orelse
wenzelm@19909
  1106
      (case ty of Type (_, Ts) => exists ex Ts | _ => false);
wenzelm@19909
  1107
  in ex end;
nipkow@13646
  1108
wenzelm@16943
  1109
fun exists_subterm P =
wenzelm@16943
  1110
  let
wenzelm@16943
  1111
    fun ex tm = P tm orelse
wenzelm@16943
  1112
      (case tm of
wenzelm@16943
  1113
        t $ u => ex t orelse ex u
wenzelm@16943
  1114
      | Abs (_, _, t) => ex t
wenzelm@16943
  1115
      | _ => false);
wenzelm@16943
  1116
  in ex end;
obua@16108
  1117
wenzelm@19909
  1118
wenzelm@19909
  1119
(** Consts etc. **)
wenzelm@19909
  1120
wenzelm@19909
  1121
fun add_term_consts (Const (c, _), cs) = insert (op =) c cs
wenzelm@19909
  1122
  | add_term_consts (t $ u, cs) = add_term_consts (t, add_term_consts (u, cs))
wenzelm@19909
  1123
  | add_term_consts (Abs (_, _, t), cs) = add_term_consts (t, cs)
wenzelm@19909
  1124
  | add_term_consts (_, cs) = cs;
wenzelm@19909
  1125
wenzelm@19909
  1126
fun term_consts t = add_term_consts(t,[]);
wenzelm@19909
  1127
wenzelm@16943
  1128
fun exists_Const P = exists_subterm (fn Const c => P c | _ => false);
nipkow@4631
  1129
wenzelm@4017
  1130
clasohm@0
  1131
(** TFrees and TVars **)
clasohm@0
  1132
wenzelm@12802
  1133
(*Accumulates the names of Frees in the term, suppressing duplicates.*)
wenzelm@12802
  1134
fun add_term_free_names (Free(a,_), bs) = a ins_string bs
wenzelm@12802
  1135
  | add_term_free_names (f$u, bs) = add_term_free_names (f, add_term_free_names(u, bs))
wenzelm@12802
  1136
  | add_term_free_names (Abs(_,_,t), bs) = add_term_free_names(t,bs)
wenzelm@12802
  1137
  | add_term_free_names (_, bs) = bs;
wenzelm@12802
  1138
clasohm@0
  1139
(*Accumulates the names in the term, suppressing duplicates.
clasohm@0
  1140
  Includes Frees and Consts.  For choosing unambiguous bound var names.*)
wenzelm@10666
  1141
fun add_term_names (Const(a,_), bs) = NameSpace.base a ins_string bs
paulson@2176
  1142
  | add_term_names (Free(a,_), bs) = a ins_string bs
clasohm@0
  1143
  | add_term_names (f$u, bs) = add_term_names (f, add_term_names(u, bs))
clasohm@0
  1144
  | add_term_names (Abs(_,_,t), bs) = add_term_names(t,bs)
clasohm@0
  1145
  | add_term_names (_, bs) = bs;
clasohm@0
  1146
clasohm@0
  1147
(*Accumulates the TVars in a type, suppressing duplicates. *)
skalberg@15574
  1148
fun add_typ_tvars(Type(_,Ts),vs) = foldr add_typ_tvars vs Ts
clasohm@0
  1149
  | add_typ_tvars(TFree(_),vs) = vs
wenzelm@16294
  1150
  | add_typ_tvars(TVar(v),vs) = insert (op =) v vs;
clasohm@0
  1151
clasohm@0
  1152
(*Accumulates the TFrees in a type, suppressing duplicates. *)
skalberg@15574
  1153
fun add_typ_tfree_names(Type(_,Ts),fs) = foldr add_typ_tfree_names fs Ts
paulson@2176
  1154
  | add_typ_tfree_names(TFree(f,_),fs) = f ins_string fs
clasohm@0
  1155
  | add_typ_tfree_names(TVar(_),fs) = fs;
clasohm@0
  1156
skalberg@15574
  1157
fun add_typ_tfrees(Type(_,Ts),fs) = foldr add_typ_tfrees fs Ts
wenzelm@16294
  1158
  | add_typ_tfrees(TFree(f),fs) = insert (op =) f fs
clasohm@0
  1159
  | add_typ_tfrees(TVar(_),fs) = fs;
clasohm@0
  1160
skalberg@15574
  1161
fun add_typ_varnames(Type(_,Ts),nms) = foldr add_typ_varnames nms Ts
paulson@2176
  1162
  | add_typ_varnames(TFree(nm,_),nms) = nm ins_string nms
paulson@2176
  1163
  | add_typ_varnames(TVar((nm,_),_),nms) = nm ins_string nms;
nipkow@949
  1164
clasohm@0
  1165
(*Accumulates the TVars in a term, suppressing duplicates. *)
clasohm@0
  1166
val add_term_tvars = it_term_types add_typ_tvars;
clasohm@0
  1167
clasohm@0
  1168
(*Accumulates the TFrees in a term, suppressing duplicates. *)
clasohm@0
  1169
val add_term_tfrees = it_term_types add_typ_tfrees;
clasohm@0
  1170
val add_term_tfree_names = it_term_types add_typ_tfree_names;
clasohm@0
  1171
nipkow@949
  1172
val add_term_tvarnames = it_term_types add_typ_varnames;
nipkow@949
  1173
clasohm@0
  1174
(*Non-list versions*)
clasohm@0
  1175
fun typ_tfrees T = add_typ_tfrees(T,[]);
clasohm@0
  1176
fun typ_tvars T = add_typ_tvars(T,[]);
clasohm@0
  1177
fun term_tfrees t = add_term_tfrees(t,[]);
clasohm@0
  1178
fun term_tvars t = add_term_tvars(t,[]);
clasohm@0
  1179
nipkow@949
  1180
(*special code to enforce left-to-right collection of TVar-indexnames*)
nipkow@949
  1181
skalberg@15570
  1182
fun add_typ_ixns(ixns,Type(_,Ts)) = Library.foldl add_typ_ixns (ixns,Ts)
wenzelm@20082
  1183
  | add_typ_ixns(ixns,TVar(ixn,_)) = if member (op =) ixns ixn then ixns
wenzelm@9536
  1184
                                     else ixns@[ixn]
nipkow@949
  1185
  | add_typ_ixns(ixns,TFree(_)) = ixns;
nipkow@949
  1186
nipkow@949
  1187
fun add_term_tvar_ixns(Const(_,T),ixns) = add_typ_ixns(ixns,T)
nipkow@949
  1188
  | add_term_tvar_ixns(Free(_,T),ixns) = add_typ_ixns(ixns,T)
nipkow@949
  1189
  | add_term_tvar_ixns(Var(_,T),ixns) = add_typ_ixns(ixns,T)
nipkow@949
  1190
  | add_term_tvar_ixns(Bound _,ixns) = ixns
nipkow@949
  1191
  | add_term_tvar_ixns(Abs(_,T,t),ixns) =
nipkow@949
  1192
      add_term_tvar_ixns(t,add_typ_ixns(ixns,T))
nipkow@949
  1193
  | add_term_tvar_ixns(f$t,ixns) =
nipkow@949
  1194
      add_term_tvar_ixns(t,add_term_tvar_ixns(f,ixns));
nipkow@949
  1195
wenzelm@16537
  1196
clasohm@0
  1197
(** Frees and Vars **)
clasohm@0
  1198
clasohm@0
  1199
(*Accumulates the Vars in the term, suppressing duplicates*)
clasohm@0
  1200
fun add_term_vars (t, vars: term list) = case t of
wenzelm@16990
  1201
    Var   _ => OrdList.insert term_ord t vars
clasohm@0
  1202
  | Abs (_,_,body) => add_term_vars(body,vars)
clasohm@0
  1203
  | f$t =>  add_term_vars (f, add_term_vars(t, vars))
clasohm@0
  1204
  | _ => vars;
clasohm@0
  1205
clasohm@0
  1206
fun term_vars t = add_term_vars(t,[]);
clasohm@0
  1207
clasohm@0
  1208
(*Accumulates the Frees in the term, suppressing duplicates*)
clasohm@0
  1209
fun add_term_frees (t, frees: term list) = case t of
wenzelm@16990
  1210
    Free   _ => OrdList.insert term_ord t frees
clasohm@0
  1211
  | Abs (_,_,body) => add_term_frees(body,frees)
clasohm@0
  1212
  | f$t =>  add_term_frees (f, add_term_frees(t, frees))
clasohm@0
  1213
  | _ => frees;
clasohm@0
  1214
clasohm@0
  1215
fun term_frees t = add_term_frees(t,[]);
clasohm@0
  1216
wenzelm@20199
  1217
wenzelm@20199
  1218
(* dest abstraction *)
clasohm@0
  1219
wenzelm@16678
  1220
fun dest_abs (x, T, body) =
wenzelm@16678
  1221
  let
wenzelm@16678
  1222
    fun name_clash (Free (y, _)) = (x = y)
wenzelm@16678
  1223
      | name_clash (t $ u) = name_clash t orelse name_clash u
wenzelm@16678
  1224
      | name_clash (Abs (_, _, t)) = name_clash t
wenzelm@16678
  1225
      | name_clash _ = false;
wenzelm@16678
  1226
  in
wenzelm@16678
  1227
    if name_clash body then
wenzelm@20082
  1228
      dest_abs (Name.variant [x] x, T, body)    (*potentially slow, but rarely happens*)
wenzelm@16678
  1229
    else (x, subst_bound (Free (x, T), body))
wenzelm@16678
  1230
  end;
wenzelm@16678
  1231
wenzelm@20160
  1232
wenzelm@20160
  1233
(* renaming variables *)
clasohm@0
  1234
wenzelm@20239
  1235
fun declare_term_names tm =
wenzelm@20239
  1236
  fold_aterms
wenzelm@20239
  1237
    (fn Const (a, _) => Name.declare (NameSpace.base a)
wenzelm@20239
  1238
      | Free (a, _) => Name.declare a
wenzelm@20239
  1239
      | _ => I) tm #>
wenzelm@20239
  1240
  fold_types (fold_atyps (fn TFree (a, _) => Name.declare a | _ => I)) tm;
wenzelm@20239
  1241
wenzelm@20160
  1242
fun variant_frees t frees =
wenzelm@20160
  1243
  fst (Name.variants (map fst frees) (declare_term_names t Name.context)) ~~ map snd frees;
wenzelm@20160
  1244
wenzelm@20160
  1245
fun rename_wrt_term t frees = rev (variant_frees t frees);  (*reversed result!*)
clasohm@1364
  1246
paulson@1417
  1247
wenzelm@16943
  1248
(* zero var indexes *)
wenzelm@4286
  1249
wenzelm@16943
  1250
fun zero_var_inst vars =
wenzelm@20239
  1251
  fold (fn v as ((x, i), X) => fn (inst, used) =>
wenzelm@16943
  1252
    let
wenzelm@20100
  1253
      val ([x'], used') = Name.variants [if Name.is_bound x then "u" else x] used;
wenzelm@20239
  1254
    in if x = x' andalso i = 0 then (inst, used') else ((v, ((x', 0), X)) :: inst, used') end)
wenzelm@20239
  1255
  vars ([], Name.context) |> #1;
haftmann@16790
  1256
wenzelm@16943
  1257
fun zero_var_indexes_inst tm =
wenzelm@16943
  1258
  let
wenzelm@20239
  1259
    val instT = zero_var_inst (sort tvar_ord (add_tvars tm [])) |> map (apsnd TVar);
wenzelm@20239
  1260
    val inst = zero_var_inst (sort var_ord (map (apsnd (instantiateT instT)) (add_vars tm [])))
wenzelm@20239
  1261
      |> map (apsnd Var);
wenzelm@16943
  1262
  in (instT, inst) end;
wenzelm@12499
  1263
wenzelm@16943
  1264
fun zero_var_indexes tm = instantiate (zero_var_indexes_inst tm) tm;
wenzelm@4286
  1265
paulson@1417
  1266
wenzelm@9536
  1267
(* dummy patterns *)
wenzelm@9536
  1268
wenzelm@9536
  1269
val dummy_patternN = "dummy_pattern";
wenzelm@9536
  1270
wenzelm@18253
  1271
fun dummy_pattern T = Const (dummy_patternN, T);
wenzelm@18253
  1272
wenzelm@9536
  1273
fun is_dummy_pattern (Const ("dummy_pattern", _)) = true
wenzelm@9536
  1274
  | is_dummy_pattern _ = false;
wenzelm@9536
  1275
wenzelm@9536
  1276
fun no_dummy_patterns tm =
haftmann@16787
  1277
  if not (fold_aterms (fn t => fn b => b orelse is_dummy_pattern t) tm false) then tm
wenzelm@9536
  1278
  else raise TERM ("Illegal occurrence of '_' dummy pattern", [tm]);
wenzelm@9536
  1279
wenzelm@11903
  1280
fun replace_dummy Ts (i, Const ("dummy_pattern", T)) =
wenzelm@11903
  1281
      (i + 1, list_comb (Var (("_dummy_", i), Ts ---> T), map Bound (0 upto length Ts - 1)))
wenzelm@11903
  1282
  | replace_dummy Ts (i, Abs (x, T, t)) =
wenzelm@11903
  1283
      let val (i', t') = replace_dummy (T :: Ts) (i, t)
wenzelm@11903
  1284
      in (i', Abs (x, T, t')) end
wenzelm@11903
  1285
  | replace_dummy Ts (i, t $ u) =
wenzelm@11903
  1286
      let val (i', t') = replace_dummy Ts (i, t); val (i'', u') = replace_dummy Ts (i', u)
wenzelm@11903
  1287
      in (i'', t' $ u') end
wenzelm@11903
  1288
  | replace_dummy _ (i, a) = (i, a);
wenzelm@11903
  1289
wenzelm@11903
  1290
val replace_dummy_patterns = replace_dummy [];
wenzelm@9536
  1291
wenzelm@10552
  1292
fun is_replaced_dummy_pattern ("_dummy_", _) = true
wenzelm@10552
  1293
  | is_replaced_dummy_pattern _ = false;
wenzelm@9536
  1294
wenzelm@16035
  1295
fun show_dummy_patterns (Var (("_dummy_", _), T)) = Const ("dummy_pattern", T)
wenzelm@16035
  1296
  | show_dummy_patterns (t $ u) = show_dummy_patterns t $ show_dummy_patterns u
wenzelm@16035
  1297
  | show_dummy_patterns (Abs (x, T, t)) = Abs (x, T, show_dummy_patterns t)
wenzelm@16035
  1298
  | show_dummy_patterns a = a;
wenzelm@16035
  1299
wenzelm@13484
  1300
wenzelm@20100
  1301
(* display variables *)
wenzelm@20100
  1302
wenzelm@15986
  1303
val show_question_marks = ref true;
berghofe@15472
  1304
wenzelm@14786
  1305
fun string_of_vname (x, i) =
wenzelm@14786
  1306
  let
wenzelm@15986
  1307
    val question_mark = if ! show_question_marks then "?" else "";
wenzelm@15986
  1308
    val idx = string_of_int i;
wenzelm@15986
  1309
    val dot =
wenzelm@15986
  1310
      (case rev (Symbol.explode x) of
wenzelm@15986
  1311
        _ :: "\\<^isub>" :: _ => false
wenzelm@15986
  1312
      | _ :: "\\<^isup>" :: _ => false
wenzelm@15986
  1313
      | c :: _ => Symbol.is_digit c
wenzelm@15986
  1314
      | _ => true);
wenzelm@14786
  1315
  in
wenzelm@15986
  1316
    if dot then question_mark ^ x ^ "." ^ idx
wenzelm@15986
  1317
    else if i <> 0 then question_mark ^ x ^ idx
wenzelm@15986
  1318
    else question_mark ^ x
wenzelm@14786
  1319
  end;
wenzelm@14786
  1320
wenzelm@14786
  1321
fun string_of_vname' (x, ~1) = x
wenzelm@14786
  1322
  | string_of_vname' xi = string_of_vname xi;
wenzelm@14786
  1323
clasohm@1364
  1324
end;
clasohm@1364
  1325
wenzelm@4444
  1326
structure BasicTerm: BASIC_TERM = Term;
wenzelm@4444
  1327
open BasicTerm;