src/Pure/term.ML
author paulson
Tue Jun 28 15:28:30 2005 +0200 (2005-06-28)
changeset 16589 24c32abc8b84
parent 16570 861b9fa2c98c
child 16599 34f99c3221bb
permissions -rw-r--r--
first-order check now allows quantifiers
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@16537
    30
    op $ of term * term
wenzelm@16537
    31
  exception TYPE of string * typ list * term list
wenzelm@16537
    32
  exception TERM of string * term list
wenzelm@4444
    33
  val --> : typ * typ -> typ
wenzelm@4444
    34
  val ---> : typ list * typ -> typ
wenzelm@4444
    35
  val is_TVar: typ -> bool
paulson@15573
    36
  val is_funtype: typ -> bool
wenzelm@4444
    37
  val domain_type: typ -> typ
wenzelm@4480
    38
  val range_type: typ -> typ
wenzelm@4444
    39
  val binder_types: typ -> typ list
wenzelm@4444
    40
  val body_type: typ -> typ
wenzelm@4444
    41
  val strip_type: typ -> typ list * typ
nipkow@7318
    42
  val is_Bound: term -> bool
wenzelm@4444
    43
  val is_Const: term -> bool
wenzelm@4444
    44
  val is_Free: term -> bool
wenzelm@4444
    45
  val is_Var: term -> bool
paulson@16589
    46
  val is_first_order: string list -> term -> bool
paulson@6033
    47
  val dest_Type: typ -> string * typ list
dixon@15914
    48
  val dest_TVar: typ -> indexname * sort
dixon@15914
    49
  val dest_TFree: typ -> string * sort
wenzelm@4444
    50
  val dest_Const: term -> string * typ
wenzelm@4444
    51
  val dest_Free: term -> string * typ
wenzelm@4444
    52
  val dest_Var: term -> indexname * typ
wenzelm@4444
    53
  val type_of: term -> typ
wenzelm@4444
    54
  val type_of1: typ list * term -> typ
wenzelm@4444
    55
  val fastype_of: term -> typ
wenzelm@4444
    56
  val fastype_of1: typ list * term -> typ
wenzelm@10806
    57
  val list_abs: (string * typ) list * term -> term
wenzelm@4444
    58
  val strip_abs_body: term -> term
wenzelm@4444
    59
  val strip_abs_vars: term -> (string * typ) list
wenzelm@4444
    60
  val strip_qnt_body: string -> term -> term
wenzelm@4444
    61
  val strip_qnt_vars: string -> term -> (string * typ) list
wenzelm@4444
    62
  val list_comb: term * term list -> term
wenzelm@4444
    63
  val strip_comb: term -> term * term list
wenzelm@4444
    64
  val head_of: term -> term
wenzelm@4444
    65
  val size_of_term: term -> int
wenzelm@4444
    66
  val map_type_tvar: (indexname * sort -> typ) -> typ -> typ
wenzelm@4444
    67
  val map_type_tfree: (string * sort -> typ) -> typ -> typ
wenzelm@4444
    68
  val map_term_types: (typ -> typ) -> term -> term
wenzelm@4444
    69
  val it_term_types: (typ * 'a -> 'a) -> term * 'a -> 'a
wenzelm@16537
    70
  structure Vartab: TABLE
wenzelm@16537
    71
  structure Typtab: TABLE
wenzelm@16537
    72
  structure Termtab: TABLE
wenzelm@16537
    73
  val aconv: term * term -> bool
wenzelm@16537
    74
  val aconvs: term list * term list -> bool
wenzelm@4444
    75
  val foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a
wenzelm@8609
    76
  val foldl_term_types: (term -> 'a * typ -> 'a) -> 'a * term -> 'a
wenzelm@4444
    77
  val foldl_types: ('a * typ -> 'a) -> 'a * term -> 'a
wenzelm@4444
    78
  val foldl_aterms: ('a * term -> 'a) -> 'a * term -> 'a
wenzelm@6548
    79
  val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term
wenzelm@15025
    80
  val add_term_varnames: indexname list * term -> indexname list
wenzelm@15025
    81
  val term_varnames: term -> indexname list
wenzelm@4444
    82
  val dummyT: typ
wenzelm@4444
    83
  val itselfT: typ -> typ
wenzelm@4444
    84
  val a_itselfT: typ
wenzelm@4444
    85
  val propT: typ
wenzelm@4444
    86
  val implies: term
wenzelm@4444
    87
  val all: typ -> term
wenzelm@4444
    88
  val equals: typ -> term
wenzelm@4444
    89
  val strip_all_body: term -> term
wenzelm@4444
    90
  val strip_all_vars: term -> (string * typ) list
wenzelm@4444
    91
  val incr_bv: int * int * term -> term
wenzelm@4444
    92
  val incr_boundvars: int -> term -> term
wenzelm@4444
    93
  val add_loose_bnos: term * int * int list -> int list
wenzelm@4444
    94
  val loose_bnos: term -> int list
wenzelm@4444
    95
  val loose_bvar: term * int -> bool
wenzelm@4444
    96
  val loose_bvar1: term * int -> bool
wenzelm@4444
    97
  val subst_bounds: term list * term -> term
wenzelm@4444
    98
  val subst_bound: term * term -> term
wenzelm@4444
    99
  val subst_TVars: (indexname * typ) list -> term -> term
wenzelm@4444
   100
  val betapply: term * term -> term
wenzelm@4444
   101
  val eq_ix: indexname * indexname -> bool
wenzelm@4444
   102
  val ins_ix: indexname * indexname list -> indexname list
wenzelm@4444
   103
  val mem_ix: indexname * indexname list -> bool
wenzelm@4444
   104
  val mem_term: term * term list -> bool
wenzelm@4444
   105
  val subset_term: term list * term list -> bool
wenzelm@4444
   106
  val eq_set_term: term list * term list -> bool
wenzelm@4444
   107
  val ins_term: term * term list -> term list
wenzelm@4444
   108
  val union_term: term list * term list -> term list
paulson@5585
   109
  val inter_term: term list * term list -> term list
wenzelm@4444
   110
  val could_unify: term * term -> bool
wenzelm@4444
   111
  val subst_free: (term * term) list -> term -> term
wenzelm@4444
   112
  val subst_atomic: (term * term) list -> term -> term
berghofe@15797
   113
  val typ_subst_atomic: (typ * typ) list -> typ -> typ
wenzelm@4444
   114
  val subst_vars: (indexname * typ) list * (indexname * term) list -> term -> term
wenzelm@4444
   115
  val typ_subst_TVars: (indexname * typ) list -> typ -> typ
wenzelm@4444
   116
  val subst_Vars: (indexname * term) list -> term -> term
wenzelm@4444
   117
  val incr_tvar: int -> typ -> typ
wenzelm@4444
   118
  val xless: (string * int) * indexname -> bool
wenzelm@4444
   119
  val atless: term * term -> bool
wenzelm@4444
   120
  val insert_aterm: term * term list -> term list
wenzelm@4444
   121
  val abstract_over: term * term -> term
wenzelm@11922
   122
  val lambda: term -> term -> term
wenzelm@4444
   123
  val absfree: string * typ * term -> term
wenzelm@4444
   124
  val list_abs_free: (string * typ) list * term -> term
wenzelm@4444
   125
  val list_all_free: (string * typ) list * term -> term
wenzelm@4444
   126
  val list_all: (string * typ) list * term -> term
wenzelm@4444
   127
  val maxidx_of_typ: typ -> int
wenzelm@4444
   128
  val maxidx_of_typs: typ list -> int
wenzelm@4444
   129
  val maxidx_of_term: term -> int
berghofe@13665
   130
  val maxidx_of_terms: term list -> int
wenzelm@4444
   131
  val variant: string list -> string -> string
wenzelm@4444
   132
  val variantlist: string list * string list -> string list
wenzelm@16537
   133
    (*note reversed order of args wrt. variant!*)
wenzelm@4444
   134
  val variant_abs: string * typ * term -> string * term
wenzelm@4444
   135
  val rename_wrt_term: term -> (string * typ) list -> (string * typ) list
wenzelm@4444
   136
  val add_new_id: string list * string -> string list
wenzelm@4444
   137
  val add_typ_classes: typ * class list -> class list
wenzelm@4444
   138
  val add_typ_ixns: indexname list * typ -> indexname list
wenzelm@4444
   139
  val add_typ_tfree_names: typ * string list -> string list
wenzelm@4444
   140
  val add_typ_tfrees: typ * (string * sort) list -> (string * sort) list
wenzelm@4444
   141
  val typ_tfrees: typ -> (string * sort) list
wenzelm@4444
   142
  val add_typ_tvars: typ * (indexname * sort) list -> (indexname * sort) list
wenzelm@4444
   143
  val typ_tvars: typ -> (indexname * sort) list
wenzelm@4444
   144
  val add_typ_tycons: typ * string list -> string list
wenzelm@4444
   145
  val add_typ_varnames: typ * string list -> string list
wenzelm@4444
   146
  val add_term_classes: term * class list -> class list
wenzelm@4444
   147
  val add_term_consts: term * string list -> string list
nipkow@13646
   148
  val term_consts: term -> string list
obua@16108
   149
  val term_constsT: term -> (string * typ) list
wenzelm@4444
   150
  val add_term_frees: term * term list -> term list
wenzelm@4444
   151
  val term_frees: term -> term list
wenzelm@12802
   152
  val add_term_free_names: term * string list -> string list
wenzelm@4444
   153
  val add_term_names: term * string list -> string list
wenzelm@4444
   154
  val add_term_tfree_names: term * string list -> string list
wenzelm@4444
   155
  val add_term_tfrees: term * (string * sort) list -> (string * sort) list
wenzelm@4444
   156
  val term_tfrees: term -> (string * sort) list
wenzelm@4444
   157
  val add_term_tvar_ixns: term * indexname list -> indexname list
wenzelm@4444
   158
  val add_term_tvarnames: term * string list -> string list
wenzelm@4444
   159
  val add_term_tvars: term * (indexname * sort) list -> (indexname * sort) list
wenzelm@4444
   160
  val term_tvars: term -> (indexname * sort) list
wenzelm@4444
   161
  val add_term_tycons: term * string list -> string list
wenzelm@4444
   162
  val add_term_vars: term * term list -> term list
wenzelm@4444
   163
  val term_vars: term -> term list
wenzelm@4444
   164
  val exists_Const: (string * typ -> bool) -> term -> bool
nipkow@4631
   165
  val exists_subterm: (term -> bool) -> term -> bool
wenzelm@4444
   166
  val compress_type: typ -> typ
wenzelm@4444
   167
  val compress_term: term -> term
wenzelm@15986
   168
  val show_question_marks: bool ref
wenzelm@4444
   169
end;
clasohm@0
   170
wenzelm@4444
   171
signature TERM =
wenzelm@4444
   172
sig
wenzelm@4444
   173
  include BASIC_TERM
wenzelm@16537
   174
  val indexname_ord: indexname * indexname -> order
wenzelm@16537
   175
  val sort_ord: sort * sort -> order
wenzelm@16537
   176
  val typ_ord: typ * typ -> order
wenzelm@16537
   177
  val typs_ord: typ list * typ list -> order
wenzelm@16537
   178
  val term_ord: term * term -> order
wenzelm@16537
   179
  val terms_ord: term list * term list -> order
wenzelm@16537
   180
  val hd_ord: term * term -> order
wenzelm@16537
   181
  val termless: term * term -> bool
nipkow@16570
   182
  val term_lpo: (string -> int) -> term * term -> order
wenzelm@12981
   183
  val match_bvars: (term * term) * (string * string) list -> (string * string) list
wenzelm@12981
   184
  val rename_abs: term -> term -> term -> term option
wenzelm@12499
   185
  val invent_names: string list -> string -> int -> string list
wenzelm@16338
   186
  val map_typ: (string -> string) -> (string -> string) -> typ -> typ
wenzelm@16338
   187
  val map_term: (string -> string) -> (string -> string) -> (string -> string) -> term -> term
wenzelm@12499
   188
  val add_tvarsT: (indexname * sort) list * typ -> (indexname * sort) list
wenzelm@12499
   189
  val add_tvars: (indexname * sort) list * term -> (indexname * sort) list
wenzelm@12499
   190
  val add_vars: (indexname * typ) list * term -> (indexname * typ) list
wenzelm@12499
   191
  val add_frees: (string * typ) list * term -> (string * typ) list
wenzelm@14786
   192
  val no_dummyT: typ -> typ
wenzelm@9536
   193
  val dummy_patternN: string
wenzelm@9536
   194
  val no_dummy_patterns: term -> term
wenzelm@9536
   195
  val replace_dummy_patterns: int * term -> int * term
wenzelm@10552
   196
  val is_replaced_dummy_pattern: indexname -> bool
wenzelm@16035
   197
  val show_dummy_patterns: term -> term
wenzelm@13484
   198
  val adhoc_freeze_vars: term -> term * string list
wenzelm@14786
   199
  val string_of_vname: indexname -> string
wenzelm@14786
   200
  val string_of_vname': indexname -> string
nipkow@15612
   201
  val string_of_term: term -> string
wenzelm@4444
   202
end;
wenzelm@4444
   203
wenzelm@4444
   204
structure Term: TERM =
clasohm@1364
   205
struct
clasohm@0
   206
clasohm@0
   207
(*Indexnames can be quickly renamed by adding an offset to the integer part,
clasohm@0
   208
  for resolution.*)
wenzelm@16537
   209
type indexname = string * int;
clasohm@0
   210
wenzelm@4626
   211
(* Types are classified by sorts. *)
clasohm@0
   212
type class = string;
clasohm@0
   213
type sort  = class list;
wenzelm@14829
   214
type arity = string * sort list * sort;
clasohm@0
   215
clasohm@0
   216
(* The sorts attached to TFrees and TVars specify the sort of that variable *)
clasohm@0
   217
datatype typ = Type  of string * typ list
clasohm@0
   218
             | TFree of string * sort
wenzelm@9536
   219
             | TVar  of indexname * sort;
clasohm@0
   220
paulson@6033
   221
(*Terms.  Bound variables are indicated by depth number.
clasohm@0
   222
  Free variables, (scheme) variables and constants have names.
wenzelm@4626
   223
  An term is "closed" if every bound variable of level "lev"
wenzelm@13000
   224
  is enclosed by at least "lev" abstractions.
clasohm@0
   225
clasohm@0
   226
  It is possible to create meaningless terms containing loose bound vars
clasohm@0
   227
  or type mismatches.  But such terms are not allowed in rules. *)
clasohm@0
   228
wenzelm@13000
   229
datatype term =
clasohm@0
   230
    Const of string * typ
wenzelm@13000
   231
  | Free  of string * typ
clasohm@0
   232
  | Var   of indexname * typ
clasohm@0
   233
  | Bound of int
clasohm@0
   234
  | Abs   of string*typ*term
wenzelm@3965
   235
  | op $  of term*term;
clasohm@0
   236
wenzelm@16537
   237
(*Errors involving type mismatches*)
clasohm@0
   238
exception TYPE of string * typ list * term list;
clasohm@0
   239
wenzelm@16537
   240
(*Errors errors involving terms*)
clasohm@0
   241
exception TERM of string * term list;
clasohm@0
   242
clasohm@0
   243
(*Note variable naming conventions!
clasohm@0
   244
    a,b,c: string
clasohm@0
   245
    f,g,h: functions (including terms of function type)
clasohm@0
   246
    i,j,m,n: int
clasohm@0
   247
    t,u: term
clasohm@0
   248
    v,w: indexnames
clasohm@0
   249
    x,y: any
clasohm@0
   250
    A,B,C: term (denoting formulae)
clasohm@0
   251
    T,U: typ
clasohm@0
   252
*)
clasohm@0
   253
clasohm@0
   254
paulson@6033
   255
(** Types **)
paulson@6033
   256
wenzelm@16537
   257
(*dummy type for parsing and printing etc.*)
wenzelm@16537
   258
val dummyT = Type ("dummy", []);
wenzelm@16537
   259
wenzelm@16537
   260
fun no_dummyT typ =
wenzelm@16537
   261
  let
wenzelm@16537
   262
    fun check (T as Type ("dummy", _)) =
wenzelm@16537
   263
          raise TYPE ("Illegal occurrence of '_' dummy type", [T], [])
wenzelm@16537
   264
      | check (Type (_, Ts)) = List.app check Ts
wenzelm@16537
   265
      | check _ = ();
wenzelm@16537
   266
  in check typ; typ end;
wenzelm@16537
   267
paulson@6033
   268
fun S --> T = Type("fun",[S,T]);
paulson@6033
   269
paulson@6033
   270
(*handy for multiple args: [T1,...,Tn]--->T  gives  T1-->(T2--> ... -->T)*)
skalberg@15570
   271
val op ---> = Library.foldr (op -->);
paulson@6033
   272
paulson@6033
   273
fun dest_Type (Type x) = x
paulson@6033
   274
  | dest_Type T = raise TYPE ("dest_Type", [T], []);
dixon@15914
   275
fun dest_TVar (TVar x) = x
dixon@15914
   276
  | dest_TVar T = raise TYPE ("dest_TVar", [T], []);
dixon@15914
   277
fun dest_TFree (TFree x) = x
dixon@15914
   278
  | dest_TFree T = raise TYPE ("dest_TFree", [T], []);
paulson@6033
   279
wenzelm@16537
   280
clasohm@0
   281
(** Discriminators **)
clasohm@0
   282
nipkow@7318
   283
fun is_Bound (Bound _) = true
nipkow@7318
   284
  | is_Bound _         = false;
nipkow@7318
   285
clasohm@0
   286
fun is_Const (Const _) = true
clasohm@0
   287
  | is_Const _ = false;
clasohm@0
   288
clasohm@0
   289
fun is_Free (Free _) = true
clasohm@0
   290
  | is_Free _ = false;
clasohm@0
   291
clasohm@0
   292
fun is_Var (Var _) = true
clasohm@0
   293
  | is_Var _ = false;
clasohm@0
   294
clasohm@0
   295
fun is_TVar (TVar _) = true
clasohm@0
   296
  | is_TVar _ = false;
clasohm@0
   297
paulson@15573
   298
(*Differs from proofterm/is_fun in its treatment of TVar*)
paulson@15573
   299
fun is_funtype (Type("fun",[_,_])) = true
paulson@15573
   300
  | is_funtype _ = false;
paulson@15573
   301
wenzelm@16537
   302
clasohm@0
   303
(** Destructors **)
clasohm@0
   304
clasohm@0
   305
fun dest_Const (Const x) =  x
clasohm@0
   306
  | dest_Const t = raise TERM("dest_Const", [t]);
clasohm@0
   307
clasohm@0
   308
fun dest_Free (Free x) =  x
clasohm@0
   309
  | dest_Free t = raise TERM("dest_Free", [t]);
clasohm@0
   310
clasohm@0
   311
fun dest_Var (Var x) =  x
clasohm@0
   312
  | dest_Var t = raise TERM("dest_Var", [t]);
clasohm@0
   313
clasohm@0
   314
paulson@4464
   315
fun domain_type (Type("fun", [T,_])) = T
paulson@4464
   316
and range_type  (Type("fun", [_,T])) = T;
paulson@4064
   317
clasohm@0
   318
(* maps  [T1,...,Tn]--->T  to the list  [T1,T2,...,Tn]*)
clasohm@0
   319
fun binder_types (Type("fun",[S,T])) = S :: binder_types T
clasohm@0
   320
  | binder_types _   =  [];
clasohm@0
   321
clasohm@0
   322
(* maps  [T1,...,Tn]--->T  to T*)
clasohm@0
   323
fun body_type (Type("fun",[S,T])) = body_type T
clasohm@0
   324
  | body_type T   =  T;
clasohm@0
   325
clasohm@0
   326
(* maps  [T1,...,Tn]--->T  to   ([T1,T2,...,Tn], T)  *)
clasohm@0
   327
fun strip_type T : typ list * typ =
clasohm@0
   328
  (binder_types T, body_type T);
clasohm@0
   329
clasohm@0
   330
clasohm@0
   331
(*Compute the type of the term, checking that combinations are well-typed
clasohm@0
   332
  Ts = [T0,T1,...] holds types of bound variables 0, 1, ...*)
clasohm@0
   333
fun type_of1 (Ts, Const (_,T)) = T
clasohm@0
   334
  | type_of1 (Ts, Free  (_,T)) = T
skalberg@15570
   335
  | type_of1 (Ts, Bound i) = (List.nth (Ts,i)
skalberg@15570
   336
        handle Subscript => raise TYPE("type_of: bound variable", [], [Bound i]))
clasohm@0
   337
  | type_of1 (Ts, Var (_,T)) = T
clasohm@0
   338
  | type_of1 (Ts, Abs (_,T,body)) = T --> type_of1(T::Ts, body)
wenzelm@13000
   339
  | type_of1 (Ts, f$u) =
clasohm@0
   340
      let val U = type_of1(Ts,u)
clasohm@0
   341
          and T = type_of1(Ts,f)
clasohm@0
   342
      in case T of
wenzelm@9536
   343
            Type("fun",[T1,T2]) =>
wenzelm@9536
   344
              if T1=U then T2  else raise TYPE
wenzelm@9536
   345
                    ("type_of: type mismatch in application", [T1,U], [f$u])
wenzelm@13000
   346
          | _ => raise TYPE
wenzelm@9536
   347
                    ("type_of: function type is expected in application",
wenzelm@9536
   348
                     [T,U], [f$u])
clasohm@0
   349
      end;
clasohm@0
   350
clasohm@0
   351
fun type_of t : typ = type_of1 ([],t);
clasohm@0
   352
clasohm@0
   353
(*Determines the type of a term, with minimal checking*)
wenzelm@13000
   354
fun fastype_of1 (Ts, f$u) =
lcp@61
   355
    (case fastype_of1 (Ts,f) of
wenzelm@9536
   356
        Type("fun",[_,T]) => T
wenzelm@9536
   357
        | _ => raise TERM("fastype_of: expected function type", [f$u]))
lcp@61
   358
  | fastype_of1 (_, Const (_,T)) = T
lcp@61
   359
  | fastype_of1 (_, Free (_,T)) = T
skalberg@15570
   360
  | fastype_of1 (Ts, Bound i) = (List.nth(Ts,i)
skalberg@15570
   361
         handle Subscript => raise TERM("fastype_of: Bound", [Bound i]))
wenzelm@13000
   362
  | fastype_of1 (_, Var (_,T)) = T
lcp@61
   363
  | fastype_of1 (Ts, Abs (_,T,u)) = T --> fastype_of1 (T::Ts, u);
lcp@61
   364
lcp@61
   365
fun fastype_of t : typ = fastype_of1 ([],t);
clasohm@0
   366
clasohm@0
   367
skalberg@15570
   368
val list_abs = Library.foldr (fn ((x, T), t) => Abs (x, T, t));
wenzelm@10806
   369
clasohm@0
   370
(* maps  (x1,...,xn)t   to   t  *)
wenzelm@13000
   371
fun strip_abs_body (Abs(_,_,t))  =  strip_abs_body t
clasohm@0
   372
  | strip_abs_body u  =  u;
clasohm@0
   373
clasohm@0
   374
(* maps  (x1,...,xn)t   to   [x1, ..., xn]  *)
wenzelm@13000
   375
fun strip_abs_vars (Abs(a,T,t))  =  (a,T) :: strip_abs_vars t
clasohm@0
   376
  | strip_abs_vars u  =  [] : (string*typ) list;
clasohm@0
   377
clasohm@0
   378
clasohm@0
   379
fun strip_qnt_body qnt =
clasohm@0
   380
let fun strip(tm as Const(c,_)$Abs(_,_,t)) = if c=qnt then strip t else tm
clasohm@0
   381
      | strip t = t
clasohm@0
   382
in strip end;
clasohm@0
   383
clasohm@0
   384
fun strip_qnt_vars qnt =
clasohm@0
   385
let fun strip(Const(c,_)$Abs(a,T,t)) = if c=qnt then (a,T)::strip t else []
clasohm@0
   386
      | strip t  =  [] : (string*typ) list
clasohm@0
   387
in strip end;
clasohm@0
   388
clasohm@0
   389
clasohm@0
   390
(* maps   (f, [t1,...,tn])  to  f(t1,...,tn) *)
skalberg@15570
   391
val list_comb : term * term list -> term = Library.foldl (op $);
clasohm@0
   392
clasohm@0
   393
clasohm@0
   394
(* maps   f(t1,...,tn)  to  (f, [t1,...,tn]) ; naturally tail-recursive*)
wenzelm@13000
   395
fun strip_comb u : term * term list =
clasohm@0
   396
    let fun stripc (f$t, ts) = stripc (f, t::ts)
wenzelm@13000
   397
        |   stripc  x =  x
clasohm@0
   398
    in  stripc(u,[])  end;
clasohm@0
   399
clasohm@0
   400
clasohm@0
   401
(* maps   f(t1,...,tn)  to  f , which is never a combination *)
clasohm@0
   402
fun head_of (f$t) = head_of f
clasohm@0
   403
  | head_of u = u;
clasohm@0
   404
clasohm@0
   405
clasohm@0
   406
(*Number of atoms and abstractions in a term*)
clasohm@0
   407
fun size_of_term (Abs (_,_,body)) = 1 + size_of_term body
clasohm@0
   408
  | size_of_term (f$t) = size_of_term f  +  size_of_term t
clasohm@0
   409
  | size_of_term _ = 1;
clasohm@0
   410
nipkow@949
   411
fun map_type_tvar f (Type(a,Ts)) = Type(a, map (map_type_tvar f) Ts)
nipkow@949
   412
  | map_type_tvar f (T as TFree _) = T
nipkow@949
   413
  | map_type_tvar f (TVar x) = f x;
nipkow@949
   414
nipkow@949
   415
fun map_type_tfree f (Type(a,Ts)) = Type(a, map (map_type_tfree f) Ts)
nipkow@949
   416
  | map_type_tfree f (TFree x) = f x
nipkow@949
   417
  | map_type_tfree f (T as TVar _) = T;
nipkow@949
   418
clasohm@0
   419
(* apply a function to all types in a term *)
clasohm@0
   420
fun map_term_types f =
clasohm@0
   421
let fun map(Const(a,T)) = Const(a, f T)
clasohm@0
   422
      | map(Free(a,T)) = Free(a, f T)
clasohm@0
   423
      | map(Var(v,T)) = Var(v, f T)
clasohm@0
   424
      | map(t as Bound _)  = t
clasohm@0
   425
      | map(Abs(a,T,t)) = Abs(a, f T, map t)
clasohm@0
   426
      | map(f$t) = map f $ map t;
clasohm@0
   427
in map end;
clasohm@0
   428
clasohm@0
   429
(* iterate a function over all types in a term *)
clasohm@0
   430
fun it_term_types f =
clasohm@0
   431
let fun iter(Const(_,T), a) = f(T,a)
clasohm@0
   432
      | iter(Free(_,T), a) = f(T,a)
clasohm@0
   433
      | iter(Var(_,T), a) = f(T,a)
clasohm@0
   434
      | iter(Abs(_,T,t), a) = iter(t,f(T,a))
clasohm@0
   435
      | iter(f$u, a) = iter(f, iter(u, a))
clasohm@0
   436
      | iter(Bound _, a) = a
clasohm@0
   437
in iter end
clasohm@0
   438
clasohm@0
   439
wenzelm@16537
   440
(** Comparing terms, types etc. **)
wenzelm@16537
   441
wenzelm@16537
   442
fun indexname_ord ((x, i), (y, j)) =
wenzelm@16537
   443
  (case int_ord (i, j) of EQUAL => string_ord (x, y) | ord => ord);
wenzelm@16537
   444
wenzelm@16537
   445
val sort_ord = list_ord string_ord;
wenzelm@16537
   446
wenzelm@16537
   447
wenzelm@16537
   448
(* typ_ord *)
wenzelm@16537
   449
wenzelm@16537
   450
fun typ_ord TU =
wenzelm@16537
   451
  if pointer_eq TU then EQUAL
wenzelm@16537
   452
  else
wenzelm@16537
   453
    (case TU of
wenzelm@16537
   454
      (Type x, Type y) => prod_ord string_ord typs_ord (x, y)
wenzelm@16537
   455
    | (Type _, _) => GREATER
wenzelm@16537
   456
    | (TFree _, Type _) => LESS
wenzelm@16537
   457
    | (TFree x, TFree y) => prod_ord string_ord sort_ord (x, y)
wenzelm@16537
   458
    | (TFree _, TVar _) => GREATER
wenzelm@16537
   459
    | (TVar _, Type _) => LESS
wenzelm@16537
   460
    | (TVar _, TFree _) => LESS
wenzelm@16537
   461
    | (TVar x, TVar y) => prod_ord indexname_ord sort_ord (x, y))
wenzelm@16537
   462
and typs_ord Ts_Us = list_ord typ_ord Ts_Us;
wenzelm@16537
   463
wenzelm@16537
   464
wenzelm@16537
   465
(* term_ord *)
wenzelm@16537
   466
wenzelm@16537
   467
(*a linear well-founded AC-compatible ordering for terms:
wenzelm@16537
   468
  s < t <=> 1. size(s) < size(t) or
wenzelm@16537
   469
            2. size(s) = size(t) and s=f(...) and t=g(...) and f<g or
wenzelm@16537
   470
            3. size(s) = size(t) and s=f(s1..sn) and t=f(t1..tn) and
wenzelm@16537
   471
               (s1..sn) < (t1..tn) (lexicographically)*)
wenzelm@16537
   472
wenzelm@16537
   473
fun dest_hd (Const (a, T)) = (((a, 0), T), 0)
wenzelm@16537
   474
  | dest_hd (Free (a, T)) = (((a, 0), T), 1)
wenzelm@16537
   475
  | dest_hd (Var v) = (v, 2)
wenzelm@16537
   476
  | dest_hd (Bound i) = ((("", i), dummyT), 3)
wenzelm@16537
   477
  | dest_hd (Abs (_, T, _)) = ((("", 0), T), 4);
wenzelm@16537
   478
wenzelm@16537
   479
fun term_ord tu =
wenzelm@16537
   480
  if pointer_eq tu then EQUAL
wenzelm@16537
   481
  else
wenzelm@16537
   482
    (case tu of
wenzelm@16537
   483
      (Abs (_, T, t), Abs(_, U, u)) =>
wenzelm@16537
   484
        (case term_ord (t, u) of EQUAL => typ_ord (T, U) | ord => ord)
wenzelm@16537
   485
      | (t, u) =>
wenzelm@16537
   486
        (case int_ord (size_of_term t, size_of_term u) of
wenzelm@16537
   487
          EQUAL =>
wenzelm@16537
   488
            let
wenzelm@16537
   489
              val (f, ts) = strip_comb t
wenzelm@16537
   490
              and (g, us) = strip_comb u
wenzelm@16537
   491
            in case hd_ord (f, g) of EQUAL => terms_ord (ts, us) | ord => ord end
wenzelm@16537
   492
        | ord => ord))
wenzelm@16537
   493
and hd_ord (f, g) =
wenzelm@16537
   494
  prod_ord (prod_ord indexname_ord typ_ord) int_ord (dest_hd f, dest_hd g)
wenzelm@16537
   495
and terms_ord (ts, us) = list_ord term_ord (ts, us);
wenzelm@16537
   496
wenzelm@16537
   497
fun op aconv tu = (term_ord tu = EQUAL);
wenzelm@16537
   498
fun aconvs ts_us = (list_ord term_ord ts_us = EQUAL);
wenzelm@16537
   499
fun termless tu = (term_ord tu = LESS);
wenzelm@16537
   500
nipkow@16570
   501
(*** Lexicographic path order on terms.
nipkow@16570
   502
nipkow@16570
   503
  See Baader & Nipkow, Term rewriting, CUP 1998.
nipkow@16570
   504
  Without variables.  Const, Var, Bound, Free and Abs are treated all as
nipkow@16570
   505
  constants.
nipkow@16570
   506
nipkow@16570
   507
  f_ord maps strings to integers and serves two purposes:
nipkow@16570
   508
  - Predicate on constant symbols.  Those that are not recognised by f_ord
nipkow@16570
   509
    must be mapped to ~1.
nipkow@16570
   510
  - Order on the recognised symbols.  These must be mapped to distinct
nipkow@16570
   511
    integers >= 0.
nipkow@16570
   512
nipkow@16570
   513
***)
nipkow@16570
   514
nipkow@16570
   515
local
nipkow@16570
   516
fun dest_hd f_ord (Const (a, T)) = 
nipkow@16570
   517
      let val ord = f_ord a in
nipkow@16570
   518
        if ord = ~1 then ((1, ((a, 0), T)), 0) else ((0, (("", ord), T)), 0)
nipkow@16570
   519
      end
nipkow@16570
   520
  | dest_hd _ (Free (a, T)) = ((1, ((a, 0), T)), 0)
nipkow@16570
   521
  | dest_hd _ (Var v) = ((1, v), 1)
nipkow@16570
   522
  | dest_hd _ (Bound i) = ((1, (("", i), dummyT)), 2)
nipkow@16570
   523
  | dest_hd _ (Abs (_, T, _)) = ((1, (("", 0), T)), 3);
nipkow@16570
   524
nipkow@16570
   525
fun term_lpo f_ord (s, t) =
nipkow@16570
   526
  let val (f, ss) = strip_comb s and (g, ts) = strip_comb t in
nipkow@16570
   527
    if forall (fn si => term_lpo f_ord (si, t) = LESS) ss
nipkow@16570
   528
    then case hd_ord f_ord (f, g) of
nipkow@16570
   529
	GREATER =>
nipkow@16570
   530
	  if forall (fn ti => term_lpo f_ord (s, ti) = GREATER) ts
nipkow@16570
   531
	  then GREATER else LESS
nipkow@16570
   532
      | EQUAL =>
nipkow@16570
   533
	  if forall (fn ti => term_lpo f_ord (s, ti) = GREATER) ts
nipkow@16570
   534
	  then list_ord (term_lpo f_ord) (ss, ts)
nipkow@16570
   535
	  else LESS
nipkow@16570
   536
      | LESS => LESS
nipkow@16570
   537
    else GREATER
nipkow@16570
   538
  end
nipkow@16570
   539
and hd_ord f_ord (f, g) = case (f, g) of
nipkow@16570
   540
    (Abs (_, T, t), Abs (_, U, u)) =>
nipkow@16570
   541
      (case term_lpo f_ord (t, u) of EQUAL => typ_ord (T, U) | ord => ord)
nipkow@16570
   542
  | (_, _) => prod_ord (prod_ord int_ord
nipkow@16570
   543
                  (prod_ord indexname_ord typ_ord)) int_ord
nipkow@16570
   544
                (dest_hd f_ord f, dest_hd f_ord g)
nipkow@16570
   545
in
nipkow@16570
   546
val term_lpo = term_lpo
nipkow@16570
   547
end;
nipkow@16570
   548
wenzelm@16537
   549
structure Vartab = TableFun(type key = indexname val ord = indexname_ord);
wenzelm@16537
   550
structure Typtab = TableFun(type key = typ val ord = typ_ord);
wenzelm@16537
   551
structure Termtab = TableFun(type key = term val ord = term_ord);
wenzelm@16537
   552
wenzelm@16537
   553
clasohm@0
   554
(** Connectives of higher order logic **)
clasohm@0
   555
wenzelm@375
   556
fun itselfT ty = Type ("itself", [ty]);
wenzelm@14854
   557
val a_itselfT = itselfT (TFree ("'a", []));
wenzelm@375
   558
clasohm@0
   559
val propT : typ = Type("prop",[]);
clasohm@0
   560
clasohm@0
   561
val implies = Const("==>", propT-->propT-->propT);
clasohm@0
   562
clasohm@0
   563
fun all T = Const("all", (T-->propT)-->propT);
clasohm@0
   564
clasohm@0
   565
fun equals T = Const("==", T-->T-->propT);
clasohm@0
   566
clasohm@0
   567
(* maps  !!x1...xn. t   to   t  *)
wenzelm@13000
   568
fun strip_all_body (Const("all",_)$Abs(_,_,t))  =  strip_all_body t
clasohm@0
   569
  | strip_all_body t  =  t;
clasohm@0
   570
clasohm@0
   571
(* maps  !!x1...xn. t   to   [x1, ..., xn]  *)
clasohm@0
   572
fun strip_all_vars (Const("all",_)$Abs(a,T,t))  =
wenzelm@13000
   573
                (a,T) :: strip_all_vars t
clasohm@0
   574
  | strip_all_vars t  =  [] : (string*typ) list;
clasohm@0
   575
clasohm@0
   576
(*increments a term's non-local bound variables
clasohm@0
   577
  required when moving a term within abstractions
clasohm@0
   578
     inc is  increment for bound variables
clasohm@0
   579
     lev is  level at which a bound variable is considered 'loose'*)
wenzelm@13000
   580
fun incr_bv (inc, lev, u as Bound i) = if i>=lev then Bound(i+inc) else u
clasohm@0
   581
  | incr_bv (inc, lev, Abs(a,T,body)) =
wenzelm@9536
   582
        Abs(a, T, incr_bv(inc,lev+1,body))
wenzelm@13000
   583
  | incr_bv (inc, lev, f$t) =
clasohm@0
   584
      incr_bv(inc,lev,f) $ incr_bv(inc,lev,t)
clasohm@0
   585
  | incr_bv (inc, lev, u) = u;
clasohm@0
   586
clasohm@0
   587
fun incr_boundvars  0  t = t
clasohm@0
   588
  | incr_boundvars inc t = incr_bv(inc,0,t);
clasohm@0
   589
wenzelm@12981
   590
(*Scan a pair of terms; while they are similar,
wenzelm@12981
   591
  accumulate corresponding bound vars in "al"*)
wenzelm@12981
   592
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) =
wenzelm@12981
   593
      match_bvs(s, t, if x="" orelse y="" then al
wenzelm@12981
   594
                                          else (x,y)::al)
wenzelm@12981
   595
  | match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al))
wenzelm@12981
   596
  | match_bvs(_,_,al) = al;
wenzelm@12981
   597
wenzelm@12981
   598
(* strip abstractions created by parameters *)
wenzelm@12981
   599
fun match_bvars((s,t),al) = match_bvs(strip_abs_body s, strip_abs_body t, al);
wenzelm@12981
   600
wenzelm@12981
   601
fun rename_abs pat obj t =
wenzelm@12981
   602
  let
wenzelm@12981
   603
    val ren = match_bvs (pat, obj, []);
wenzelm@12981
   604
    fun ren_abs (Abs (x, T, b)) =
skalberg@15570
   605
          Abs (getOpt (assoc_string (ren, x), x), T, ren_abs b)
wenzelm@12981
   606
      | ren_abs (f $ t) = ren_abs f $ ren_abs t
wenzelm@12981
   607
      | ren_abs t = t
skalberg@15531
   608
  in if null ren then NONE else SOME (ren_abs t) end;
clasohm@0
   609
clasohm@0
   610
(*Accumulate all 'loose' bound vars referring to level 'lev' or beyond.
clasohm@0
   611
   (Bound 0) is loose at level 0 *)
wenzelm@13000
   612
fun add_loose_bnos (Bound i, lev, js) =
wenzelm@9536
   613
        if i<lev then js  else  (i-lev) ins_int js
clasohm@0
   614
  | add_loose_bnos (Abs (_,_,t), lev, js) = add_loose_bnos (t, lev+1, js)
clasohm@0
   615
  | add_loose_bnos (f$t, lev, js) =
wenzelm@13000
   616
        add_loose_bnos (f, lev, add_loose_bnos (t, lev, js))
clasohm@0
   617
  | add_loose_bnos (_, _, js) = js;
clasohm@0
   618
clasohm@0
   619
fun loose_bnos t = add_loose_bnos (t, 0, []);
clasohm@0
   620
clasohm@0
   621
(* loose_bvar(t,k) iff t contains a 'loose' bound variable referring to
clasohm@0
   622
   level k or beyond. *)
clasohm@0
   623
fun loose_bvar(Bound i,k) = i >= k
clasohm@0
   624
  | loose_bvar(f$t, k) = loose_bvar(f,k) orelse loose_bvar(t,k)
clasohm@0
   625
  | loose_bvar(Abs(_,_,t),k) = loose_bvar(t,k+1)
clasohm@0
   626
  | loose_bvar _ = false;
clasohm@0
   627
nipkow@2792
   628
fun loose_bvar1(Bound i,k) = i = k
nipkow@2792
   629
  | loose_bvar1(f$t, k) = loose_bvar1(f,k) orelse loose_bvar1(t,k)
nipkow@2792
   630
  | loose_bvar1(Abs(_,_,t),k) = loose_bvar1(t,k+1)
nipkow@2792
   631
  | loose_bvar1 _ = false;
clasohm@0
   632
clasohm@0
   633
(*Substitute arguments for loose bound variables.
clasohm@0
   634
  Beta-reduction of arg(n-1)...arg0 into t replacing (Bound i) with (argi).
wenzelm@4626
   635
  Note that for ((%x y. c) a b), the bound vars in c are x=1 and y=0
wenzelm@9536
   636
        and the appropriate call is  subst_bounds([b,a], c) .
clasohm@0
   637
  Loose bound variables >=n are reduced by "n" to
clasohm@0
   638
     compensate for the disappearance of lambdas.
clasohm@0
   639
*)
wenzelm@13000
   640
fun subst_bounds (args: term list, t) : term =
clasohm@0
   641
  let val n = length args;
clasohm@0
   642
      fun subst (t as Bound i, lev) =
wenzelm@9536
   643
           (if i<lev then  t    (*var is locally bound*)
wenzelm@9536
   644
            else  incr_boundvars lev (List.nth(args, i-lev))
wenzelm@9536
   645
                    handle Subscript => Bound(i-n)  (*loose: change it*))
wenzelm@9536
   646
        | subst (Abs(a,T,body), lev) = Abs(a, T,  subst(body,lev+1))
wenzelm@9536
   647
        | subst (f$t, lev) =  subst(f,lev)  $  subst(t,lev)
wenzelm@9536
   648
        | subst (t,lev) = t
clasohm@0
   649
  in   case args of [] => t  | _ => subst (t,0)  end;
clasohm@0
   650
paulson@2192
   651
(*Special case: one argument*)
wenzelm@13000
   652
fun subst_bound (arg, t) : term =
paulson@2192
   653
  let fun subst (t as Bound i, lev) =
wenzelm@9536
   654
            if i<lev then  t    (*var is locally bound*)
wenzelm@9536
   655
            else  if i=lev then incr_boundvars lev arg
wenzelm@9536
   656
                           else Bound(i-1)  (*loose: change it*)
wenzelm@9536
   657
        | subst (Abs(a,T,body), lev) = Abs(a, T,  subst(body,lev+1))
wenzelm@9536
   658
        | subst (f$t, lev) =  subst(f,lev)  $  subst(t,lev)
wenzelm@9536
   659
        | subst (t,lev) = t
paulson@2192
   660
  in  subst (t,0)  end;
paulson@2192
   661
clasohm@0
   662
(*beta-reduce if possible, else form application*)
paulson@2192
   663
fun betapply (Abs(_,_,t), u) = subst_bound (u,t)
clasohm@0
   664
  | betapply (f,u) = f$u;
clasohm@0
   665
wenzelm@14786
   666
paulson@2192
   667
(** Equality, membership and insertion of indexnames (string*ints) **)
paulson@2192
   668
paulson@2192
   669
(*optimized equality test for indexnames.  Yields a huge gain under Poly/ML*)
wenzelm@2959
   670
fun eq_ix ((a, i):indexname, (a',i'):indexname) = (a=a') andalso i=i';
paulson@2192
   671
paulson@2192
   672
(*membership in a list, optimized version for indexnames*)
wenzelm@2959
   673
fun mem_ix (_, []) = false
paulson@2192
   674
  | mem_ix (x, y :: ys) = eq_ix(x,y) orelse mem_ix (x, ys);
paulson@2192
   675
paulson@2192
   676
(*insertion into list, optimized version for indexnames*)
paulson@2192
   677
fun ins_ix (x,xs) = if mem_ix (x, xs) then xs else x :: xs;
paulson@2192
   678
clasohm@0
   679
paulson@2176
   680
(** Membership, insertion, union for terms **)
paulson@2176
   681
paulson@2176
   682
fun mem_term (_, []) = false
paulson@2176
   683
  | mem_term (t, t'::ts) = t aconv t' orelse mem_term(t,ts);
paulson@2176
   684
paulson@2182
   685
fun subset_term ([], ys) = true
paulson@2182
   686
  | subset_term (x :: xs, ys) = mem_term (x, ys) andalso subset_term(xs, ys);
paulson@2182
   687
paulson@2182
   688
fun eq_set_term (xs, ys) =
paulson@2182
   689
    xs = ys orelse (subset_term (xs, ys) andalso subset_term (ys, xs));
paulson@2182
   690
paulson@2176
   691
fun ins_term(t,ts) = if mem_term(t,ts) then ts else t :: ts;
paulson@2176
   692
paulson@2176
   693
fun union_term (xs, []) = xs
paulson@2176
   694
  | union_term ([], ys) = ys
paulson@2176
   695
  | union_term ((x :: xs), ys) = union_term (xs, ins_term (x, ys));
paulson@2176
   696
paulson@5585
   697
fun inter_term ([], ys) = []
paulson@5585
   698
  | inter_term (x::xs, ys) =
paulson@5585
   699
      if mem_term (x,ys) then x :: inter_term(xs,ys) else inter_term(xs,ys);
paulson@5585
   700
wenzelm@13000
   701
(*A fast unification filter: true unless the two terms cannot be unified.
clasohm@0
   702
  Terms must be NORMAL.  Treats all Vars as distinct. *)
clasohm@0
   703
fun could_unify (t,u) =
clasohm@0
   704
  let fun matchrands (f$t, g$u) = could_unify(t,u) andalso  matchrands(f,g)
wenzelm@9536
   705
        | matchrands _ = true
clasohm@0
   706
  in case (head_of t , head_of u) of
wenzelm@9536
   707
        (_, Var _) => true
clasohm@0
   708
      | (Var _, _) => true
clasohm@0
   709
      | (Const(a,_), Const(b,_)) =>  a=b andalso matchrands(t,u)
clasohm@0
   710
      | (Free(a,_), Free(b,_)) =>  a=b andalso matchrands(t,u)
clasohm@0
   711
      | (Bound i, Bound j) =>  i=j andalso matchrands(t,u)
clasohm@0
   712
      | (Abs _, _) =>  true   (*because of possible eta equality*)
clasohm@0
   713
      | (_, Abs _) =>  true
clasohm@0
   714
      | _ => false
clasohm@0
   715
  end;
clasohm@0
   716
clasohm@0
   717
(*Substitute new for free occurrences of old in a term*)
clasohm@0
   718
fun subst_free [] = (fn t=>t)
clasohm@0
   719
  | subst_free pairs =
wenzelm@13000
   720
      let fun substf u =
wenzelm@9536
   721
            case gen_assoc (op aconv) (pairs, u) of
skalberg@15531
   722
                SOME u' => u'
skalberg@15531
   723
              | NONE => (case u of Abs(a,T,t) => Abs(a, T, substf t)
wenzelm@9536
   724
                                 | t$u' => substf t $ substf u'
wenzelm@9536
   725
                                 | _ => u)
clasohm@0
   726
      in  substf  end;
clasohm@0
   727
clasohm@0
   728
(*a total, irreflexive ordering on index names*)
clasohm@0
   729
fun xless ((a,i), (b,j): indexname) = i<j  orelse  (i=j andalso a<b);
clasohm@0
   730
clasohm@0
   731
wenzelm@13000
   732
(*Abstraction of the term "body" over its occurrences of v,
clasohm@0
   733
    which must contain no loose bound variables.
clasohm@0
   734
  The resulting term is ready to become the body of an Abs.*)
clasohm@0
   735
fun abstract_over (v,body) =
clasohm@0
   736
  let fun abst (lev,u) = if (v aconv u) then (Bound lev) else
clasohm@0
   737
      (case u of
clasohm@0
   738
          Abs(a,T,t) => Abs(a, T, abst(lev+1, t))
wenzelm@9536
   739
        | f$rand => abst(lev,f) $ abst(lev,rand)
wenzelm@9536
   740
        | _ => u)
clasohm@0
   741
  in  abst(0,body)  end;
clasohm@0
   742
berghofe@13665
   743
fun lambda (v as Free (x, T)) t = Abs (x, T, abstract_over (v, t))
berghofe@13665
   744
  | lambda (v as Var ((x, _), T)) t = Abs (x, T, abstract_over (v, t))
berghofe@13665
   745
  | lambda v t = raise TERM ("lambda", [v, t]);
clasohm@0
   746
clasohm@0
   747
(*Form an abstraction over a free variable.*)
clasohm@0
   748
fun absfree (a,T,body) = Abs(a, T, abstract_over (Free(a,T), body));
clasohm@0
   749
clasohm@0
   750
(*Abstraction over a list of free variables*)
clasohm@0
   751
fun list_abs_free ([ ] ,     t) = t
wenzelm@13000
   752
  | list_abs_free ((a,T)::vars, t) =
clasohm@0
   753
      absfree(a, T, list_abs_free(vars,t));
clasohm@0
   754
clasohm@0
   755
(*Quantification over a list of free variables*)
clasohm@0
   756
fun list_all_free ([], t: term) = t
wenzelm@13000
   757
  | list_all_free ((a,T)::vars, t) =
clasohm@0
   758
        (all T) $ (absfree(a, T, list_all_free(vars,t)));
clasohm@0
   759
clasohm@0
   760
(*Quantification over a list of variables (already bound in body) *)
clasohm@0
   761
fun list_all ([], t) = t
wenzelm@13000
   762
  | list_all ((a,T)::vars, t) =
clasohm@0
   763
        (all T) $ (Abs(a, T, list_all(vars,t)));
clasohm@0
   764
wenzelm@13000
   765
(*Replace the ATOMIC term ti by ui;    instl = [(t1,u1), ..., (tn,un)].
clasohm@0
   766
  A simultaneous substitution:  [ (a,b), (b,a) ] swaps a and b.  *)
clasohm@0
   767
fun subst_atomic [] t = t : term
clasohm@0
   768
  | subst_atomic (instl: (term*term) list) t =
clasohm@0
   769
      let fun subst (Abs(a,T,body)) = Abs(a, T, subst body)
wenzelm@9536
   770
            | subst (f$t') = subst f $ subst t'
skalberg@15570
   771
            | subst t = getOpt (assoc(instl,t),t)
clasohm@0
   772
      in  subst t  end;
clasohm@0
   773
berghofe@15797
   774
(*Replace the ATOMIC type Ti by Ui;    instl = [(T1,U1), ..., (Tn,Un)].*)
berghofe@15797
   775
fun typ_subst_atomic [] T = T
berghofe@15797
   776
  | typ_subst_atomic instl (Type (s, Ts)) =
berghofe@15797
   777
      Type (s, map (typ_subst_atomic instl) Ts)
berghofe@15797
   778
  | typ_subst_atomic instl T = getOpt (assoc (instl, T), T);
berghofe@15797
   779
lcp@728
   780
(*Substitute for type Vars in a type*)
clasohm@0
   781
fun typ_subst_TVars iTs T = if null iTs then T else
clasohm@0
   782
  let fun subst(Type(a,Ts)) = Type(a, map subst Ts)
wenzelm@9536
   783
        | subst(T as TFree _) = T
skalberg@15570
   784
        | subst(T as TVar(ixn,_)) = getOpt (assoc(iTs,ixn),T)
clasohm@0
   785
  in subst T end;
clasohm@0
   786
lcp@728
   787
(*Substitute for type Vars in a term*)
clasohm@0
   788
val subst_TVars = map_term_types o typ_subst_TVars;
clasohm@0
   789
lcp@728
   790
(*Substitute for Vars in a term; see also envir/norm_term*)
clasohm@0
   791
fun subst_Vars itms t = if null itms then t else
skalberg@15570
   792
  let fun subst(v as Var(ixn,_)) = getOpt (assoc(itms,ixn),v)
clasohm@0
   793
        | subst(Abs(a,T,t)) = Abs(a,T,subst t)
clasohm@0
   794
        | subst(f$t) = subst f $ subst t
clasohm@0
   795
        | subst(t) = t
clasohm@0
   796
  in subst t end;
clasohm@0
   797
lcp@728
   798
(*Substitute for type/term Vars in a term; see also envir/norm_term*)
clasohm@0
   799
fun subst_vars(iTs,itms) = if null iTs then subst_Vars itms else
clasohm@0
   800
  let fun subst(Const(a,T)) = Const(a,typ_subst_TVars iTs T)
clasohm@0
   801
        | subst(Free(a,T)) = Free(a,typ_subst_TVars iTs T)
clasohm@0
   802
        | subst(v as Var(ixn,T)) = (case assoc(itms,ixn) of
skalberg@15531
   803
            NONE   => Var(ixn,typ_subst_TVars iTs T)
skalberg@15531
   804
          | SOME t => t)
clasohm@0
   805
        | subst(b as Bound _) = b
clasohm@0
   806
        | subst(Abs(a,T,t)) = Abs(a,typ_subst_TVars iTs T,subst t)
clasohm@0
   807
        | subst(f$t) = subst f $ subst t
clasohm@0
   808
  in subst end;
clasohm@0
   809
clasohm@0
   810
paulson@15573
   811
(** Identifying first-order terms **)
paulson@15573
   812
paulson@15573
   813
(*Argument Ts is a reverse list of binder types, needed if term t contains Bound vars*)
paulson@15573
   814
fun has_not_funtype Ts t = not (is_funtype (fastype_of1 (Ts,t)));
paulson@15573
   815
wenzelm@16537
   816
(*First order means in all terms of the form f(t1,...,tn) no argument has a
paulson@16589
   817
  function type. The supplied quantifiers are excluded: their argument always
paulson@16589
   818
  has a function type through a recursive call into its body.*)
paulson@16589
   819
fun is_first_order quants = 
paulson@16589
   820
  let fun first_order1 Ts (Abs (_,T,body)) = first_order1 (T::Ts) body
paulson@16589
   821
	| first_order1 Ts (Const(q,_) $ Abs(a,T,body)) =
paulson@16589
   822
	    q mem_string quants  andalso   (*it is a known quantifier*)
paulson@16589
   823
            not (is_funtype T)   andalso first_order1 (T::Ts) body
paulson@16589
   824
	| first_order1 Ts t =
paulson@16589
   825
	    case strip_comb t of
paulson@16589
   826
		 (Var _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
paulson@16589
   827
	       | (Free _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
paulson@16589
   828
	       | (Const _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
paulson@16589
   829
	       | (Bound _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
paulson@16589
   830
	       | (Abs _, ts) => false (*not in beta-normal form*)
paulson@16589
   831
	       | _ => error "first_order: unexpected case"
paulson@16589
   832
    in  first_order1 []  end;
paulson@15573
   833
clasohm@0
   834
(*Computing the maximum index of a typ*)
paulson@2146
   835
fun maxidx_of_typ(Type(_,Ts)) = maxidx_of_typs Ts
clasohm@0
   836
  | maxidx_of_typ(TFree _) = ~1
paulson@2146
   837
  | maxidx_of_typ(TVar((_,i),_)) = i
paulson@2146
   838
and maxidx_of_typs [] = ~1
paulson@2146
   839
  | maxidx_of_typs (T::Ts) = Int.max(maxidx_of_typ T, maxidx_of_typs Ts);
clasohm@0
   840
clasohm@0
   841
clasohm@0
   842
(*Computing the maximum index of a term*)
clasohm@0
   843
fun maxidx_of_term (Const(_,T)) = maxidx_of_typ T
clasohm@0
   844
  | maxidx_of_term (Bound _) = ~1
clasohm@0
   845
  | maxidx_of_term (Free(_,T)) = maxidx_of_typ T
paulson@2146
   846
  | maxidx_of_term (Var ((_,i), T)) = Int.max(i, maxidx_of_typ T)
paulson@2146
   847
  | maxidx_of_term (Abs (_,T,u)) = Int.max(maxidx_of_term u, maxidx_of_typ T)
paulson@2146
   848
  | maxidx_of_term (f$t) = Int.max(maxidx_of_term f,  maxidx_of_term t);
clasohm@0
   849
skalberg@15570
   850
fun maxidx_of_terms ts = Library.foldl Int.max (~1, map maxidx_of_term ts);
berghofe@13665
   851
clasohm@0
   852
clasohm@0
   853
(* Increment the index of all Poly's in T by k *)
nipkow@949
   854
fun incr_tvar k = map_type_tvar (fn ((a,i),S) => TVar((a,i+k),S));
clasohm@0
   855
clasohm@0
   856
clasohm@0
   857
(**** Syntax-related declarations ****)
clasohm@0
   858
clasohm@0
   859
(*** Printing ***)
clasohm@0
   860
wenzelm@14676
   861
(*Makes a variant of a name distinct from the names in bs.
wenzelm@14676
   862
  First attaches the suffix and then increments this;
wenzelm@12306
   863
  preserves a suffix of underscores "_". *)
wenzelm@12306
   864
fun variant bs name =
wenzelm@12306
   865
  let
wenzelm@12306
   866
    val (c, u) = pairself implode (Library.take_suffix (equal "_") (Symbol.explode name));
wenzelm@12902
   867
    fun vary2 c = if ((c ^ u) mem_string bs) then vary2 (Symbol.bump_string c) else c;
wenzelm@14676
   868
    fun vary1 c = if ((c ^ u) mem_string bs) then vary2 (Symbol.bump_init c) else c;
wenzelm@12306
   869
  in vary1 (if c = "" then "u" else c) ^ u end;
clasohm@0
   870
clasohm@0
   871
(*Create variants of the list of names, with priority to the first ones*)
clasohm@0
   872
fun variantlist ([], used) = []
wenzelm@13000
   873
  | variantlist(b::bs, used) =
clasohm@0
   874
      let val b' = variant used b
clasohm@0
   875
      in  b' :: variantlist (bs, b'::used)  end;
clasohm@0
   876
wenzelm@14695
   877
(*Invent fresh names*)
wenzelm@14695
   878
fun invent_names _ _ 0 = []
wenzelm@14695
   879
  | invent_names used a n =
wenzelm@14695
   880
      let val b = Symbol.bump_string a in
wenzelm@14695
   881
        if a mem_string used then invent_names used b n
wenzelm@14695
   882
        else a :: invent_names used b (n - 1)
wenzelm@14695
   883
      end;
wenzelm@11353
   884
wenzelm@16537
   885
wenzelm@4017
   886
(** Consts etc. **)
wenzelm@4017
   887
skalberg@15574
   888
fun add_typ_classes (Type (_, Ts), cs) = foldr add_typ_classes cs Ts
wenzelm@4017
   889
  | add_typ_classes (TFree (_, S), cs) = S union cs
wenzelm@4017
   890
  | add_typ_classes (TVar (_, S), cs) = S union cs;
wenzelm@4017
   891
wenzelm@16294
   892
fun add_typ_tycons (Type (c, Ts), cs) = foldr add_typ_tycons (c ins_string cs) Ts
wenzelm@4017
   893
  | add_typ_tycons (_, cs) = cs;
wenzelm@4017
   894
wenzelm@4017
   895
val add_term_classes = it_term_types add_typ_classes;
wenzelm@4017
   896
val add_term_tycons = it_term_types add_typ_tycons;
wenzelm@4017
   897
wenzelm@9319
   898
fun add_term_consts (Const (c, _), cs) = c ins_string cs
wenzelm@4017
   899
  | add_term_consts (t $ u, cs) = add_term_consts (t, add_term_consts (u, cs))
wenzelm@4017
   900
  | add_term_consts (Abs (_, _, t), cs) = add_term_consts (t, cs)
wenzelm@4017
   901
  | add_term_consts (_, cs) = cs;
wenzelm@4017
   902
obua@16108
   903
fun add_term_constsT (Const c, cs) = c::cs
obua@16108
   904
  | add_term_constsT (t $ u, cs) = add_term_constsT (t, add_term_constsT (u, cs))
obua@16108
   905
  | add_term_constsT (Abs (_, _, t), cs) = add_term_constsT (t, cs)
obua@16108
   906
  | add_term_constsT (_, cs) = cs;
obua@16108
   907
nipkow@13646
   908
fun term_consts t = add_term_consts(t,[]);
nipkow@13646
   909
obua@16108
   910
fun term_constsT t = add_term_constsT(t,[]);
obua@16108
   911
oheimb@4185
   912
fun exists_Const P t = let
wenzelm@9536
   913
        fun ex (Const c      ) = P c
wenzelm@9536
   914
        |   ex (t $ u        ) = ex t orelse ex u
wenzelm@9536
   915
        |   ex (Abs (_, _, t)) = ex t
wenzelm@9536
   916
        |   ex _               = false
oheimb@4185
   917
    in ex t end;
wenzelm@4017
   918
nipkow@4631
   919
fun exists_subterm P =
nipkow@4631
   920
  let fun ex t = P t orelse
nipkow@4631
   921
                 (case t of
nipkow@4631
   922
                    u $ v        => ex u orelse ex v
nipkow@4631
   923
                  | Abs(_, _, u) => ex u
nipkow@4631
   924
                  | _            => false)
nipkow@4631
   925
  in ex end;
nipkow@4631
   926
wenzelm@4017
   927
(*map classes, tycons*)
wenzelm@4017
   928
fun map_typ f g (Type (c, Ts)) = Type (g c, map (map_typ f g) Ts)
wenzelm@4017
   929
  | map_typ f _ (TFree (x, S)) = TFree (x, map f S)
wenzelm@4017
   930
  | map_typ f _ (TVar (xi, S)) = TVar (xi, map f S);
wenzelm@4017
   931
wenzelm@4017
   932
(*map classes, tycons, consts*)
wenzelm@4017
   933
fun map_term f g h (Const (c, T)) = Const (h c, map_typ f g T)
wenzelm@4017
   934
  | map_term f g _ (Free (x, T)) = Free (x, map_typ f g T)
wenzelm@4017
   935
  | map_term f g _ (Var (xi, T)) = Var (xi, map_typ f g T)
wenzelm@4017
   936
  | map_term _ _ _ (t as Bound _) = t
wenzelm@4017
   937
  | map_term f g h (Abs (x, T, t)) = Abs (x, map_typ f g T, map_term f g h t)
wenzelm@4017
   938
  | map_term f g h (t $ u) = map_term f g h t $ map_term f g h u;
wenzelm@4017
   939
wenzelm@4017
   940
clasohm@0
   941
(** TFrees and TVars **)
clasohm@0
   942
clasohm@0
   943
(*maps  (bs,v)  to   v'::bs    this reverses the identifiers bs*)
clasohm@0
   944
fun add_new_id (bs, c) : string list =  variant bs c  ::  bs;
clasohm@0
   945
wenzelm@12802
   946
(*Accumulates the names of Frees in the term, suppressing duplicates.*)
wenzelm@12802
   947
fun add_term_free_names (Free(a,_), bs) = a ins_string bs
wenzelm@12802
   948
  | add_term_free_names (f$u, bs) = add_term_free_names (f, add_term_free_names(u, bs))
wenzelm@12802
   949
  | add_term_free_names (Abs(_,_,t), bs) = add_term_free_names(t,bs)
wenzelm@12802
   950
  | add_term_free_names (_, bs) = bs;
wenzelm@12802
   951
clasohm@0
   952
(*Accumulates the names in the term, suppressing duplicates.
clasohm@0
   953
  Includes Frees and Consts.  For choosing unambiguous bound var names.*)
wenzelm@10666
   954
fun add_term_names (Const(a,_), bs) = NameSpace.base a ins_string bs
paulson@2176
   955
  | add_term_names (Free(a,_), bs) = a ins_string bs
clasohm@0
   956
  | add_term_names (f$u, bs) = add_term_names (f, add_term_names(u, bs))
clasohm@0
   957
  | add_term_names (Abs(_,_,t), bs) = add_term_names(t,bs)
clasohm@0
   958
  | add_term_names (_, bs) = bs;
clasohm@0
   959
clasohm@0
   960
(*Accumulates the TVars in a type, suppressing duplicates. *)
skalberg@15574
   961
fun add_typ_tvars(Type(_,Ts),vs) = foldr add_typ_tvars vs Ts
clasohm@0
   962
  | add_typ_tvars(TFree(_),vs) = vs
wenzelm@16294
   963
  | add_typ_tvars(TVar(v),vs) = insert (op =) v vs;
clasohm@0
   964
clasohm@0
   965
(*Accumulates the TFrees in a type, suppressing duplicates. *)
skalberg@15574
   966
fun add_typ_tfree_names(Type(_,Ts),fs) = foldr add_typ_tfree_names fs Ts
paulson@2176
   967
  | add_typ_tfree_names(TFree(f,_),fs) = f ins_string fs
clasohm@0
   968
  | add_typ_tfree_names(TVar(_),fs) = fs;
clasohm@0
   969
skalberg@15574
   970
fun add_typ_tfrees(Type(_,Ts),fs) = foldr add_typ_tfrees fs Ts
wenzelm@16294
   971
  | add_typ_tfrees(TFree(f),fs) = insert (op =) f fs
clasohm@0
   972
  | add_typ_tfrees(TVar(_),fs) = fs;
clasohm@0
   973
skalberg@15574
   974
fun add_typ_varnames(Type(_,Ts),nms) = foldr add_typ_varnames nms Ts
paulson@2176
   975
  | add_typ_varnames(TFree(nm,_),nms) = nm ins_string nms
paulson@2176
   976
  | add_typ_varnames(TVar((nm,_),_),nms) = nm ins_string nms;
nipkow@949
   977
clasohm@0
   978
(*Accumulates the TVars in a term, suppressing duplicates. *)
clasohm@0
   979
val add_term_tvars = it_term_types add_typ_tvars;
clasohm@0
   980
clasohm@0
   981
(*Accumulates the TFrees in a term, suppressing duplicates. *)
clasohm@0
   982
val add_term_tfrees = it_term_types add_typ_tfrees;
clasohm@0
   983
val add_term_tfree_names = it_term_types add_typ_tfree_names;
clasohm@0
   984
nipkow@949
   985
val add_term_tvarnames = it_term_types add_typ_varnames;
nipkow@949
   986
clasohm@0
   987
(*Non-list versions*)
clasohm@0
   988
fun typ_tfrees T = add_typ_tfrees(T,[]);
clasohm@0
   989
fun typ_tvars T = add_typ_tvars(T,[]);
clasohm@0
   990
fun term_tfrees t = add_term_tfrees(t,[]);
clasohm@0
   991
fun term_tvars t = add_term_tvars(t,[]);
clasohm@0
   992
nipkow@949
   993
(*special code to enforce left-to-right collection of TVar-indexnames*)
nipkow@949
   994
skalberg@15570
   995
fun add_typ_ixns(ixns,Type(_,Ts)) = Library.foldl add_typ_ixns (ixns,Ts)
wenzelm@13000
   996
  | add_typ_ixns(ixns,TVar(ixn,_)) = if mem_ix (ixn, ixns) then ixns
wenzelm@9536
   997
                                     else ixns@[ixn]
nipkow@949
   998
  | add_typ_ixns(ixns,TFree(_)) = ixns;
nipkow@949
   999
nipkow@949
  1000
fun add_term_tvar_ixns(Const(_,T),ixns) = add_typ_ixns(ixns,T)
nipkow@949
  1001
  | add_term_tvar_ixns(Free(_,T),ixns) = add_typ_ixns(ixns,T)
nipkow@949
  1002
  | add_term_tvar_ixns(Var(_,T),ixns) = add_typ_ixns(ixns,T)
nipkow@949
  1003
  | add_term_tvar_ixns(Bound _,ixns) = ixns
nipkow@949
  1004
  | add_term_tvar_ixns(Abs(_,T,t),ixns) =
nipkow@949
  1005
      add_term_tvar_ixns(t,add_typ_ixns(ixns,T))
nipkow@949
  1006
  | add_term_tvar_ixns(f$t,ixns) =
nipkow@949
  1007
      add_term_tvar_ixns(t,add_term_tvar_ixns(f,ixns));
nipkow@949
  1008
wenzelm@16537
  1009
clasohm@0
  1010
(** Frees and Vars **)
clasohm@0
  1011
clasohm@0
  1012
(*a partial ordering (not reflexive) for atomic terms*)
clasohm@0
  1013
fun atless (Const (a,_), Const (b,_))  =  a<b
clasohm@0
  1014
  | atless (Free (a,_), Free (b,_)) =  a<b
clasohm@0
  1015
  | atless (Var(v,_), Var(w,_))  =  xless(v,w)
clasohm@0
  1016
  | atless (Bound i, Bound j)  =   i<j
clasohm@0
  1017
  | atless _  =  false;
clasohm@0
  1018
clasohm@0
  1019
(*insert atomic term into partially sorted list, suppressing duplicates (?)*)
clasohm@0
  1020
fun insert_aterm (t,us) =
clasohm@0
  1021
  let fun inserta [] = [t]
wenzelm@13000
  1022
        | inserta (us as u::us') =
wenzelm@9536
  1023
              if atless(t,u) then t::us
wenzelm@9536
  1024
              else if t=u then us (*duplicate*)
wenzelm@9536
  1025
              else u :: inserta(us')
clasohm@0
  1026
  in  inserta us  end;
clasohm@0
  1027
clasohm@0
  1028
(*Accumulates the Vars in the term, suppressing duplicates*)
clasohm@0
  1029
fun add_term_vars (t, vars: term list) = case t of
clasohm@0
  1030
    Var   _ => insert_aterm(t,vars)
clasohm@0
  1031
  | Abs (_,_,body) => add_term_vars(body,vars)
clasohm@0
  1032
  | f$t =>  add_term_vars (f, add_term_vars(t, vars))
clasohm@0
  1033
  | _ => vars;
clasohm@0
  1034
clasohm@0
  1035
fun term_vars t = add_term_vars(t,[]);
clasohm@0
  1036
clasohm@0
  1037
(*Accumulates the Frees in the term, suppressing duplicates*)
clasohm@0
  1038
fun add_term_frees (t, frees: term list) = case t of
clasohm@0
  1039
    Free   _ => insert_aterm(t,frees)
clasohm@0
  1040
  | Abs (_,_,body) => add_term_frees(body,frees)
clasohm@0
  1041
  | f$t =>  add_term_frees (f, add_term_frees(t, frees))
clasohm@0
  1042
  | _ => frees;
clasohm@0
  1043
clasohm@0
  1044
fun term_frees t = add_term_frees(t,[]);
clasohm@0
  1045
clasohm@0
  1046
(*Given an abstraction over P, replaces the bound variable by a Free variable
clasohm@0
  1047
  having a unique name. *)
clasohm@0
  1048
fun variant_abs (a,T,P) =
clasohm@0
  1049
  let val b = variant (add_term_names(P,[])) a
paulson@2192
  1050
  in  (b,  subst_bound (Free(b,T), P))  end;
clasohm@0
  1051
clasohm@0
  1052
(* renames and reverses the strings in vars away from names *)
clasohm@0
  1053
fun rename_aTs names vars : (string*typ)list =
clasohm@0
  1054
  let fun rename_aT (vars,(a,T)) =
wenzelm@9536
  1055
                (variant (map #1 vars @ names) a, T) :: vars
skalberg@15570
  1056
  in Library.foldl rename_aT ([],vars) end;
clasohm@0
  1057
clasohm@0
  1058
fun rename_wrt_term t = rename_aTs (add_term_names(t,[]));
clasohm@1364
  1059
paulson@1417
  1060
wenzelm@4286
  1061
(* left-ro-right traversal *)
wenzelm@4286
  1062
wenzelm@4286
  1063
(*foldl atoms of type*)
skalberg@15570
  1064
fun foldl_atyps f (x, Type (_, Ts)) = Library.foldl (foldl_atyps f) (x, Ts)
wenzelm@4286
  1065
  | foldl_atyps f x_atom = f x_atom;
wenzelm@4286
  1066
wenzelm@4286
  1067
(*foldl atoms of term*)
wenzelm@4286
  1068
fun foldl_aterms f (x, t $ u) = foldl_aterms f (foldl_aterms f (x, t), u)
wenzelm@4286
  1069
  | foldl_aterms f (x, Abs (_, _, t)) = foldl_aterms f (x, t)
wenzelm@4286
  1070
  | foldl_aterms f x_atom = f x_atom;
wenzelm@4286
  1071
wenzelm@6548
  1072
fun foldl_map_aterms f (x, t $ u) =
wenzelm@6548
  1073
      let val (x', t') = foldl_map_aterms f (x, t); val (x'', u') = foldl_map_aterms f (x', u);
wenzelm@6548
  1074
      in (x'', t' $ u') end
wenzelm@6548
  1075
  | foldl_map_aterms f (x, Abs (a, T, t)) =
wenzelm@6548
  1076
      let val (x', t') = foldl_map_aterms f (x, t) in (x', Abs (a, T, t')) end
wenzelm@6548
  1077
  | foldl_map_aterms f x_atom = f x_atom;
wenzelm@6548
  1078
wenzelm@4286
  1079
(*foldl types of term*)
wenzelm@8609
  1080
fun foldl_term_types f (x, t as Const (_, T)) = f t (x, T)
wenzelm@8609
  1081
  | foldl_term_types f (x, t as Free (_, T)) = f t (x, T)
wenzelm@8609
  1082
  | foldl_term_types f (x, t as Var (_, T)) = f t (x, T)
wenzelm@8609
  1083
  | foldl_term_types f (x, Bound _) = x
wenzelm@8609
  1084
  | foldl_term_types f (x, t as Abs (_, T, b)) = foldl_term_types f (f t (x, T), b)
wenzelm@8609
  1085
  | foldl_term_types f (x, t $ u) = foldl_term_types f (foldl_term_types f (x, t), u);
wenzelm@8609
  1086
wenzelm@8609
  1087
fun foldl_types f = foldl_term_types (fn _ => f);
wenzelm@4286
  1088
wenzelm@12499
  1089
(*collect variables*)
wenzelm@16294
  1090
val add_tvarsT = foldl_atyps (fn (vs, TVar v) => insert (op =) v vs | (vs, _) => vs);
wenzelm@12499
  1091
val add_tvars = foldl_types add_tvarsT;
wenzelm@16294
  1092
val add_vars = foldl_aterms (fn (vs, Var v) => insert (op =) v vs | (vs, _) => vs);
wenzelm@16294
  1093
val add_frees = foldl_aterms (fn (vs, Free v) => insert (op =) v vs | (vs, _) => vs);
wenzelm@12499
  1094
wenzelm@15025
  1095
(*collect variable names*)
wenzelm@15025
  1096
val add_term_varnames = foldl_aterms (fn (xs, Var (x, _)) => ins_ix (x, xs) | (xs, _) => xs);
wenzelm@15025
  1097
fun term_varnames t = add_term_varnames ([], t);
wenzelm@4286
  1098
paulson@1417
  1099
wenzelm@4444
  1100
wenzelm@13000
  1101
(*** Compression of terms and types by sharing common subtrees.
wenzelm@13000
  1102
     Saves 50-75% on storage requirements.  As it is a bit slow,
wenzelm@13000
  1103
     it should be called only for axioms, stored theorems, etc.
wenzelm@13000
  1104
     Recorded term and type fragments are never disposed. ***)
paulson@1417
  1105
wenzelm@16338
  1106
paulson@1417
  1107
(** Sharing of types **)
paulson@1417
  1108
wenzelm@13000
  1109
val memo_types = ref (Typtab.empty: typ Typtab.table);
paulson@1417
  1110
paulson@1417
  1111
fun compress_type T =
wenzelm@13000
  1112
  (case Typtab.lookup (! memo_types, T) of
skalberg@15531
  1113
    SOME T' => T'
skalberg@15531
  1114
  | NONE =>
wenzelm@13000
  1115
      let val T' = (case T of Type (a, Ts) => Type (a, map compress_type Ts) | _ => T)
wenzelm@13000
  1116
      in memo_types := Typtab.update ((T', T'), ! memo_types); T' end);
wenzelm@13000
  1117
paulson@1417
  1118
paulson@1417
  1119
(** Sharing of atomic terms **)
paulson@1417
  1120
wenzelm@13000
  1121
val memo_terms = ref (Termtab.empty : term Termtab.table);
paulson@1417
  1122
paulson@1417
  1123
fun share_term (t $ u) = share_term t $ share_term u
wenzelm@13000
  1124
  | share_term (Abs (a, T, u)) = Abs (a, T, share_term u)
paulson@1417
  1125
  | share_term t =
wenzelm@13000
  1126
      (case Termtab.lookup (! memo_terms, t) of
skalberg@15531
  1127
        SOME t' => t'
skalberg@15531
  1128
      | NONE => (memo_terms := Termtab.update ((t, t), ! memo_terms); t));
paulson@1417
  1129
paulson@1417
  1130
val compress_term = share_term o map_term_types compress_type;
paulson@1417
  1131
wenzelm@4444
  1132
wenzelm@9536
  1133
(* dummy patterns *)
wenzelm@9536
  1134
wenzelm@9536
  1135
val dummy_patternN = "dummy_pattern";
wenzelm@9536
  1136
wenzelm@9536
  1137
fun is_dummy_pattern (Const ("dummy_pattern", _)) = true
wenzelm@9536
  1138
  | is_dummy_pattern _ = false;
wenzelm@9536
  1139
wenzelm@9536
  1140
fun no_dummy_patterns tm =
wenzelm@9536
  1141
  if not (foldl_aterms (fn (b, t) => b orelse is_dummy_pattern t) (false, tm)) then tm
wenzelm@9536
  1142
  else raise TERM ("Illegal occurrence of '_' dummy pattern", [tm]);
wenzelm@9536
  1143
wenzelm@11903
  1144
fun replace_dummy Ts (i, Const ("dummy_pattern", T)) =
wenzelm@11903
  1145
      (i + 1, list_comb (Var (("_dummy_", i), Ts ---> T), map Bound (0 upto length Ts - 1)))
wenzelm@11903
  1146
  | replace_dummy Ts (i, Abs (x, T, t)) =
wenzelm@11903
  1147
      let val (i', t') = replace_dummy (T :: Ts) (i, t)
wenzelm@11903
  1148
      in (i', Abs (x, T, t')) end
wenzelm@11903
  1149
  | replace_dummy Ts (i, t $ u) =
wenzelm@11903
  1150
      let val (i', t') = replace_dummy Ts (i, t); val (i'', u') = replace_dummy Ts (i', u)
wenzelm@11903
  1151
      in (i'', t' $ u') end
wenzelm@11903
  1152
  | replace_dummy _ (i, a) = (i, a);
wenzelm@11903
  1153
wenzelm@11903
  1154
val replace_dummy_patterns = replace_dummy [];
wenzelm@9536
  1155
wenzelm@10552
  1156
fun is_replaced_dummy_pattern ("_dummy_", _) = true
wenzelm@10552
  1157
  | is_replaced_dummy_pattern _ = false;
wenzelm@9536
  1158
wenzelm@16035
  1159
fun show_dummy_patterns (Var (("_dummy_", _), T)) = Const ("dummy_pattern", T)
wenzelm@16035
  1160
  | show_dummy_patterns (t $ u) = show_dummy_patterns t $ show_dummy_patterns u
wenzelm@16035
  1161
  | show_dummy_patterns (Abs (x, T, t)) = Abs (x, T, show_dummy_patterns t)
wenzelm@16035
  1162
  | show_dummy_patterns a = a;
wenzelm@16035
  1163
wenzelm@13484
  1164
wenzelm@13484
  1165
(* adhoc freezing *)
wenzelm@13484
  1166
wenzelm@13484
  1167
fun adhoc_freeze_vars tm =
wenzelm@13484
  1168
  let
wenzelm@13484
  1169
    fun mk_inst (var as Var ((a, i), T)) =
wenzelm@13484
  1170
      let val x = a ^ Library.gensym "_" ^ string_of_int i
wenzelm@13484
  1171
      in ((var,  Free(x, T)), x) end;
wenzelm@13484
  1172
    val (insts, xs) = split_list (map mk_inst (term_vars tm));
wenzelm@13484
  1173
  in (subst_atomic insts tm, xs) end;
wenzelm@13484
  1174
wenzelm@13484
  1175
wenzelm@14786
  1176
(* string_of_vname *)
wenzelm@14786
  1177
wenzelm@15986
  1178
val show_question_marks = ref true;
berghofe@15472
  1179
wenzelm@14786
  1180
fun string_of_vname (x, i) =
wenzelm@14786
  1181
  let
wenzelm@15986
  1182
    val question_mark = if ! show_question_marks then "?" else "";
wenzelm@15986
  1183
    val idx = string_of_int i;
wenzelm@15986
  1184
    val dot =
wenzelm@15986
  1185
      (case rev (Symbol.explode x) of
wenzelm@15986
  1186
        _ :: "\\<^isub>" :: _ => false
wenzelm@15986
  1187
      | _ :: "\\<^isup>" :: _ => false
wenzelm@15986
  1188
      | c :: _ => Symbol.is_digit c
wenzelm@15986
  1189
      | _ => true);
wenzelm@14786
  1190
  in
wenzelm@15986
  1191
    if dot then question_mark ^ x ^ "." ^ idx
wenzelm@15986
  1192
    else if i <> 0 then question_mark ^ x ^ idx
wenzelm@15986
  1193
    else question_mark ^ x
wenzelm@14786
  1194
  end;
wenzelm@14786
  1195
wenzelm@14786
  1196
fun string_of_vname' (x, ~1) = x
wenzelm@14786
  1197
  | string_of_vname' xi = string_of_vname xi;
wenzelm@14786
  1198
nipkow@15612
  1199
fun string_of_term (Const(s,_)) = s
nipkow@15612
  1200
  | string_of_term (Free(s,_)) = s
nipkow@15612
  1201
  | string_of_term (Var(ix,_)) = string_of_vname ix
nipkow@15612
  1202
  | string_of_term (Bound i) = string_of_int i
nipkow@15612
  1203
  | string_of_term (Abs(x,_,t)) = "%" ^ x ^ ". " ^ string_of_term t
nipkow@15612
  1204
  | string_of_term (s $ t) =
nipkow@15612
  1205
      "(" ^ string_of_term s ^ " " ^ string_of_term t ^ ")"
nipkow@15612
  1206
clasohm@1364
  1207
end;
clasohm@1364
  1208
wenzelm@4444
  1209
structure BasicTerm: BASIC_TERM = Term;
wenzelm@4444
  1210
open BasicTerm;