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