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