src/Pure/library.ML
author wenzelm
Wed Nov 25 14:11:24 1998 +0100 (1998-11-25)
changeset 5966 60f80b2a2777
parent 5949 1e1d997e5c10
child 6282 589671bebbb3
permissions -rw-r--r--
removed prs / prs_fn (broken, because it did not include \n in its
semantics, forcing writeln to add one uncoditionally);
replaced prs_fn by writeln fn;
wenzelm@41
     1
(*  Title:      Pure/library.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@233
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   1992  University of Cambridge
clasohm@0
     5
wenzelm@233
     6
Basic library: functions, options, pairs, booleans, lists, integers,
wenzelm@4212
     7
strings, lists as sets, association lists, generic tables, balanced
wenzelm@4621
     8
trees, orders, I/O and diagnostics, timing, misc.
clasohm@0
     9
*)
clasohm@0
    10
wenzelm@4212
    11
infix |> ~~ \ \\ ins ins_string ins_int orf andf prefix upto downto
wenzelm@4212
    12
  mem mem_int mem_string union union_int union_string inter inter_int
wenzelm@4212
    13
  inter_string subset subset_int subset_string;
clasohm@1364
    14
wenzelm@5893
    15
infix 3 oo ooo;
wenzelm@5893
    16
wenzelm@4621
    17
signature LIBRARY =
wenzelm@4621
    18
sig
wenzelm@4621
    19
  (*functions*)
wenzelm@4621
    20
  val curry: ('a * 'b -> 'c) -> 'a -> 'b -> 'c
wenzelm@4621
    21
  val uncurry: ('a -> 'b -> 'c) -> 'a * 'b -> 'c
wenzelm@4621
    22
  val I: 'a -> 'a
wenzelm@4621
    23
  val K: 'a -> 'b -> 'a
wenzelm@4621
    24
  val |> : 'a * ('a -> 'b) -> 'b
wenzelm@4621
    25
  val apl: 'a * ('a * 'b -> 'c) -> 'b -> 'c
wenzelm@4621
    26
  val apr: ('a * 'b -> 'c) * 'b -> 'a -> 'c
wenzelm@4621
    27
  val funpow: int -> ('a -> 'a) -> 'a -> 'a
wenzelm@5893
    28
  val oo: ('a -> 'b) * ('c -> 'd -> 'a) -> 'c -> 'd -> 'b
wenzelm@5893
    29
  val ooo: ('a -> 'b) * ('c -> 'd -> 'e -> 'a) -> 'c -> 'd -> 'e -> 'b
clasohm@1364
    30
wenzelm@4621
    31
  (*stamps*)
wenzelm@4621
    32
  type stamp
wenzelm@4621
    33
  val stamp: unit -> stamp
wenzelm@4621
    34
wenzelm@4621
    35
  (*options*)
wenzelm@4621
    36
  datatype 'a option = None | Some of 'a
wenzelm@4621
    37
  exception OPTION
wenzelm@4621
    38
  val the: 'a option -> 'a
wenzelm@4621
    39
  val if_none: 'a option -> 'a -> 'a
wenzelm@4621
    40
  val is_some: 'a option -> bool
wenzelm@4621
    41
  val is_none: 'a option -> bool
wenzelm@4621
    42
  val apsome: ('a -> 'b) -> 'a option -> 'b option
wenzelm@4621
    43
  val can: ('a -> 'b) -> 'a -> bool
wenzelm@4621
    44
  val try: ('a -> 'b) -> 'a -> 'b option
wenzelm@4621
    45
wenzelm@4621
    46
  (*pairs*)
wenzelm@4621
    47
  val pair: 'a -> 'b -> 'a * 'b
wenzelm@4621
    48
  val rpair: 'a -> 'b -> 'b * 'a
wenzelm@4621
    49
  val fst: 'a * 'b -> 'a
wenzelm@4621
    50
  val snd: 'a * 'b -> 'b
wenzelm@4621
    51
  val eq_fst: (''a * 'b) * (''a * 'c) -> bool
wenzelm@4621
    52
  val eq_snd: ('a * ''b) * ('c * ''b) -> bool
wenzelm@4621
    53
  val swap: 'a * 'b -> 'b * 'a
wenzelm@4621
    54
  val apfst: ('a -> 'b) -> 'a * 'c -> 'b * 'c
wenzelm@4621
    55
  val apsnd: ('a -> 'b) -> 'c * 'a -> 'c * 'b
wenzelm@4621
    56
  val pairself: ('a -> 'b) -> 'a * 'a -> 'b * 'b
wenzelm@4621
    57
wenzelm@4621
    58
  (*booleans*)
wenzelm@4621
    59
  val equal: ''a -> ''a -> bool
wenzelm@4621
    60
  val not_equal: ''a -> ''a -> bool
wenzelm@4621
    61
  val orf: ('a -> bool) * ('a -> bool) -> 'a -> bool
wenzelm@4621
    62
  val andf: ('a -> bool) * ('a -> bool) -> 'a -> bool
wenzelm@4621
    63
  val exists: ('a -> bool) -> 'a list -> bool
wenzelm@4621
    64
  val forall: ('a -> bool) -> 'a list -> bool
wenzelm@4621
    65
  val set: bool ref -> bool
wenzelm@4621
    66
  val reset: bool ref -> bool
wenzelm@4621
    67
  val toggle: bool ref -> bool
wenzelm@4621
    68
  val setmp: 'a ref -> 'a -> ('b -> 'c) -> 'b -> 'c
wenzelm@4621
    69
wenzelm@4621
    70
  (*lists*)
wenzelm@4621
    71
  exception LIST of string
wenzelm@4621
    72
  val null: 'a list -> bool
wenzelm@4621
    73
  val hd: 'a list -> 'a
wenzelm@4621
    74
  val tl: 'a list -> 'a list
wenzelm@4621
    75
  val cons: 'a -> 'a list -> 'a list
wenzelm@5285
    76
  val single: 'a -> 'a list
wenzelm@4629
    77
  val append: 'a list -> 'a list -> 'a list
wenzelm@5904
    78
  val apply: ('a -> 'a) list -> 'a -> 'a
wenzelm@4621
    79
  val foldl: ('a * 'b -> 'a) -> 'a * 'b list -> 'a
wenzelm@4621
    80
  val foldr: ('a * 'b -> 'b) -> 'a list * 'b -> 'b
wenzelm@4621
    81
  val foldr1: ('a * 'a -> 'a) -> 'a list -> 'a
wenzelm@4956
    82
  val foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list
wenzelm@4621
    83
  val length: 'a list -> int
wenzelm@4621
    84
  val take: int * 'a list -> 'a list
wenzelm@4621
    85
  val drop: int * 'a list -> 'a list
nipkow@4713
    86
  val dropwhile: ('a -> bool) -> 'a list -> 'a list
wenzelm@4621
    87
  val nth_elem: int * 'a list -> 'a
wenzelm@4621
    88
  val last_elem: 'a list -> 'a
wenzelm@4621
    89
  val split_last: 'a list -> 'a list * 'a
wenzelm@4893
    90
  val nth_update: 'a -> int * 'a list -> 'a list
wenzelm@4621
    91
  val find_index: ('a -> bool) -> 'a list -> int
wenzelm@4621
    92
  val find_index_eq: ''a -> ''a list -> int
wenzelm@4621
    93
  val find_first: ('a -> bool) -> 'a list -> 'a option
wenzelm@4916
    94
  val get_first: ('a -> 'b option) -> 'a list -> 'b option
wenzelm@4621
    95
  val flat: 'a list list -> 'a list
wenzelm@4621
    96
  val seq: ('a -> unit) -> 'a list -> unit
wenzelm@4621
    97
  val separate: 'a -> 'a list -> 'a list
wenzelm@4621
    98
  val replicate: int -> 'a -> 'a list
wenzelm@4621
    99
  val multiply: 'a list * 'a list list -> 'a list list
wenzelm@4621
   100
  val filter: ('a -> bool) -> 'a list -> 'a list
wenzelm@4621
   101
  val filter_out: ('a -> bool) -> 'a list -> 'a list
wenzelm@4621
   102
  val mapfilter: ('a -> 'b option) -> 'a list -> 'b list
wenzelm@4621
   103
  val map2: ('a * 'b -> 'c) -> 'a list * 'b list -> 'c list
wenzelm@4621
   104
  val exists2: ('a * 'b -> bool) -> 'a list * 'b list -> bool
wenzelm@4621
   105
  val forall2: ('a * 'b -> bool) -> 'a list * 'b list -> bool
wenzelm@4956
   106
  val seq2: ('a * 'b -> unit) -> 'a list * 'b list -> unit
wenzelm@4621
   107
  val ~~ : 'a list * 'b list -> ('a * 'b) list
wenzelm@4621
   108
  val split_list: ('a * 'b) list -> 'a list * 'b list
wenzelm@4621
   109
  val prefix: ''a list * ''a list -> bool
wenzelm@4621
   110
  val take_prefix: ('a -> bool) -> 'a list -> 'a list * 'a list
wenzelm@4621
   111
  val take_suffix: ('a -> bool) -> 'a list -> 'a list * 'a list
wenzelm@4621
   112
wenzelm@4621
   113
  (*integers*)
wenzelm@4621
   114
  val inc: int ref -> int
wenzelm@4621
   115
  val dec: int ref -> int
wenzelm@4621
   116
  val upto: int * int -> int list
wenzelm@4621
   117
  val downto: int * int -> int list
wenzelm@4621
   118
  val downto0: int list * int -> bool
wenzelm@4621
   119
  val radixpand: int * int -> int list
wenzelm@4621
   120
  val radixstring: int * string * int -> string
wenzelm@4621
   121
  val string_of_int: int -> string
wenzelm@4621
   122
  val string_of_indexname: string * int -> string
wenzelm@4621
   123
wenzelm@4621
   124
  (*strings*)
wenzelm@4621
   125
  val enclose: string -> string -> string -> string
wenzelm@4621
   126
  val quote: string -> string
wenzelm@4621
   127
  val space_implode: string -> string list -> string
wenzelm@4621
   128
  val commas: string list -> string
wenzelm@4621
   129
  val commas_quote: string list -> string
wenzelm@4621
   130
  val cat_lines: string list -> string
wenzelm@4621
   131
  val space_explode: string -> string -> string list
wenzelm@5942
   132
  val std_output: string -> unit
wenzelm@5942
   133
  val prefix_lines: string -> string -> string
wenzelm@4621
   134
  val split_lines: string -> string list
wenzelm@5285
   135
  val suffix: string -> string -> string
wenzelm@5285
   136
  val unsuffix: string -> string -> string
wenzelm@4621
   137
wenzelm@4621
   138
  (*lists as sets*)
wenzelm@4621
   139
  val mem: ''a * ''a list -> bool
wenzelm@4621
   140
  val mem_int: int * int list -> bool
wenzelm@4621
   141
  val mem_string: string * string list -> bool
wenzelm@4621
   142
  val gen_mem: ('a * 'b -> bool) -> 'a * 'b list -> bool
wenzelm@4621
   143
  val ins: ''a * ''a list -> ''a list
wenzelm@4621
   144
  val ins_int: int * int list -> int list
wenzelm@4621
   145
  val ins_string: string * string list -> string list
wenzelm@4621
   146
  val gen_ins: ('a * 'a -> bool) -> 'a * 'a list -> 'a list
wenzelm@4621
   147
  val union: ''a list * ''a list -> ''a list
wenzelm@4621
   148
  val union_int: int list * int list -> int list
wenzelm@4621
   149
  val union_string: string list * string list -> string list
wenzelm@4621
   150
  val gen_union: ('a * 'a -> bool) -> 'a list * 'a list -> 'a list
wenzelm@4621
   151
  val inter: ''a list * ''a list -> ''a list
wenzelm@4621
   152
  val inter_int: int list * int list -> int list
wenzelm@4621
   153
  val inter_string: string list * string list -> string list
wenzelm@4621
   154
  val subset: ''a list * ''a list -> bool
wenzelm@4621
   155
  val subset_int: int list * int list -> bool
wenzelm@4621
   156
  val subset_string: string list * string list -> bool
wenzelm@4621
   157
  val eq_set: ''a list * ''a list -> bool
wenzelm@4621
   158
  val eq_set_string: string list * string list -> bool
wenzelm@4621
   159
  val gen_subset: ('a * 'b -> bool) -> 'a list * 'b list -> bool
wenzelm@4621
   160
  val \ : ''a list * ''a -> ''a list
wenzelm@4621
   161
  val \\ : ''a list * ''a list -> ''a list
wenzelm@4621
   162
  val gen_rem: ('a * 'b -> bool) -> 'a list * 'b -> 'a list
wenzelm@4621
   163
  val gen_rems: ('a * 'b -> bool) -> 'a list * 'b list -> 'a list
wenzelm@4621
   164
  val gen_distinct: ('a * 'a -> bool) -> 'a list -> 'a list
wenzelm@4621
   165
  val distinct: ''a list -> ''a list
wenzelm@4621
   166
  val findrep: ''a list -> ''a list
wenzelm@4621
   167
  val gen_duplicates: ('a * 'a -> bool) -> 'a list -> 'a list
wenzelm@4621
   168
  val duplicates: ''a list -> ''a list
wenzelm@4621
   169
wenzelm@4621
   170
  (*association lists*)
wenzelm@4621
   171
  val assoc: (''a * 'b) list * ''a -> 'b option
wenzelm@4621
   172
  val assoc_int: (int * 'a) list * int -> 'a option
wenzelm@4621
   173
  val assoc_string: (string * 'a) list * string -> 'a option
wenzelm@4621
   174
  val assoc_string_int: ((string * int) * 'a) list * (string * int) -> 'a option
wenzelm@4621
   175
  val assocs: (''a * 'b list) list -> ''a -> 'b list
wenzelm@4621
   176
  val assoc2: (''a * (''b * 'c) list) list * (''a * ''b) -> 'c option
wenzelm@4621
   177
  val gen_assoc: ('a * 'b -> bool) -> ('b * 'c) list * 'a -> 'c option
wenzelm@4621
   178
  val overwrite: (''a * 'b) list * (''a * 'b) -> (''a * 'b) list
wenzelm@4621
   179
  val gen_overwrite: ('a * 'a -> bool) -> ('a * 'b) list * ('a * 'b) -> ('a * 'b) list
wenzelm@4621
   180
wenzelm@4621
   181
  (*generic tables*)
wenzelm@4621
   182
  val generic_extend: ('a * 'a -> bool)
wenzelm@4621
   183
    -> ('b -> 'a list) -> ('a list -> 'b) -> 'b -> 'a list -> 'b
wenzelm@4621
   184
  val generic_merge: ('a * 'a -> bool) -> ('b -> 'a list) -> ('a list -> 'b) -> 'b -> 'b -> 'b
wenzelm@4621
   185
  val extend_list: ''a list -> ''a list -> ''a list
wenzelm@4621
   186
  val merge_lists: ''a list -> ''a list -> ''a list
wenzelm@4692
   187
  val merge_alists: (''a * 'b) list -> (''a * 'b) list -> (''a * 'b) list
wenzelm@4621
   188
  val merge_rev_lists: ''a list -> ''a list -> ''a list
wenzelm@4621
   189
wenzelm@4621
   190
  (*balanced trees*)
wenzelm@4621
   191
  exception Balance
wenzelm@4621
   192
  val fold_bal: ('a * 'a -> 'a) -> 'a list -> 'a
wenzelm@4621
   193
  val access_bal: ('a -> 'a) * ('a -> 'a) * 'a -> int -> int -> 'a
wenzelm@4621
   194
  val accesses_bal: ('a -> 'a) * ('a -> 'a) * 'a -> int -> 'a list
wenzelm@4621
   195
wenzelm@4621
   196
  (*orders*)
wenzelm@4621
   197
  datatype order = EQUAL | GREATER | LESS
wenzelm@4621
   198
  val rev_order: order -> order
wenzelm@4621
   199
  val make_ord: ('a * 'a -> bool) -> 'a * 'a -> order
wenzelm@4621
   200
  val int_ord: int * int -> order
wenzelm@4621
   201
  val string_ord: string * string -> order
wenzelm@4621
   202
  val prod_ord: ('a * 'b -> order) -> ('c * 'd -> order) -> ('a * 'c) * ('b * 'd) -> order
wenzelm@4621
   203
  val dict_ord: ('a * 'b -> order) -> 'a list * 'b list -> order
wenzelm@4621
   204
  val list_ord: ('a * 'b -> order) -> 'a list * 'b list -> order
wenzelm@4621
   205
  val sort: ('a * 'a -> order) -> 'a list -> 'a list
wenzelm@4621
   206
  val sort_strings: string list -> string list
wenzelm@4621
   207
  val sort_wrt: ('a -> string) -> 'a list -> 'a list
wenzelm@4621
   208
wenzelm@4621
   209
  (*I/O and diagnostics*)
wenzelm@4621
   210
  val cd: string -> unit
wenzelm@4621
   211
  val pwd: unit -> string
wenzelm@5966
   212
  val writeln_fn: (string -> unit) ref
wenzelm@4621
   213
  val warning_fn: (string -> unit) ref
wenzelm@4621
   214
  val error_fn: (string -> unit) ref
wenzelm@4621
   215
  val writeln: string -> unit
wenzelm@4621
   216
  val warning: string -> unit
wenzelm@4621
   217
  exception ERROR
wenzelm@4621
   218
  val error_msg: string -> unit
wenzelm@4621
   219
  val error: string -> 'a
wenzelm@4621
   220
  val sys_error: string -> 'a
wenzelm@4621
   221
  val assert: bool -> string -> unit
wenzelm@4621
   222
  val deny: bool -> string -> unit
wenzelm@4621
   223
  val assert_all: ('a -> bool) -> 'a list -> ('a -> string) -> unit
wenzelm@4621
   224
  datatype 'a error = Error of string | OK of 'a
wenzelm@4621
   225
  val get_error: 'a error -> string option
wenzelm@4621
   226
  val get_ok: 'a error -> 'a option
wenzelm@4621
   227
  val handle_error: ('a -> 'b) -> 'a -> 'b error
wenzelm@4923
   228
  exception ERROR_MESSAGE of string
wenzelm@4923
   229
  val transform_error: ('a -> 'b) -> 'a -> 'b
wenzelm@5904
   230
  val transform_failure: (exn -> exn) -> ('a -> 'b) -> 'a -> 'b
wenzelm@4621
   231
wenzelm@4621
   232
  (*timing*)
wenzelm@4621
   233
  val cond_timeit: bool -> (unit -> 'a) -> 'a
wenzelm@4621
   234
  val timeit: (unit -> 'a) -> 'a
wenzelm@4621
   235
  val timeap: ('a -> 'b) -> 'a -> 'b
wenzelm@4621
   236
wenzelm@4621
   237
  (*misc*)
wenzelm@4621
   238
  val make_keylist: ('a -> 'b) -> 'a list -> ('a * 'b) list
wenzelm@4621
   239
  val keyfilter: ('a * ''b) list -> ''b -> 'a list
wenzelm@4621
   240
  val partition: ('a -> bool) -> 'a list -> 'a list * 'a list
wenzelm@4621
   241
  val partition_eq: ('a * 'a -> bool) -> 'a list -> 'a list list
wenzelm@4621
   242
  val partition_list: (int -> 'a -> bool) -> int -> int -> 'a list -> 'a list list
wenzelm@4621
   243
  val transitive_closure: (string * string list) list -> (string * string list) list
wenzelm@4621
   244
  val init_gensym: unit -> unit
wenzelm@4621
   245
  val gensym: string -> string
wenzelm@4621
   246
  val bump_int_list: string list -> string list
wenzelm@4621
   247
  val bump_list: string list * string -> string list
wenzelm@4621
   248
  val bump_string: string -> string
wenzelm@4621
   249
  val scanwords: (string -> bool) -> string list -> string list
wenzelm@4621
   250
  datatype 'a mtree = Join of 'a * 'a mtree list
wenzelm@4621
   251
end;
wenzelm@4621
   252
wenzelm@4621
   253
structure Library: LIBRARY =
clasohm@1364
   254
struct
clasohm@0
   255
wenzelm@4995
   256
wenzelm@233
   257
(** functions **)
clasohm@0
   258
wenzelm@233
   259
(*handy combinators*)
wenzelm@233
   260
fun curry f x y = f (x, y);
wenzelm@233
   261
fun uncurry f (x, y) = f x y;
wenzelm@233
   262
fun I x = x;
wenzelm@233
   263
fun K x y = x;
clasohm@0
   264
wenzelm@380
   265
(*reverse apply*)
wenzelm@410
   266
fun (x |> f) = f x;
wenzelm@380
   267
wenzelm@233
   268
(*application of (infix) operator to its left or right argument*)
wenzelm@233
   269
fun apl (x, f) y = f (x, y);
wenzelm@233
   270
fun apr (f, y) x = f (x, y);
clasohm@0
   271
wenzelm@233
   272
(*function exponentiation: f(...(f x)...) with n applications of f*)
wenzelm@233
   273
fun funpow n f x =
wenzelm@233
   274
  let fun rep (0, x) = x
wenzelm@233
   275
        | rep (n, x) = rep (n - 1, f x)
wenzelm@233
   276
  in rep (n, x) end;
wenzelm@160
   277
wenzelm@5893
   278
(*concatenation: 2 and 3 args*)
wenzelm@5893
   279
fun (f oo g) x y = f (g x y);
wenzelm@5893
   280
fun (f ooo g) x y z = f (g x y z);
wenzelm@160
   281
wenzelm@160
   282
wenzelm@2471
   283
(** stamps **)
wenzelm@2471
   284
wenzelm@2471
   285
type stamp = unit ref;
wenzelm@2471
   286
val stamp: unit -> stamp = ref;
wenzelm@2471
   287
wenzelm@2471
   288
wenzelm@2471
   289
wenzelm@233
   290
(** options **)
clasohm@0
   291
clasohm@0
   292
datatype 'a option = None | Some of 'a;
clasohm@0
   293
wenzelm@4139
   294
exception OPTION;
clasohm@0
   295
clasohm@0
   296
fun the (Some x) = x
wenzelm@4139
   297
  | the None = raise OPTION;
clasohm@0
   298
wenzelm@4212
   299
(*strict!*)
wenzelm@255
   300
fun if_none None y = y
wenzelm@255
   301
  | if_none (Some x) _ = x;
wenzelm@255
   302
clasohm@0
   303
fun is_some (Some _) = true
clasohm@0
   304
  | is_some None = false;
clasohm@0
   305
clasohm@0
   306
fun is_none (Some _) = false
clasohm@0
   307
  | is_none None = true;
clasohm@0
   308
wenzelm@233
   309
fun apsome f (Some x) = Some (f x)
wenzelm@233
   310
  | apsome _ None = None;
clasohm@0
   311
wenzelm@4139
   312
(*handle partial functions*)
wenzelm@4181
   313
fun can f x = (f x; true) handle _ => false;
wenzelm@4139
   314
fun try f x = Some (f x) handle _ => None;
wenzelm@4139
   315
wenzelm@4139
   316
wenzelm@4139
   317
wenzelm@233
   318
(** pairs **)
wenzelm@233
   319
wenzelm@233
   320
fun pair x y = (x, y);
wenzelm@233
   321
fun rpair x y = (y, x);
wenzelm@233
   322
wenzelm@233
   323
fun fst (x, y) = x;
wenzelm@233
   324
fun snd (x, y) = y;
wenzelm@233
   325
wenzelm@233
   326
fun eq_fst ((x1, _), (x2, _)) = x1 = x2;
wenzelm@233
   327
fun eq_snd ((_, y1), (_, y2)) = y1 = y2;
wenzelm@233
   328
wenzelm@233
   329
fun swap (x, y) = (y, x);
wenzelm@233
   330
wenzelm@4212
   331
(*apply function to components*)
wenzelm@233
   332
fun apfst f (x, y) = (f x, y);
wenzelm@233
   333
fun apsnd f (x, y) = (x, f y);
wenzelm@4212
   334
fun pairself f (x, y) = (f x, f y);
wenzelm@233
   335
wenzelm@233
   336
wenzelm@233
   337
wenzelm@233
   338
(** booleans **)
wenzelm@233
   339
wenzelm@233
   340
(* equality *)
wenzelm@233
   341
wenzelm@233
   342
fun equal x y = x = y;
wenzelm@233
   343
fun not_equal x y = x <> y;
wenzelm@233
   344
wenzelm@233
   345
wenzelm@233
   346
(* operators for combining predicates *)
wenzelm@233
   347
paulson@2175
   348
fun (p orf q) = fn x => p x orelse q x;
paulson@2175
   349
fun (p andf q) = fn x => p x andalso q x;
wenzelm@233
   350
wenzelm@233
   351
wenzelm@233
   352
(* predicates on lists *)
wenzelm@233
   353
wenzelm@233
   354
(*exists pred [x1, ..., xn] ===> pred x1 orelse ... orelse pred xn*)
wenzelm@233
   355
fun exists (pred: 'a -> bool) : 'a list -> bool =
wenzelm@233
   356
  let fun boolf [] = false
wenzelm@233
   357
        | boolf (x :: xs) = pred x orelse boolf xs
wenzelm@233
   358
  in boolf end;
wenzelm@233
   359
wenzelm@233
   360
(*forall pred [x1, ..., xn] ===> pred x1 andalso ... andalso pred xn*)
wenzelm@233
   361
fun forall (pred: 'a -> bool) : 'a list -> bool =
wenzelm@233
   362
  let fun boolf [] = true
wenzelm@233
   363
        | boolf (x :: xs) = pred x andalso boolf xs
wenzelm@233
   364
  in boolf end;
clasohm@0
   365
wenzelm@233
   366
wenzelm@380
   367
(* flags *)
wenzelm@380
   368
wenzelm@380
   369
fun set flag = (flag := true; true);
wenzelm@380
   370
fun reset flag = (flag := false; false);
wenzelm@380
   371
fun toggle flag = (flag := not (! flag); ! flag);
wenzelm@380
   372
wenzelm@4212
   373
(*temporarily set flag, handling errors*)
wenzelm@2978
   374
fun setmp flag value f x =
wenzelm@2958
   375
  let
wenzelm@2958
   376
    val orig_value = ! flag;
wenzelm@2958
   377
    fun return y = (flag := orig_value; y);
wenzelm@2958
   378
  in
wenzelm@2958
   379
    flag := value;
wenzelm@2958
   380
    return (f x handle exn => (return (); raise exn))
wenzelm@2958
   381
  end;
wenzelm@2958
   382
wenzelm@380
   383
wenzelm@233
   384
wenzelm@233
   385
(** lists **)
wenzelm@233
   386
wenzelm@233
   387
exception LIST of string;
wenzelm@233
   388
wenzelm@233
   389
fun null [] = true
wenzelm@233
   390
  | null (_ :: _) = false;
wenzelm@233
   391
wenzelm@233
   392
fun hd [] = raise LIST "hd"
wenzelm@233
   393
  | hd (x :: _) = x;
wenzelm@233
   394
wenzelm@233
   395
fun tl [] = raise LIST "tl"
wenzelm@233
   396
  | tl (_ :: xs) = xs;
wenzelm@233
   397
wenzelm@233
   398
fun cons x xs = x :: xs;
wenzelm@5285
   399
fun single x = [x];
wenzelm@233
   400
wenzelm@4629
   401
fun append xs ys = xs @ ys;
wenzelm@4629
   402
wenzelm@5904
   403
fun apply [] x = x
wenzelm@5904
   404
  | apply (f :: fs) x = apply fs (f x);
wenzelm@5904
   405
wenzelm@233
   406
wenzelm@233
   407
(* fold *)
wenzelm@233
   408
wenzelm@233
   409
(*the following versions of fold are designed to fit nicely with infixes*)
clasohm@0
   410
wenzelm@233
   411
(*  (op @) (e, [x1, ..., xn])  ===>  ((e @ x1) @ x2) ... @ xn
wenzelm@233
   412
    for operators that associate to the left (TAIL RECURSIVE)*)
wenzelm@233
   413
fun foldl (f: 'a * 'b -> 'a) : 'a * 'b list -> 'a =
wenzelm@233
   414
  let fun itl (e, [])  = e
wenzelm@233
   415
        | itl (e, a::l) = itl (f(e, a), l)
wenzelm@233
   416
  in  itl end;
wenzelm@233
   417
wenzelm@233
   418
(*  (op @) ([x1, ..., xn], e)  ===>   x1 @ (x2 ... @ (xn @ e))
wenzelm@233
   419
    for operators that associate to the right (not tail recursive)*)
wenzelm@233
   420
fun foldr f (l, e) =
wenzelm@233
   421
  let fun itr [] = e
wenzelm@233
   422
        | itr (a::l) = f(a, itr l)
wenzelm@233
   423
  in  itr l  end;
wenzelm@233
   424
wenzelm@233
   425
(*  (op @) [x1, ..., xn]  ===>   x1 @ (x2 ... @ (x[n-1] @ xn))
wenzelm@233
   426
    for n > 0, operators that associate to the right (not tail recursive)*)
wenzelm@233
   427
fun foldr1 f l =
wenzelm@4181
   428
  let fun itr [x] = x
wenzelm@233
   429
        | itr (x::l) = f(x, itr l)
wenzelm@233
   430
  in  itr l  end;
wenzelm@233
   431
wenzelm@4956
   432
fun foldl_map _ (x, []) = (x, [])
wenzelm@4956
   433
  | foldl_map f (x, y :: ys) =
wenzelm@4956
   434
      let
wenzelm@4956
   435
        val (x', y') = f (x, y);
wenzelm@4956
   436
        val (x'', ys') = foldl_map f (x', ys);
wenzelm@4956
   437
      in (x'', y' :: ys') end;
wenzelm@4956
   438
wenzelm@233
   439
wenzelm@233
   440
(* basic list functions *)
wenzelm@233
   441
wenzelm@233
   442
(*length of a list, should unquestionably be a standard function*)
wenzelm@233
   443
local fun length1 (n, [])  = n   (*TAIL RECURSIVE*)
wenzelm@233
   444
        | length1 (n, x :: xs) = length1 (n + 1, xs)
wenzelm@233
   445
in  fun length l = length1 (0, l) end;
wenzelm@233
   446
wenzelm@233
   447
(*take the first n elements from a list*)
wenzelm@233
   448
fun take (n, []) = []
wenzelm@233
   449
  | take (n, x :: xs) =
wenzelm@233
   450
      if n > 0 then x :: take (n - 1, xs) else [];
wenzelm@233
   451
wenzelm@233
   452
(*drop the first n elements from a list*)
wenzelm@233
   453
fun drop (n, []) = []
wenzelm@233
   454
  | drop (n, x :: xs) =
wenzelm@233
   455
      if n > 0 then drop (n - 1, xs) else x :: xs;
clasohm@0
   456
nipkow@4713
   457
fun dropwhile P [] = []
nipkow@4713
   458
  | dropwhile P (ys as x::xs) = if P x then dropwhile P xs else ys;
nipkow@4713
   459
wenzelm@233
   460
(*return nth element of a list, where 0 designates the first element;
wenzelm@233
   461
  raise EXCEPTION if list too short*)
wenzelm@233
   462
fun nth_elem NL =
wenzelm@233
   463
  (case drop NL of
wenzelm@233
   464
    [] => raise LIST "nth_elem"
wenzelm@233
   465
  | x :: _ => x);
wenzelm@233
   466
wenzelm@233
   467
(*last element of a list*)
wenzelm@233
   468
fun last_elem [] = raise LIST "last_elem"
wenzelm@233
   469
  | last_elem [x] = x
wenzelm@233
   470
  | last_elem (_ :: xs) = last_elem xs;
wenzelm@233
   471
wenzelm@3762
   472
(*rear decomposition*)
wenzelm@3762
   473
fun split_last [] = raise LIST "split_last"
wenzelm@3762
   474
  | split_last [x] = ([], x)
wenzelm@3762
   475
  | split_last (x :: xs) = apfst (cons x) (split_last xs);
wenzelm@3762
   476
wenzelm@4893
   477
(*update nth element*)
wenzelm@4893
   478
fun nth_update x (n, xs) =
wenzelm@4893
   479
  let
wenzelm@4893
   480
    val prfx = take (n, xs);
wenzelm@4893
   481
    val sffx = drop (n, xs);
wenzelm@4893
   482
  in
wenzelm@4893
   483
    (case sffx of
wenzelm@4893
   484
      [] => raise LIST "nth_update"
wenzelm@4893
   485
    | _ :: sffx' => prfx @ (x :: sffx'))
wenzelm@4893
   486
  end;
wenzelm@4893
   487
wenzelm@4212
   488
(*find the position of an element in a list*)
wenzelm@4212
   489
fun find_index pred =
wenzelm@4212
   490
  let fun find _ [] = ~1
wenzelm@4212
   491
        | find n (x :: xs) = if pred x then n else find (n + 1) xs;
wenzelm@4212
   492
  in find 0 end;
wenzelm@3762
   493
wenzelm@4224
   494
fun find_index_eq x = find_index (equal x);
wenzelm@4212
   495
wenzelm@4212
   496
(*find first element satisfying predicate*)
wenzelm@4212
   497
fun find_first _ [] = None
wenzelm@4212
   498
  | find_first pred (x :: xs) =
wenzelm@4212
   499
      if pred x then Some x else find_first pred xs;
wenzelm@233
   500
wenzelm@4916
   501
(*get first element by lookup function*)
wenzelm@4916
   502
fun get_first _ [] = None
wenzelm@4916
   503
  | get_first f (x :: xs) =
wenzelm@4916
   504
      (case f x of
wenzelm@4916
   505
        None => get_first f xs
wenzelm@4916
   506
      | some => some);
wenzelm@4916
   507
wenzelm@233
   508
(*flatten a list of lists to a list*)
wenzelm@233
   509
fun flat (ls: 'c list list) : 'c list = foldr (op @) (ls, []);
wenzelm@233
   510
wenzelm@233
   511
(*like Lisp's MAPC -- seq proc [x1, ..., xn] evaluates
wenzelm@233
   512
  (proc x1; ...; proc xn) for side effects*)
wenzelm@233
   513
fun seq (proc: 'a -> unit) : 'a list -> unit =
wenzelm@233
   514
  let fun seqf [] = ()
wenzelm@233
   515
        | seqf (x :: xs) = (proc x; seqf xs)
wenzelm@233
   516
  in seqf end;
wenzelm@233
   517
wenzelm@233
   518
(*separate s [x1, x2, ..., xn]  ===>  [x1, s, x2, s, ..., s, xn]*)
wenzelm@233
   519
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs
wenzelm@233
   520
  | separate _ xs = xs;
wenzelm@233
   521
wenzelm@233
   522
(*make the list [x, x, ..., x] of length n*)
wenzelm@233
   523
fun replicate n (x: 'a) : 'a list =
wenzelm@233
   524
  let fun rep (0, xs) = xs
wenzelm@233
   525
        | rep (n, xs) = rep (n - 1, x :: xs)
wenzelm@233
   526
  in
wenzelm@233
   527
    if n < 0 then raise LIST "replicate"
wenzelm@233
   528
    else rep (n, [])
wenzelm@233
   529
  end;
wenzelm@233
   530
wenzelm@4248
   531
(*multiply [a, b, c, ...] * [xs, ys, zs, ...]*)
wenzelm@4248
   532
fun multiply ([], _) = []
wenzelm@4248
   533
  | multiply (x :: xs, yss) = map (cons x) yss @ multiply (xs, yss);
wenzelm@4248
   534
wenzelm@233
   535
wenzelm@233
   536
(* filter *)
wenzelm@233
   537
wenzelm@233
   538
(*copy the list preserving elements that satisfy the predicate*)
wenzelm@233
   539
fun filter (pred: 'a->bool) : 'a list -> 'a list =
clasohm@0
   540
  let fun filt [] = []
wenzelm@233
   541
        | filt (x :: xs) = if pred x then x :: filt xs else filt xs
wenzelm@233
   542
  in filt end;
clasohm@0
   543
clasohm@0
   544
fun filter_out f = filter (not o f);
clasohm@0
   545
wenzelm@233
   546
fun mapfilter (f: 'a -> 'b option) ([]: 'a list) = [] : 'b list
wenzelm@233
   547
  | mapfilter f (x :: xs) =
wenzelm@233
   548
      (case f x of
wenzelm@233
   549
        None => mapfilter f xs
wenzelm@233
   550
      | Some y => y :: mapfilter f xs);
wenzelm@233
   551
wenzelm@233
   552
wenzelm@233
   553
(* lists of pairs *)
wenzelm@233
   554
wenzelm@380
   555
fun map2 _ ([], []) = []
wenzelm@380
   556
  | map2 f (x :: xs, y :: ys) = (f (x, y) :: map2 f (xs, ys))
wenzelm@380
   557
  | map2 _ _ = raise LIST "map2";
wenzelm@380
   558
wenzelm@380
   559
fun exists2 _ ([], []) = false
wenzelm@380
   560
  | exists2 pred (x :: xs, y :: ys) = pred (x, y) orelse exists2 pred (xs, ys)
wenzelm@380
   561
  | exists2 _ _ = raise LIST "exists2";
wenzelm@380
   562
wenzelm@380
   563
fun forall2 _ ([], []) = true
wenzelm@380
   564
  | forall2 pred (x :: xs, y :: ys) = pred (x, y) andalso forall2 pred (xs, ys)
wenzelm@380
   565
  | forall2 _ _ = raise LIST "forall2";
wenzelm@380
   566
wenzelm@4956
   567
fun seq2 _ ([], []) = ()
wenzelm@4956
   568
  | seq2 f (x :: xs, y :: ys) = (f (x, y); seq2 f (xs, ys))
wenzelm@4956
   569
  | seq2 _ _ = raise LIST "seq2";
wenzelm@4956
   570
wenzelm@233
   571
(*combine two lists forming a list of pairs:
wenzelm@233
   572
  [x1, ..., xn] ~~ [y1, ..., yn]  ===>  [(x1, y1), ..., (xn, yn)]*)
wenzelm@233
   573
fun [] ~~ [] = []
wenzelm@233
   574
  | (x :: xs) ~~ (y :: ys) = (x, y) :: (xs ~~ ys)
wenzelm@233
   575
  | _ ~~ _ = raise LIST "~~";
wenzelm@233
   576
wenzelm@233
   577
(*inverse of ~~; the old 'split':
wenzelm@233
   578
  [(x1, y1), ..., (xn, yn)]  ===>  ([x1, ..., xn], [y1, ..., yn])*)
wenzelm@233
   579
fun split_list (l: ('a * 'b) list) = (map #1 l, map #2 l);
wenzelm@233
   580
wenzelm@233
   581
wenzelm@233
   582
(* prefixes, suffixes *)
wenzelm@233
   583
wenzelm@233
   584
fun [] prefix _ = true
wenzelm@233
   585
  | (x :: xs) prefix (y :: ys) = x = y andalso (xs prefix ys)
wenzelm@233
   586
  | _ prefix _ = false;
wenzelm@233
   587
wenzelm@233
   588
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., x(i-1)], [xi, ..., xn])
wenzelm@233
   589
   where xi is the first element that does not satisfy the predicate*)
wenzelm@233
   590
fun take_prefix (pred : 'a -> bool)  (xs: 'a list) : 'a list * 'a list =
wenzelm@233
   591
  let fun take (rxs, []) = (rev rxs, [])
wenzelm@255
   592
        | take (rxs, x :: xs) =
wenzelm@255
   593
            if  pred x  then  take(x :: rxs, xs)  else  (rev rxs, x :: xs)
wenzelm@233
   594
  in  take([], xs)  end;
wenzelm@233
   595
wenzelm@233
   596
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., xi], [x(i+1), ..., xn])
wenzelm@233
   597
   where xi is the last element that does not satisfy the predicate*)
wenzelm@233
   598
fun take_suffix _ [] = ([], [])
wenzelm@233
   599
  | take_suffix pred (x :: xs) =
wenzelm@233
   600
      (case take_suffix pred xs of
wenzelm@233
   601
        ([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx)
wenzelm@233
   602
      | (prfx, sffx) => (x :: prfx, sffx));
wenzelm@233
   603
wenzelm@233
   604
wenzelm@233
   605
wenzelm@233
   606
(** integers **)
wenzelm@233
   607
wenzelm@2958
   608
fun inc i = (i := ! i + 1; ! i);
wenzelm@2958
   609
fun dec i = (i := ! i - 1; ! i);
wenzelm@233
   610
wenzelm@233
   611
wenzelm@233
   612
(* lists of integers *)
wenzelm@233
   613
wenzelm@233
   614
(*make the list [from, from + 1, ..., to]*)
paulson@2175
   615
fun (from upto to) =
wenzelm@233
   616
  if from > to then [] else from :: ((from + 1) upto to);
wenzelm@233
   617
wenzelm@233
   618
(*make the list [from, from - 1, ..., to]*)
paulson@2175
   619
fun (from downto to) =
wenzelm@233
   620
  if from < to then [] else from :: ((from - 1) downto to);
wenzelm@233
   621
wenzelm@233
   622
(*predicate: downto0 (is, n) <=> is = [n, n - 1, ..., 0]*)
wenzelm@233
   623
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n - 1)
wenzelm@233
   624
  | downto0 ([], n) = n = ~1;
wenzelm@233
   625
wenzelm@233
   626
wenzelm@233
   627
(* convert integers to strings *)
wenzelm@233
   628
wenzelm@233
   629
(*expand the number in the given base;
wenzelm@233
   630
  example: radixpand (2, 8) gives [1, 0, 0, 0]*)
wenzelm@233
   631
fun radixpand (base, num) : int list =
wenzelm@233
   632
  let
wenzelm@233
   633
    fun radix (n, tail) =
wenzelm@233
   634
      if n < base then n :: tail
wenzelm@233
   635
      else radix (n div base, (n mod base) :: tail)
wenzelm@233
   636
  in radix (num, []) end;
wenzelm@233
   637
wenzelm@233
   638
(*expands a number into a string of characters starting from "zerochar";
wenzelm@233
   639
  example: radixstring (2, "0", 8) gives "1000"*)
wenzelm@233
   640
fun radixstring (base, zerochar, num) =
wenzelm@233
   641
  let val offset = ord zerochar;
wenzelm@233
   642
      fun chrof n = chr (offset + n)
wenzelm@233
   643
  in implode (map chrof (radixpand (base, num))) end;
wenzelm@233
   644
wenzelm@233
   645
paulson@3407
   646
val string_of_int = Int.toString;
wenzelm@233
   647
paulson@3407
   648
fun string_of_indexname (a,0) = a
paulson@3407
   649
  | string_of_indexname (a,i) = a ^ "_" ^ Int.toString i;
wenzelm@233
   650
wenzelm@233
   651
wenzelm@4212
   652
wenzelm@233
   653
(** strings **)
wenzelm@233
   654
lcp@512
   655
(*enclose in brackets*)
lcp@512
   656
fun enclose lpar rpar str = lpar ^ str ^ rpar;
wenzelm@255
   657
wenzelm@233
   658
(*simple quoting (does not escape special chars)*)
lcp@512
   659
val quote = enclose "\"" "\"";
wenzelm@233
   660
wenzelm@4212
   661
(*space_implode "..." (explode "hello") = "h...e...l...l...o"*)
wenzelm@233
   662
fun space_implode a bs = implode (separate a bs);
wenzelm@233
   663
wenzelm@255
   664
val commas = space_implode ", ";
wenzelm@380
   665
val commas_quote = commas o map quote;
wenzelm@255
   666
wenzelm@233
   667
(*concatenate messages, one per line, into a string*)
wenzelm@255
   668
val cat_lines = space_implode "\n";
wenzelm@233
   669
wenzelm@4212
   670
(*space_explode "." "h.e..l.lo" = ["h", "e", "", "l", "lo"]*)
wenzelm@3832
   671
fun space_explode _ "" = []
wenzelm@3832
   672
  | space_explode sep str =
wenzelm@3832
   673
      let
wenzelm@3832
   674
        fun expl chs =
wenzelm@3832
   675
          (case take_prefix (not_equal sep) chs of
wenzelm@3832
   676
            (cs, []) => [implode cs]
wenzelm@3832
   677
          | (cs, _ :: cs') => implode cs :: expl cs');
wenzelm@3832
   678
      in expl (explode str) end;
wenzelm@3832
   679
wenzelm@3832
   680
val split_lines = space_explode "\n";
wenzelm@3832
   681
wenzelm@5285
   682
(*append suffix*)
wenzelm@5285
   683
fun suffix sfx s = s ^ sfx;
wenzelm@5285
   684
wenzelm@5285
   685
(*remove suffix*)
wenzelm@5285
   686
fun unsuffix sfx s =
wenzelm@5285
   687
  let
wenzelm@5285
   688
    val cs = explode s;
wenzelm@5285
   689
    val prfx_len = size s - size sfx;
wenzelm@5285
   690
  in
wenzelm@5285
   691
    if prfx_len >= 0 andalso implode (drop (prfx_len, cs)) = sfx then
wenzelm@5285
   692
      implode (take (prfx_len, cs))
wenzelm@5285
   693
    else raise LIST "unsuffix"
wenzelm@5285
   694
  end;
wenzelm@5285
   695
wenzelm@3832
   696
wenzelm@233
   697
wenzelm@233
   698
(** lists as sets **)
wenzelm@233
   699
wenzelm@233
   700
(*membership in a list*)
wenzelm@233
   701
fun x mem [] = false
wenzelm@233
   702
  | x mem (y :: ys) = x = y orelse x mem ys;
clasohm@0
   703
paulson@2175
   704
(*membership in a list, optimized version for ints*)
berghofe@1576
   705
fun (x:int) mem_int [] = false
berghofe@1576
   706
  | x mem_int (y :: ys) = x = y orelse x mem_int ys;
berghofe@1576
   707
paulson@2175
   708
(*membership in a list, optimized version for strings*)
berghofe@1576
   709
fun (x:string) mem_string [] = false
berghofe@1576
   710
  | x mem_string (y :: ys) = x = y orelse x mem_string ys;
berghofe@1576
   711
clasohm@0
   712
(*generalized membership test*)
wenzelm@233
   713
fun gen_mem eq (x, []) = false
wenzelm@233
   714
  | gen_mem eq (x, y :: ys) = eq (x, y) orelse gen_mem eq (x, ys);
wenzelm@233
   715
wenzelm@233
   716
wenzelm@233
   717
(*insertion into list if not already there*)
paulson@2175
   718
fun (x ins xs) = if x mem xs then xs else x :: xs;
clasohm@0
   719
paulson@2175
   720
(*insertion into list, optimized version for ints*)
paulson@2175
   721
fun (x ins_int xs) = if x mem_int xs then xs else x :: xs;
berghofe@1576
   722
paulson@2175
   723
(*insertion into list, optimized version for strings*)
paulson@2175
   724
fun (x ins_string xs) = if x mem_string xs then xs else x :: xs;
berghofe@1576
   725
clasohm@0
   726
(*generalized insertion*)
wenzelm@233
   727
fun gen_ins eq (x, xs) = if gen_mem eq (x, xs) then xs else x :: xs;
wenzelm@233
   728
wenzelm@233
   729
wenzelm@233
   730
(*union of sets represented as lists: no repetitions*)
wenzelm@233
   731
fun xs union [] = xs
wenzelm@233
   732
  | [] union ys = ys
wenzelm@233
   733
  | (x :: xs) union ys = xs union (x ins ys);
clasohm@0
   734
paulson@2175
   735
(*union of sets, optimized version for ints*)
berghofe@1576
   736
fun (xs:int list) union_int [] = xs
berghofe@1576
   737
  | [] union_int ys = ys
berghofe@1576
   738
  | (x :: xs) union_int ys = xs union_int (x ins_int ys);
berghofe@1576
   739
paulson@2175
   740
(*union of sets, optimized version for strings*)
berghofe@1576
   741
fun (xs:string list) union_string [] = xs
berghofe@1576
   742
  | [] union_string ys = ys
berghofe@1576
   743
  | (x :: xs) union_string ys = xs union_string (x ins_string ys);
berghofe@1576
   744
clasohm@0
   745
(*generalized union*)
wenzelm@233
   746
fun gen_union eq (xs, []) = xs
wenzelm@233
   747
  | gen_union eq ([], ys) = ys
wenzelm@233
   748
  | gen_union eq (x :: xs, ys) = gen_union eq (xs, gen_ins eq (x, ys));
wenzelm@233
   749
wenzelm@233
   750
wenzelm@233
   751
(*intersection*)
wenzelm@233
   752
fun [] inter ys = []
wenzelm@233
   753
  | (x :: xs) inter ys =
wenzelm@233
   754
      if x mem ys then x :: (xs inter ys) else xs inter ys;
wenzelm@233
   755
paulson@2175
   756
(*intersection, optimized version for ints*)
berghofe@1576
   757
fun ([]:int list) inter_int ys = []
berghofe@1576
   758
  | (x :: xs) inter_int ys =
berghofe@1576
   759
      if x mem_int ys then x :: (xs inter_int ys) else xs inter_int ys;
berghofe@1576
   760
paulson@2175
   761
(*intersection, optimized version for strings *)
berghofe@1576
   762
fun ([]:string list) inter_string ys = []
berghofe@1576
   763
  | (x :: xs) inter_string ys =
berghofe@1576
   764
      if x mem_string ys then x :: (xs inter_string ys) else xs inter_string ys;
berghofe@1576
   765
wenzelm@233
   766
wenzelm@233
   767
(*subset*)
wenzelm@233
   768
fun [] subset ys = true
wenzelm@233
   769
  | (x :: xs) subset ys = x mem ys andalso xs subset ys;
wenzelm@233
   770
paulson@2175
   771
(*subset, optimized version for ints*)
berghofe@1576
   772
fun ([]:int list) subset_int ys = true
berghofe@1576
   773
  | (x :: xs) subset_int ys = x mem_int ys andalso xs subset_int ys;
berghofe@1576
   774
paulson@2175
   775
(*subset, optimized version for strings*)
berghofe@1576
   776
fun ([]:string list) subset_string ys = true
berghofe@1576
   777
  | (x :: xs) subset_string ys = x mem_string ys andalso xs subset_string ys;
berghofe@1576
   778
wenzelm@4363
   779
(*set equality*)
wenzelm@4363
   780
fun eq_set (xs, ys) =
wenzelm@4363
   781
  xs = ys orelse (xs subset ys andalso ys subset xs);
wenzelm@4363
   782
paulson@2182
   783
(*set equality for strings*)
berghofe@1576
   784
fun eq_set_string ((xs:string list), ys) =
berghofe@1576
   785
  xs = ys orelse (xs subset_string ys andalso ys subset_string xs);
berghofe@1576
   786
paulson@2182
   787
fun gen_subset eq (xs, ys) = forall (fn x => gen_mem eq (x, ys)) xs;
paulson@2182
   788
wenzelm@265
   789
wenzelm@233
   790
(*removing an element from a list WITHOUT duplicates*)
wenzelm@233
   791
fun (y :: ys) \ x = if x = y then ys else y :: (ys \ x)
wenzelm@233
   792
  | [] \ x = [];
wenzelm@233
   793
paulson@2243
   794
fun ys \\ xs = foldl (op \) (ys,xs);
clasohm@0
   795
wenzelm@233
   796
(*removing an element from a list -- possibly WITH duplicates*)
wenzelm@233
   797
fun gen_rem eq (xs, y) = filter_out (fn x => eq (x, y)) xs;
wenzelm@233
   798
paulson@2243
   799
fun gen_rems eq = foldl (gen_rem eq);
wenzelm@233
   800
wenzelm@233
   801
wenzelm@233
   802
(*makes a list of the distinct members of the input; preserves order, takes
wenzelm@233
   803
  first of equal elements*)
wenzelm@233
   804
fun gen_distinct eq lst =
wenzelm@233
   805
  let
wenzelm@233
   806
    val memb = gen_mem eq;
clasohm@0
   807
wenzelm@233
   808
    fun dist (rev_seen, []) = rev rev_seen
wenzelm@233
   809
      | dist (rev_seen, x :: xs) =
wenzelm@233
   810
          if memb (x, rev_seen) then dist (rev_seen, xs)
wenzelm@233
   811
          else dist (x :: rev_seen, xs);
wenzelm@233
   812
  in
wenzelm@233
   813
    dist ([], lst)
wenzelm@233
   814
  end;
wenzelm@233
   815
paulson@2243
   816
fun distinct l = gen_distinct (op =) l;
wenzelm@233
   817
wenzelm@233
   818
wenzelm@233
   819
(*returns the tail beginning with the first repeated element, or []*)
wenzelm@233
   820
fun findrep [] = []
wenzelm@233
   821
  | findrep (x :: xs) = if x mem xs then x :: xs else findrep xs;
wenzelm@233
   822
wenzelm@233
   823
wenzelm@255
   824
(*returns a list containing all repeated elements exactly once; preserves
wenzelm@255
   825
  order, takes first of equal elements*)
wenzelm@255
   826
fun gen_duplicates eq lst =
wenzelm@255
   827
  let
wenzelm@255
   828
    val memb = gen_mem eq;
wenzelm@255
   829
wenzelm@255
   830
    fun dups (rev_dups, []) = rev rev_dups
wenzelm@255
   831
      | dups (rev_dups, x :: xs) =
wenzelm@255
   832
          if memb (x, rev_dups) orelse not (memb (x, xs)) then
wenzelm@255
   833
            dups (rev_dups, xs)
wenzelm@255
   834
          else dups (x :: rev_dups, xs);
wenzelm@255
   835
  in
wenzelm@255
   836
    dups ([], lst)
wenzelm@255
   837
  end;
wenzelm@255
   838
paulson@2243
   839
fun duplicates l = gen_duplicates (op =) l;
wenzelm@255
   840
wenzelm@255
   841
wenzelm@233
   842
wenzelm@233
   843
(** association lists **)
clasohm@0
   844
wenzelm@233
   845
(*association list lookup*)
wenzelm@233
   846
fun assoc ([], key) = None
wenzelm@233
   847
  | assoc ((keyi, xi) :: pairs, key) =
wenzelm@233
   848
      if key = keyi then Some xi else assoc (pairs, key);
wenzelm@233
   849
paulson@2175
   850
(*association list lookup, optimized version for ints*)
berghofe@1576
   851
fun assoc_int ([], (key:int)) = None
berghofe@1576
   852
  | assoc_int ((keyi, xi) :: pairs, key) =
berghofe@1576
   853
      if key = keyi then Some xi else assoc_int (pairs, key);
berghofe@1576
   854
paulson@2175
   855
(*association list lookup, optimized version for strings*)
berghofe@1576
   856
fun assoc_string ([], (key:string)) = None
berghofe@1576
   857
  | assoc_string ((keyi, xi) :: pairs, key) =
berghofe@1576
   858
      if key = keyi then Some xi else assoc_string (pairs, key);
berghofe@1576
   859
paulson@2175
   860
(*association list lookup, optimized version for string*ints*)
berghofe@1576
   861
fun assoc_string_int ([], (key:string*int)) = None
berghofe@1576
   862
  | assoc_string_int ((keyi, xi) :: pairs, key) =
berghofe@1576
   863
      if key = keyi then Some xi else assoc_string_int (pairs, key);
berghofe@1576
   864
wenzelm@233
   865
fun assocs ps x =
wenzelm@233
   866
  (case assoc (ps, x) of
wenzelm@233
   867
    None => []
wenzelm@233
   868
  | Some ys => ys);
wenzelm@233
   869
wenzelm@255
   870
(*two-fold association list lookup*)
wenzelm@255
   871
fun assoc2 (aal, (key1, key2)) =
wenzelm@255
   872
  (case assoc (aal, key1) of
wenzelm@255
   873
    Some al => assoc (al, key2)
wenzelm@255
   874
  | None => None);
wenzelm@255
   875
wenzelm@233
   876
(*generalized association list lookup*)
wenzelm@233
   877
fun gen_assoc eq ([], key) = None
wenzelm@233
   878
  | gen_assoc eq ((keyi, xi) :: pairs, key) =
wenzelm@233
   879
      if eq (key, keyi) then Some xi else gen_assoc eq (pairs, key);
wenzelm@233
   880
wenzelm@233
   881
(*association list update*)
wenzelm@233
   882
fun overwrite (al, p as (key, _)) =
wenzelm@233
   883
  let fun over ((q as (keyi, _)) :: pairs) =
wenzelm@233
   884
            if keyi = key then p :: pairs else q :: (over pairs)
wenzelm@233
   885
        | over [] = [p]
wenzelm@233
   886
  in over al end;
wenzelm@233
   887
wenzelm@2522
   888
fun gen_overwrite eq (al, p as (key, _)) =
wenzelm@2522
   889
  let fun over ((q as (keyi, _)) :: pairs) =
wenzelm@2522
   890
            if eq (keyi, key) then p :: pairs else q :: (over pairs)
wenzelm@2522
   891
        | over [] = [p]
wenzelm@2522
   892
  in over al end;
wenzelm@2522
   893
wenzelm@233
   894
wenzelm@233
   895
wenzelm@233
   896
(** generic tables **)
clasohm@0
   897
wenzelm@233
   898
(*Tables are supposed to be 'efficient' encodings of lists of elements distinct
wenzelm@233
   899
  wrt. an equality "eq". The extend and merge operations below are optimized
wenzelm@233
   900
  for long-term space efficiency.*)
wenzelm@233
   901
wenzelm@233
   902
(*append (new) elements to a table*)
wenzelm@233
   903
fun generic_extend _ _ _ tab [] = tab
wenzelm@233
   904
  | generic_extend eq dest_tab mk_tab tab1 lst2 =
wenzelm@233
   905
      let
wenzelm@233
   906
        val lst1 = dest_tab tab1;
wenzelm@233
   907
        val new_lst2 = gen_rems eq (lst2, lst1);
wenzelm@233
   908
      in
wenzelm@233
   909
        if null new_lst2 then tab1
wenzelm@233
   910
        else mk_tab (lst1 @ new_lst2)
wenzelm@233
   911
      end;
clasohm@0
   912
wenzelm@233
   913
(*append (new) elements of 2nd table to 1st table*)
wenzelm@233
   914
fun generic_merge eq dest_tab mk_tab tab1 tab2 =
wenzelm@233
   915
  let
wenzelm@233
   916
    val lst1 = dest_tab tab1;
wenzelm@233
   917
    val lst2 = dest_tab tab2;
wenzelm@233
   918
    val new_lst2 = gen_rems eq (lst2, lst1);
wenzelm@233
   919
  in
wenzelm@233
   920
    if null new_lst2 then tab1
wenzelm@233
   921
    else if gen_subset eq (lst1, lst2) then tab2
wenzelm@233
   922
    else mk_tab (lst1 @ new_lst2)
wenzelm@233
   923
  end;
clasohm@0
   924
wenzelm@233
   925
wenzelm@233
   926
(*lists as tables*)
paulson@2243
   927
fun extend_list tab = generic_extend (op =) I I tab;
paulson@2243
   928
fun merge_lists tab = generic_merge (op =) I I tab;
wenzelm@4692
   929
fun merge_alists tab = generic_merge eq_fst I I tab;
wenzelm@233
   930
wenzelm@380
   931
fun merge_rev_lists xs [] = xs
wenzelm@380
   932
  | merge_rev_lists [] ys = ys
wenzelm@380
   933
  | merge_rev_lists xs (y :: ys) =
wenzelm@380
   934
      (if y mem xs then I else cons y) (merge_rev_lists xs ys);
wenzelm@380
   935
clasohm@0
   936
clasohm@0
   937
wenzelm@233
   938
(** balanced trees **)
wenzelm@233
   939
wenzelm@233
   940
exception Balance;      (*indicates non-positive argument to balancing fun*)
wenzelm@233
   941
wenzelm@233
   942
(*balanced folding; avoids deep nesting*)
wenzelm@233
   943
fun fold_bal f [x] = x
wenzelm@233
   944
  | fold_bal f [] = raise Balance
wenzelm@233
   945
  | fold_bal f xs =
wenzelm@233
   946
      let val k = length xs div 2
wenzelm@233
   947
      in  f (fold_bal f (take(k, xs)),
wenzelm@233
   948
             fold_bal f (drop(k, xs)))
wenzelm@233
   949
      end;
wenzelm@233
   950
wenzelm@233
   951
(*construct something of the form f(...g(...(x)...)) for balanced access*)
wenzelm@233
   952
fun access_bal (f, g, x) n i =
wenzelm@233
   953
  let fun acc n i =     (*1<=i<=n*)
wenzelm@233
   954
          if n=1 then x else
wenzelm@233
   955
          let val n2 = n div 2
wenzelm@233
   956
          in  if i<=n2 then f (acc n2 i)
wenzelm@233
   957
                       else g (acc (n-n2) (i-n2))
wenzelm@233
   958
          end
wenzelm@233
   959
  in  if 1<=i andalso i<=n then acc n i else raise Balance  end;
wenzelm@233
   960
wenzelm@233
   961
(*construct ALL such accesses; could try harder to share recursive calls!*)
wenzelm@233
   962
fun accesses_bal (f, g, x) n =
wenzelm@233
   963
  let fun acc n =
wenzelm@233
   964
          if n=1 then [x] else
wenzelm@233
   965
          let val n2 = n div 2
wenzelm@233
   966
              val acc2 = acc n2
wenzelm@233
   967
          in  if n-n2=n2 then map f acc2 @ map g acc2
wenzelm@233
   968
                         else map f acc2 @ map g (acc (n-n2)) end
wenzelm@233
   969
  in  if 1<=n then acc n else raise Balance  end;
wenzelm@233
   970
wenzelm@233
   971
wenzelm@233
   972
wenzelm@2506
   973
(** orders **)
wenzelm@2506
   974
wenzelm@2506
   975
datatype order = LESS | EQUAL | GREATER;
wenzelm@2506
   976
wenzelm@4445
   977
fun rev_order LESS = GREATER
wenzelm@4445
   978
  | rev_order EQUAL = EQUAL
wenzelm@4445
   979
  | rev_order GREATER = LESS;
wenzelm@4445
   980
wenzelm@4479
   981
(*assume rel is a linear strict order*)
wenzelm@4445
   982
fun make_ord rel (x, y) =
wenzelm@4445
   983
  if rel (x, y) then LESS
wenzelm@4445
   984
  else if rel (y, x) then GREATER
wenzelm@4445
   985
  else EQUAL;
wenzelm@4445
   986
wenzelm@4343
   987
fun int_ord (i, j: int) =
wenzelm@2506
   988
  if i < j then LESS
wenzelm@2506
   989
  else if i = j then EQUAL
wenzelm@2506
   990
  else GREATER;
wenzelm@2506
   991
wenzelm@4343
   992
fun string_ord (a, b: string) =
wenzelm@2506
   993
  if a < b then LESS
wenzelm@2506
   994
  else if a = b then EQUAL
wenzelm@2506
   995
  else GREATER;
wenzelm@2506
   996
wenzelm@4343
   997
(*lexicographic product*)
wenzelm@4343
   998
fun prod_ord a_ord b_ord ((x, y), (x', y')) =
wenzelm@4343
   999
  (case a_ord (x, x') of EQUAL => b_ord (y, y') | ord => ord);
wenzelm@4343
  1000
wenzelm@4343
  1001
(*dictionary order -- in general NOT well-founded!*)
wenzelm@4343
  1002
fun dict_ord _ ([], []) = EQUAL
wenzelm@4343
  1003
  | dict_ord _ ([], _ :: _) = LESS
wenzelm@4343
  1004
  | dict_ord _ (_ :: _, []) = GREATER
wenzelm@4343
  1005
  | dict_ord elem_ord (x :: xs, y :: ys) =
wenzelm@4343
  1006
      (case elem_ord (x, y) of EQUAL => dict_ord elem_ord (xs, ys) | ord => ord);
wenzelm@4343
  1007
wenzelm@4343
  1008
(*lexicographic product of lists*)
wenzelm@4343
  1009
fun list_ord elem_ord (xs, ys) =
wenzelm@4343
  1010
  prod_ord int_ord (dict_ord elem_ord) ((length xs, xs), (length ys, ys));
wenzelm@4343
  1011
wenzelm@2506
  1012
wenzelm@4621
  1013
(* sorting *)
wenzelm@4621
  1014
wenzelm@4621
  1015
(*quicksort (stable, i.e. does not reorder equal elements)*)
wenzelm@4621
  1016
fun sort ord =
wenzelm@4621
  1017
  let
wenzelm@4621
  1018
    fun qsort xs =
wenzelm@4621
  1019
      let val len = length xs in
wenzelm@4621
  1020
        if len <= 1 then xs
wenzelm@4621
  1021
        else
wenzelm@4621
  1022
          let val (lts, eqs, gts) = part (nth_elem (len div 2, xs)) xs in
wenzelm@4621
  1023
            qsort lts @ eqs @ qsort gts
wenzelm@4621
  1024
          end
wenzelm@4621
  1025
      end
wenzelm@4621
  1026
    and part _ [] = ([], [], [])
wenzelm@4621
  1027
      | part pivot (x :: xs) = add (ord (x, pivot)) x (part pivot xs)
wenzelm@4621
  1028
    and add LESS x (lts, eqs, gts) = (x :: lts, eqs, gts)
wenzelm@4621
  1029
      | add EQUAL x (lts, eqs, gts) = (lts, x :: eqs, gts)
wenzelm@4621
  1030
      | add GREATER x (lts, eqs, gts) = (lts, eqs, x :: gts);
wenzelm@4621
  1031
  in qsort end;
wenzelm@4621
  1032
wenzelm@4621
  1033
(*sort strings*)
wenzelm@4621
  1034
val sort_strings = sort string_ord;
wenzelm@4621
  1035
fun sort_wrt sel xs = sort (string_ord o pairself sel) xs;
wenzelm@4621
  1036
wenzelm@4621
  1037
wenzelm@2506
  1038
wenzelm@3525
  1039
(** input / output and diagnostics **)
wenzelm@233
  1040
paulson@2243
  1041
val cd = OS.FileSys.chDir;
wenzelm@2317
  1042
val pwd = OS.FileSys.getDir;
paulson@2243
  1043
wenzelm@5942
  1044
fun std_output s =
wenzelm@5942
  1045
  (TextIO.output (TextIO.stdOut, s); TextIO.flushOut TextIO.stdOut);
wenzelm@3525
  1046
wenzelm@5942
  1047
fun prefix_lines prfx txt =
wenzelm@5949
  1048
  txt |> split_lines |> map (fn s => prfx ^ s) |> cat_lines;
wenzelm@3525
  1049
wenzelm@3525
  1050
(*hooks for output channels: normal, warning, error*)
wenzelm@5966
  1051
val writeln_fn = ref (std_output o suffix "\n");
wenzelm@5949
  1052
val warning_fn = ref (std_output o suffix "\n" o prefix_lines "### ");
wenzelm@5949
  1053
val error_fn = ref (std_output o suffix "\n" o prefix_lines "*** ");
berghofe@1580
  1054
wenzelm@5966
  1055
fun writeln s = ! writeln_fn s;
wenzelm@5942
  1056
fun warning s = ! warning_fn s;
wenzelm@233
  1057
wenzelm@233
  1058
(*print error message and abort to top level*)
wenzelm@233
  1059
exception ERROR;
wenzelm@5949
  1060
fun error_msg s = ! error_fn s;
wenzelm@3553
  1061
fun error s = (error_msg s; raise ERROR);
wenzelm@4849
  1062
fun sys_error msg = error ("## SYSTEM ERROR ##\n" ^ msg);
wenzelm@233
  1063
wenzelm@233
  1064
fun assert p msg = if p then () else error msg;
wenzelm@233
  1065
fun deny p msg = if p then error msg else ();
wenzelm@233
  1066
lcp@544
  1067
(*Assert pred for every member of l, generating a message if pred fails*)
wenzelm@4212
  1068
fun assert_all pred l msg_fn =
lcp@544
  1069
  let fun asl [] = ()
wenzelm@4212
  1070
        | asl (x::xs) = if pred x then asl xs else error (msg_fn x)
wenzelm@4212
  1071
  in asl l end;
wenzelm@233
  1072
wenzelm@3624
  1073
wenzelm@4212
  1074
(* handle errors capturing messages *)
wenzelm@3699
  1075
wenzelm@3699
  1076
datatype 'a error =
wenzelm@3699
  1077
  Error of string |
wenzelm@3699
  1078
  OK of 'a;
wenzelm@3699
  1079
wenzelm@4248
  1080
fun get_error (Error msg) = Some msg
wenzelm@4248
  1081
  | get_error _ = None;
wenzelm@4248
  1082
wenzelm@4248
  1083
fun get_ok (OK x) = Some x
wenzelm@4248
  1084
  | get_ok _ = None;
wenzelm@4248
  1085
wenzelm@5037
  1086
datatype 'a result =
wenzelm@5037
  1087
  Result of 'a |
wenzelm@5037
  1088
  Exn of exn;
wenzelm@5037
  1089
wenzelm@3699
  1090
fun handle_error f x =
wenzelm@3699
  1091
  let
wenzelm@4945
  1092
    val buffer = ref ([]: string list);
wenzelm@4945
  1093
    fun capture s = buffer := ! buffer @ [s];
wenzelm@5037
  1094
    fun err_msg () = if not (null (! buffer)) then error_msg (cat_lines (! buffer)) else ();
wenzelm@3699
  1095
  in
wenzelm@5037
  1096
    (case Result (setmp error_fn capture f x) handle exn => Exn exn of
wenzelm@5037
  1097
      Result y => (err_msg (); OK y)
wenzelm@5037
  1098
    | Exn ERROR => Error (cat_lines (! buffer))
wenzelm@5037
  1099
    | Exn exn => (err_msg (); raise exn))
wenzelm@3624
  1100
  end;
wenzelm@3624
  1101
wenzelm@3624
  1102
wenzelm@5037
  1103
(* transform ERROR into ERROR_MESSAGE *)
wenzelm@4923
  1104
wenzelm@4923
  1105
exception ERROR_MESSAGE of string;
wenzelm@4923
  1106
wenzelm@4923
  1107
fun transform_error f x =
wenzelm@4923
  1108
  (case handle_error f x of
wenzelm@4923
  1109
    OK y => y
wenzelm@4923
  1110
  | Error msg => raise ERROR_MESSAGE msg);
wenzelm@4923
  1111
wenzelm@4923
  1112
wenzelm@5904
  1113
(* transform any exception, including ERROR *)
wenzelm@5904
  1114
wenzelm@5904
  1115
fun transform_failure exn f x =
wenzelm@5904
  1116
  transform_error f x handle e => raise exn e;
wenzelm@5904
  1117
wenzelm@5904
  1118
wenzelm@233
  1119
wenzelm@233
  1120
(** timing **)
wenzelm@233
  1121
paulson@4326
  1122
(*a conditional timing function: applies f to () and, if the flag is true,
paulson@4326
  1123
  prints its runtime*)
paulson@4326
  1124
fun cond_timeit flag f =
paulson@4326
  1125
  if flag then
paulson@4326
  1126
    let val start = startTiming()
paulson@4326
  1127
        val result = f ()
paulson@4326
  1128
    in
wenzelm@5904
  1129
        writeln (endTiming start);  result
paulson@4326
  1130
    end
paulson@4326
  1131
  else f ();
paulson@4326
  1132
wenzelm@233
  1133
(*unconditional timing function*)
paulson@2243
  1134
fun timeit x = cond_timeit true x;
wenzelm@233
  1135
wenzelm@233
  1136
(*timed application function*)
wenzelm@233
  1137
fun timeap f x = timeit (fn () => f x);
wenzelm@233
  1138
berghofe@3606
  1139
wenzelm@233
  1140
wenzelm@4621
  1141
(** misc **)
wenzelm@233
  1142
wenzelm@233
  1143
(*use the keyfun to make a list of (x, key) pairs*)
clasohm@0
  1144
fun make_keylist (keyfun: 'a->'b) : 'a list -> ('a * 'b) list =
wenzelm@233
  1145
  let fun keypair x = (x, keyfun x)
wenzelm@233
  1146
  in map keypair end;
clasohm@0
  1147
wenzelm@233
  1148
(*given a list of (x, key) pairs and a searchkey
clasohm@0
  1149
  return the list of xs from each pair whose key equals searchkey*)
clasohm@0
  1150
fun keyfilter [] searchkey = []
wenzelm@233
  1151
  | keyfilter ((x, key) :: pairs) searchkey =
wenzelm@233
  1152
      if key = searchkey then x :: keyfilter pairs searchkey
wenzelm@233
  1153
      else keyfilter pairs searchkey;
clasohm@0
  1154
clasohm@0
  1155
clasohm@0
  1156
(*Partition list into elements that satisfy predicate and those that don't.
wenzelm@233
  1157
  Preserves order of elements in both lists.*)
clasohm@0
  1158
fun partition (pred: 'a->bool) (ys: 'a list) : ('a list * 'a list) =
clasohm@0
  1159
    let fun part ([], answer) = answer
wenzelm@233
  1160
          | part (x::xs, (ys, ns)) = if pred(x)
wenzelm@233
  1161
            then  part (xs, (x::ys, ns))
wenzelm@233
  1162
            else  part (xs, (ys, x::ns))
wenzelm@233
  1163
    in  part (rev ys, ([], []))  end;
clasohm@0
  1164
clasohm@0
  1165
clasohm@0
  1166
fun partition_eq (eq:'a * 'a -> bool) =
clasohm@0
  1167
    let fun part [] = []
wenzelm@233
  1168
          | part (x::ys) = let val (xs, xs') = partition (apl(x, eq)) ys
wenzelm@233
  1169
                           in (x::xs)::(part xs') end
clasohm@0
  1170
    in part end;
clasohm@0
  1171
clasohm@0
  1172
wenzelm@233
  1173
(*Partition a list into buckets  [ bi, b(i+1), ..., bj ]
clasohm@0
  1174
   putting x in bk if p(k)(x) holds.  Preserve order of elements if possible.*)
clasohm@0
  1175
fun partition_list p i j =
wenzelm@233
  1176
  let fun part k xs =
wenzelm@233
  1177
            if k>j then
clasohm@0
  1178
              (case xs of [] => []
clasohm@0
  1179
                         | _ => raise LIST "partition_list")
clasohm@0
  1180
            else
wenzelm@233
  1181
            let val (ns, rest) = partition (p k) xs;
wenzelm@233
  1182
            in  ns :: part(k+1)rest  end
clasohm@0
  1183
  in  part i end;
clasohm@0
  1184
clasohm@0
  1185
wenzelm@233
  1186
(* transitive closure (not Warshall's algorithm) *)
clasohm@0
  1187
wenzelm@233
  1188
fun transitive_closure [] = []
wenzelm@233
  1189
  | transitive_closure ((x, ys)::ps) =
wenzelm@233
  1190
      let val qs = transitive_closure ps
paulson@2182
  1191
          val zs = foldl (fn (zs, y) => assocs qs y union_string zs) (ys, ys)
wenzelm@5904
  1192
          fun step(u, us) = (u, if x mem_string us then zs union_string us
paulson@2243
  1193
                                else us)
wenzelm@233
  1194
      in (x, zs) :: map step qs end;
clasohm@0
  1195
clasohm@0
  1196
wenzelm@233
  1197
(* generating identifiers *)
clasohm@0
  1198
paulson@4063
  1199
(** Freshly generated identifiers; supplied prefix MUST start with a letter **)
clasohm@0
  1200
local
paulson@4063
  1201
(*Maps 0-63 to A-Z, a-z, 0-9 or _ or ' for generating random identifiers*)
paulson@4063
  1202
fun char i =      if i<26 then chr (ord "A" + i)
wenzelm@5904
  1203
             else if i<52 then chr (ord "a" + i - 26)
wenzelm@5904
  1204
             else if i<62 then chr (ord"0" + i - 52)
wenzelm@5904
  1205
             else if i=62 then "_"
wenzelm@5904
  1206
             else  (*i=63*)    "'";
paulson@4063
  1207
paulson@4063
  1208
val charVec = Vector.tabulate (64, char);
paulson@4063
  1209
wenzelm@5904
  1210
fun newid n =
wenzelm@5904
  1211
  let
wenzelm@4284
  1212
  in  implode (map (fn i => Vector.sub(charVec,i)) (radixpand (64,n)))  end;
paulson@2003
  1213
wenzelm@4284
  1214
val seedr = ref 0;
clasohm@0
  1215
paulson@4063
  1216
in
wenzelm@4284
  1217
paulson@4063
  1218
fun init_gensym() = (seedr := 0);
paulson@2003
  1219
wenzelm@4284
  1220
fun gensym pre = pre ^ (#1(newid (!seedr), inc seedr));
paulson@4063
  1221
end;
paulson@4063
  1222
paulson@4063
  1223
paulson@4063
  1224
local
paulson@4063
  1225
(*Identifies those character codes legal in identifiers.
paulson@4063
  1226
  chould use Basis Library character functions if Poly/ML provided characters*)
wenzelm@5904
  1227
fun idCode k = (ord "a" <= k andalso k < ord "z") orelse
paulson@4063
  1228
               (ord "A" <= k andalso k < ord "Z") orelse
paulson@4063
  1229
               (ord "0" <= k andalso k < ord "9");
paulson@4063
  1230
paulson@4063
  1231
val idCodeVec = Vector.tabulate (256, idCode);
paulson@4063
  1232
paulson@4063
  1233
in
paulson@2003
  1234
clasohm@0
  1235
(*Increment a list of letters like a reversed base 26 number.
wenzelm@233
  1236
  If head is "z", bumps chars in tail.
clasohm@0
  1237
  Digits are incremented as if they were integers.
clasohm@0
  1238
  "_" and "'" are not changed.
wenzelm@233
  1239
  For making variants of identifiers.*)
clasohm@0
  1240
wenzelm@5904
  1241
fun bump_int_list(c::cs) =
wenzelm@5904
  1242
        if c="9" then "0" :: bump_int_list cs
wenzelm@5904
  1243
        else
paulson@4063
  1244
        if "0" <= c andalso c < "9" then chr(ord(c)+1) :: cs
wenzelm@233
  1245
        else "1" :: c :: cs
clasohm@0
  1246
  | bump_int_list([]) = error("bump_int_list: not an identifier");
clasohm@0
  1247
wenzelm@233
  1248
fun bump_list([], d) = [d]
wenzelm@233
  1249
  | bump_list(["'"], d) = [d, "'"]
wenzelm@233
  1250
  | bump_list("z"::cs, _) = "a" :: bump_list(cs, "a")
wenzelm@233
  1251
  | bump_list("Z"::cs, _) = "A" :: bump_list(cs, "A")
wenzelm@233
  1252
  | bump_list("9"::cs, _) = "0" :: bump_int_list cs
wenzelm@5904
  1253
  | bump_list(c::cs, _) =
paulson@4063
  1254
        let val k = ord(c)
wenzelm@5904
  1255
        in if Vector.sub(idCodeVec,k) then chr(k+1) :: cs
wenzelm@5904
  1256
           else
wenzelm@5904
  1257
           if c="'" orelse c="_" then c :: bump_list(cs, "")
wenzelm@5904
  1258
           else error("bump_list: not legal in identifier: " ^
wenzelm@5904
  1259
                      implode(rev(c::cs)))
wenzelm@233
  1260
        end;
clasohm@0
  1261
clasohm@0
  1262
end;
clasohm@0
  1263
wenzelm@233
  1264
fun bump_string s : string = implode (rev (bump_list(rev(explode s), "")));
wenzelm@41
  1265
wenzelm@41
  1266
wenzelm@233
  1267
(* lexical scanning *)
clasohm@0
  1268
wenzelm@233
  1269
(*scan a list of characters into "words" composed of "letters" (recognized by
wenzelm@233
  1270
  is_let) and separated by any number of non-"letters"*)
wenzelm@233
  1271
fun scanwords is_let cs =
clasohm@0
  1272
  let fun scan1 [] = []
wenzelm@233
  1273
        | scan1 cs =
wenzelm@233
  1274
            let val (lets, rest) = take_prefix is_let cs
wenzelm@233
  1275
            in implode lets :: scanwords is_let rest end;
wenzelm@233
  1276
  in scan1 (#2 (take_prefix (not o is_let) cs)) end;
clasohm@24
  1277
wenzelm@4212
  1278
wenzelm@4212
  1279
wenzelm@4212
  1280
(* Variable-branching trees: for proof terms etc. *)
wenzelm@4212
  1281
datatype 'a mtree = Join of 'a * 'a mtree list;
wenzelm@4212
  1282
wenzelm@4212
  1283
clasohm@1364
  1284
end;
clasohm@1364
  1285
clasohm@1364
  1286
open Library;