src/HOL/Imperative_HOL/Array.thy
author haftmann
Fri Jul 09 09:48:52 2010 +0200 (2010-07-09)
changeset 37752 d0a384c84d69
parent 37719 271ecd4fb9f9
child 37756 59caa6180fff
permissions -rw-r--r--
tuned array theory
haftmann@31870
     1
(*  Title:      HOL/Imperative_HOL/Array.thy
haftmann@26170
     2
    Author:     John Matthews, Galois Connections; Alexander Krauss, Lukas Bulwahn & Florian Haftmann, TU Muenchen
haftmann@26170
     3
*)
haftmann@26170
     4
haftmann@26170
     5
header {* Monadic arrays *}
haftmann@26170
     6
haftmann@26170
     7
theory Array
haftmann@31203
     8
imports Heap_Monad
haftmann@26170
     9
begin
haftmann@26170
    10
haftmann@37752
    11
subsection {* Primitives *}
haftmann@37719
    12
haftmann@37752
    13
definition (*FIXME present :: "heap \<Rightarrow> 'a\<Colon>heap array \<Rightarrow> bool" where*)
haftmann@37719
    14
  array_present :: "'a\<Colon>heap array \<Rightarrow> heap \<Rightarrow> bool" where
haftmann@37719
    15
  "array_present a h \<longleftrightarrow> addr_of_array a < lim h"
haftmann@37719
    16
haftmann@37752
    17
definition (*FIXME get :: "heap \<Rightarrow> 'a\<Colon>heap array \<Rightarrow> 'a list" where*)
haftmann@37719
    18
  get_array :: "'a\<Colon>heap array \<Rightarrow> heap \<Rightarrow> 'a list" where
haftmann@37719
    19
  "get_array a h = map from_nat (arrays h (TYPEREP('a)) (addr_of_array a))"
haftmann@37719
    20
haftmann@37752
    21
definition (*FIXME set*)
haftmann@37719
    22
  set_array :: "'a\<Colon>heap array \<Rightarrow> 'a list \<Rightarrow> heap \<Rightarrow> heap" where
haftmann@37719
    23
  "set_array a x = 
haftmann@37719
    24
  arrays_update (\<lambda>h. h(TYPEREP('a) := ((h(TYPEREP('a))) (addr_of_array a:=map to_nat x))))"
haftmann@37719
    25
haftmann@37752
    26
definition (*FIXME alloc*)
haftmann@37752
    27
  array :: "'a list \<Rightarrow> heap \<Rightarrow> 'a\<Colon>heap array \<times> heap" where
haftmann@37719
    28
  "array xs h = (let
haftmann@37719
    29
     l = lim h;
haftmann@37719
    30
     r = Array l;
haftmann@37719
    31
     h'' = set_array r xs (h\<lparr>lim := l + 1\<rparr>)
haftmann@37719
    32
   in (r, h''))"
haftmann@37719
    33
haftmann@37752
    34
definition (*FIXME length :: "heap \<Rightarrow> 'a\<Colon>heap array \<Rightarrow> nat" where*)
haftmann@37752
    35
  length :: "'a\<Colon>heap array \<Rightarrow> heap \<Rightarrow> nat" where
haftmann@37719
    36
  "length a h = List.length (get_array a h)"
haftmann@37719
    37
  
haftmann@37752
    38
definition (*FIXME update*)
haftmann@37752
    39
  change :: "'a\<Colon>heap array \<Rightarrow> nat \<Rightarrow> 'a \<Rightarrow> heap \<Rightarrow> heap" where
haftmann@37719
    40
  "change a i x h = set_array a ((get_array a h)[i:=x]) h"
haftmann@37719
    41
haftmann@37752
    42
definition (*FIXME noteq*)
haftmann@37752
    43
  noteq_arrs :: "'a\<Colon>heap array \<Rightarrow> 'b\<Colon>heap array \<Rightarrow> bool" (infix "=!!=" 70) where
haftmann@37752
    44
  "r =!!= s \<longleftrightarrow> TYPEREP('a) \<noteq> TYPEREP('b) \<or> addr_of_array r \<noteq> addr_of_array s"
haftmann@37752
    45
haftmann@37752
    46
haftmann@37752
    47
subsection {* Monad operations *}
haftmann@37752
    48
haftmann@37752
    49
definition new :: "nat \<Rightarrow> 'a\<Colon>heap \<Rightarrow> 'a array Heap" where
haftmann@37752
    50
  [code del]: "new n x = Heap_Monad.heap (array (replicate n x))"
haftmann@37752
    51
haftmann@37752
    52
definition of_list :: "'a\<Colon>heap list \<Rightarrow> 'a array Heap" where
haftmann@37752
    53
  [code del]: "of_list xs = Heap_Monad.heap (array xs)"
haftmann@37752
    54
haftmann@37752
    55
definition make :: "nat \<Rightarrow> (nat \<Rightarrow> 'a\<Colon>heap) \<Rightarrow> 'a array Heap" where
haftmann@37752
    56
  [code del]: "make n f = Heap_Monad.heap (array (map f [0 ..< n]))"
haftmann@37752
    57
haftmann@37752
    58
definition len :: "'a\<Colon>heap array \<Rightarrow> nat Heap" where
haftmann@37752
    59
  [code del]: "len a = Heap_Monad.heap (\<lambda>h. (length a h, h))"
haftmann@37752
    60
haftmann@37752
    61
definition nth :: "'a\<Colon>heap array \<Rightarrow> nat \<Rightarrow> 'a Heap" where
haftmann@37752
    62
  [code del]: "nth a i = Heap_Monad.guard (\<lambda>h. i < length a h)
haftmann@37752
    63
    (\<lambda>h. (get_array a h ! i, h))"
haftmann@37752
    64
haftmann@37752
    65
definition upd :: "nat \<Rightarrow> 'a \<Rightarrow> 'a\<Colon>heap array \<Rightarrow> 'a\<Colon>heap array Heap" where
haftmann@37752
    66
  [code del]: "upd i x a = Heap_Monad.guard (\<lambda>h. i < length a h)
haftmann@37752
    67
    (\<lambda>h. (a, change a i x h))"
haftmann@37752
    68
haftmann@37752
    69
definition map_entry :: "nat \<Rightarrow> ('a\<Colon>heap \<Rightarrow> 'a) \<Rightarrow> 'a array \<Rightarrow> 'a array Heap" where
haftmann@37752
    70
  [code del]: "map_entry i f a = Heap_Monad.guard (\<lambda>h. i < length a h)
haftmann@37752
    71
    (\<lambda>h. (a, change a i (f (get_array a h ! i)) h))"
haftmann@37752
    72
haftmann@37752
    73
definition swap :: "nat \<Rightarrow> 'a \<Rightarrow> 'a\<Colon>heap array \<Rightarrow> 'a Heap" where
haftmann@37752
    74
  [code del]: "swap i x a = Heap_Monad.guard (\<lambda>h. i < length a h)
haftmann@37752
    75
    (\<lambda>h. (get_array a h ! i, change a i x h))"
haftmann@37752
    76
haftmann@37752
    77
definition freeze :: "'a\<Colon>heap array \<Rightarrow> 'a list Heap" where
haftmann@37752
    78
  [code del]: "freeze a = Heap_Monad.heap (\<lambda>h. (get_array a h, h))"
haftmann@37752
    79
haftmann@37752
    80
haftmann@37752
    81
subsection {* Properties *}
haftmann@37719
    82
haftmann@37719
    83
text {* FIXME: Does there exist a "canonical" array axiomatisation in
haftmann@37719
    84
the literature?  *}
haftmann@37719
    85
haftmann@37719
    86
lemma noteq_arrs_sym: "a =!!= b \<Longrightarrow> b =!!= a"
haftmann@37719
    87
  and unequal_arrs [simp]: "a \<noteq> a' \<longleftrightarrow> a =!!= a'"
haftmann@37719
    88
  unfolding noteq_arrs_def by auto
haftmann@37719
    89
haftmann@37719
    90
lemma noteq_arrs_irrefl: "r =!!= r \<Longrightarrow> False"
haftmann@37719
    91
  unfolding noteq_arrs_def by auto
haftmann@37719
    92
haftmann@37719
    93
lemma present_new_arr: "array_present a h \<Longrightarrow> a =!!= fst (array xs h)"
haftmann@37719
    94
  by (simp add: array_present_def noteq_arrs_def array_def Let_def)
haftmann@37719
    95
haftmann@37719
    96
lemma array_get_set_eq [simp]: "get_array r (set_array r x h) = x"
haftmann@37719
    97
  by (simp add: get_array_def set_array_def o_def)
haftmann@37719
    98
haftmann@37719
    99
lemma array_get_set_neq [simp]: "r =!!= s \<Longrightarrow> get_array r (set_array s x h) = get_array r h"
haftmann@37719
   100
  by (simp add: noteq_arrs_def get_array_def set_array_def)
haftmann@37719
   101
haftmann@37719
   102
lemma set_array_same [simp]:
haftmann@37719
   103
  "set_array r x (set_array r y h) = set_array r x h"
haftmann@37719
   104
  by (simp add: set_array_def)
haftmann@37719
   105
haftmann@37719
   106
lemma array_set_set_swap:
haftmann@37719
   107
  "r =!!= r' \<Longrightarrow> set_array r x (set_array r' x' h) = set_array r' x' (set_array r x h)"
haftmann@37719
   108
  by (simp add: Let_def expand_fun_eq noteq_arrs_def set_array_def)
haftmann@37719
   109
haftmann@37719
   110
lemma get_array_change_eq [simp]:
haftmann@37719
   111
  "get_array a (change a i v h) = (get_array a h) [i := v]"
haftmann@37719
   112
  by (simp add: change_def)
haftmann@37719
   113
haftmann@37719
   114
lemma nth_change_array_neq_array [simp]:
haftmann@37719
   115
  "a =!!= b \<Longrightarrow> get_array a (change b j v h) ! i = get_array a h ! i"
haftmann@37719
   116
  by (simp add: change_def noteq_arrs_def)
haftmann@37719
   117
haftmann@37719
   118
lemma get_arry_array_change_elem_neqIndex [simp]:
haftmann@37719
   119
  "i \<noteq> j \<Longrightarrow> get_array a (change a j v h) ! i = get_array a h ! i"
haftmann@37719
   120
  by simp
haftmann@37719
   121
haftmann@37719
   122
lemma length_change [simp]: 
haftmann@37719
   123
  "length a (change b i v h) = length a h"
haftmann@37719
   124
  by (simp add: change_def length_def set_array_def get_array_def)
haftmann@37719
   125
haftmann@37719
   126
lemma change_swap_neqArray:
haftmann@37719
   127
  "a =!!= a' \<Longrightarrow> 
haftmann@37719
   128
  change a i v (change a' i' v' h) 
haftmann@37719
   129
  = change a' i' v' (change a i v h)"
haftmann@37719
   130
apply (unfold change_def)
haftmann@37719
   131
apply simp
haftmann@37719
   132
apply (subst array_set_set_swap, assumption)
haftmann@37719
   133
apply (subst array_get_set_neq)
haftmann@37719
   134
apply (erule noteq_arrs_sym)
haftmann@37719
   135
apply (simp)
haftmann@37719
   136
done
haftmann@37719
   137
haftmann@37719
   138
lemma change_swap_neqIndex:
haftmann@37719
   139
  "\<lbrakk> i \<noteq> i' \<rbrakk> \<Longrightarrow> change a i v (change a i' v' h) = change a i' v' (change a i v h)"
haftmann@37719
   140
  by (auto simp add: change_def array_set_set_swap list_update_swap)
haftmann@37719
   141
haftmann@37719
   142
lemma get_array_init_array_list:
haftmann@37719
   143
  "get_array (fst (array ls h)) (snd (array ls' h)) = ls'"
haftmann@37719
   144
  by (simp add: Let_def split_def array_def)
haftmann@37719
   145
haftmann@37719
   146
lemma set_array:
haftmann@37719
   147
  "set_array (fst (array ls h))
haftmann@37719
   148
     new_ls (snd (array ls h))
haftmann@37719
   149
       = snd (array new_ls h)"
haftmann@37719
   150
  by (simp add: Let_def split_def array_def)
haftmann@37719
   151
haftmann@37719
   152
lemma array_present_change [simp]: 
haftmann@37719
   153
  "array_present a (change b i v h) = array_present a h"
haftmann@37719
   154
  by (simp add: change_def array_present_def set_array_def get_array_def)
haftmann@37719
   155
haftmann@37752
   156
lemma execute_new [simp]:
haftmann@37752
   157
  "Heap_Monad.execute (new n x) h = Some (array (replicate n x) h)"
haftmann@37752
   158
  by (simp add: new_def)
haftmann@26170
   159
haftmann@37752
   160
lemma execute_of_list [simp]:
haftmann@37752
   161
  "Heap_Monad.execute (of_list xs) h = Some (array xs h)"
haftmann@37752
   162
  by (simp add: of_list_def)
haftmann@26170
   163
haftmann@37752
   164
lemma execute_make [simp]:
haftmann@37752
   165
  "Heap_Monad.execute (make n f) h = Some (array (map f [0 ..< n]) h)"
haftmann@37752
   166
  by (simp add: make_def)
haftmann@26170
   167
haftmann@37752
   168
lemma execute_len [simp]:
haftmann@37752
   169
  "Heap_Monad.execute (len a) h = Some (length a h, h)"
haftmann@37752
   170
  by (simp add: len_def)
haftmann@37752
   171
haftmann@37752
   172
lemma execute_nth [simp]:
haftmann@37752
   173
  "i < length a h \<Longrightarrow>
haftmann@37752
   174
    Heap_Monad.execute (nth a i) h = Some (get_array a h ! i, h)"
haftmann@37752
   175
  "i \<ge> length a h \<Longrightarrow> Heap_Monad.execute (nth a i) h = None"
haftmann@37752
   176
  by (simp_all add: nth_def)
haftmann@26170
   177
haftmann@37752
   178
lemma execute_upd [simp]:
haftmann@37752
   179
  "i < length a h \<Longrightarrow>
haftmann@37752
   180
    Heap_Monad.execute (upd i x a) h = Some (a, change a i x h)"
haftmann@37752
   181
  "i \<ge> length a h \<Longrightarrow> Heap_Monad.execute (nth a i) h = None"
haftmann@37752
   182
  by (simp_all add: upd_def)
haftmann@26170
   183
haftmann@37752
   184
lemma execute_map_entry [simp]:
haftmann@37752
   185
  "i < length a h \<Longrightarrow>
haftmann@37752
   186
   Heap_Monad.execute (map_entry i f a) h =
haftmann@37752
   187
      Some (a, change a i (f (get_array a h ! i)) h)"
haftmann@37752
   188
  "i \<ge> length a h \<Longrightarrow> Heap_Monad.execute (nth a i) h = None"
haftmann@37752
   189
  by (simp_all add: map_entry_def)
haftmann@37752
   190
haftmann@37752
   191
lemma execute_swap [simp]:
haftmann@37752
   192
  "i < length a h \<Longrightarrow>
haftmann@37752
   193
   Heap_Monad.execute (swap i x a) h =
haftmann@37752
   194
      Some (get_array a h ! i, change a i x h)"
haftmann@37752
   195
  "i \<ge> length a h \<Longrightarrow> Heap_Monad.execute (nth a i) h = None"
haftmann@37752
   196
  by (simp_all add: swap_def)
haftmann@37752
   197
haftmann@37752
   198
lemma execute_freeze [simp]:
haftmann@37752
   199
  "Heap_Monad.execute (freeze a) h = Some (get_array a h, h)"
haftmann@37752
   200
  by (simp add: freeze_def)
haftmann@26170
   201
haftmann@26170
   202
lemma upd_return:
haftmann@26170
   203
  "upd i x a \<guillemotright> return a = upd i x a"
haftmann@37752
   204
  by (rule Heap_eqI) (simp add: bindM_def guard_def upd_def)
haftmann@26170
   205
haftmann@37752
   206
lemma array_make:
haftmann@37752
   207
  "new n x = make n (\<lambda>_. x)"
haftmann@37752
   208
  by (rule Heap_eqI) (simp add: map_replicate_trivial)
haftmann@26170
   209
haftmann@37752
   210
lemma array_of_list_make:
haftmann@37752
   211
  "of_list xs = make (List.length xs) (\<lambda>n. xs ! n)"
haftmann@37752
   212
  by (rule Heap_eqI) (simp add: map_nth)
haftmann@26170
   213
haftmann@37752
   214
hide_const (open) new map
haftmann@26170
   215
haftmann@26182
   216
haftmann@26182
   217
subsection {* Code generator setup *}
haftmann@26182
   218
haftmann@26182
   219
subsubsection {* Logical intermediate layer *}
haftmann@26182
   220
haftmann@26182
   221
definition new' where
haftmann@31205
   222
  [code del]: "new' = Array.new o Code_Numeral.nat_of"
haftmann@37752
   223
haftmann@28562
   224
lemma [code]:
haftmann@37752
   225
  "Array.new = new' o Code_Numeral.of_nat"
haftmann@26182
   226
  by (simp add: new'_def o_def)
haftmann@26182
   227
haftmann@26182
   228
definition of_list' where
haftmann@31205
   229
  [code del]: "of_list' i xs = Array.of_list (take (Code_Numeral.nat_of i) xs)"
haftmann@37752
   230
haftmann@28562
   231
lemma [code]:
haftmann@37752
   232
  "Array.of_list xs = of_list' (Code_Numeral.of_nat (List.length xs)) xs"
haftmann@26182
   233
  by (simp add: of_list'_def)
haftmann@26182
   234
haftmann@26182
   235
definition make' where
haftmann@31205
   236
  [code del]: "make' i f = Array.make (Code_Numeral.nat_of i) (f o Code_Numeral.of_nat)"
haftmann@37752
   237
haftmann@28562
   238
lemma [code]:
haftmann@37752
   239
  "Array.make n f = make' (Code_Numeral.of_nat n) (f o Code_Numeral.nat_of)"
haftmann@26182
   240
  by (simp add: make'_def o_def)
haftmann@26182
   241
haftmann@37719
   242
definition len' where
haftmann@37719
   243
  [code del]: "len' a = Array.len a \<guillemotright>= (\<lambda>n. return (Code_Numeral.of_nat n))"
haftmann@37752
   244
haftmann@28562
   245
lemma [code]:
haftmann@37752
   246
  "Array.len a = len' a \<guillemotright>= (\<lambda>i. return (Code_Numeral.nat_of i))"
haftmann@37719
   247
  by (simp add: len'_def)
haftmann@26182
   248
haftmann@26182
   249
definition nth' where
haftmann@31205
   250
  [code del]: "nth' a = Array.nth a o Code_Numeral.nat_of"
haftmann@37752
   251
haftmann@28562
   252
lemma [code]:
haftmann@37752
   253
  "Array.nth a n = nth' a (Code_Numeral.of_nat n)"
haftmann@26182
   254
  by (simp add: nth'_def)
haftmann@26182
   255
haftmann@26182
   256
definition upd' where
haftmann@31205
   257
  [code del]: "upd' a i x = Array.upd (Code_Numeral.nat_of i) x a \<guillemotright> return ()"
haftmann@37752
   258
haftmann@28562
   259
lemma [code]:
haftmann@37752
   260
  "Array.upd i x a = upd' a (Code_Numeral.of_nat i) x \<guillemotright> return a"
haftmann@37709
   261
  by (simp add: upd'_def upd_return)
haftmann@26182
   262
haftmann@37752
   263
lemma [code]:
haftmann@37752
   264
  "map_entry i f a = (do
haftmann@37752
   265
     x \<leftarrow> nth a i;
haftmann@37752
   266
     upd i (f x) a
haftmann@37752
   267
   done)"
haftmann@37752
   268
  by (rule Heap_eqI) (simp add: bindM_def guard_def map_entry_def)
haftmann@26182
   269
haftmann@37752
   270
lemma [code]:
haftmann@37752
   271
  "swap i x a = (do
haftmann@37752
   272
     y \<leftarrow> nth a i;
haftmann@37752
   273
     upd i x a;
haftmann@37752
   274
     return y
haftmann@37752
   275
   done)"
haftmann@37752
   276
  by (rule Heap_eqI) (simp add: bindM_def guard_def swap_def)
haftmann@37752
   277
haftmann@37752
   278
lemma [code]:
haftmann@37752
   279
  "freeze a = (do
haftmann@37752
   280
     n \<leftarrow> len a;
haftmann@37752
   281
     mapM (\<lambda>i. nth a i) [0..<n]
haftmann@37752
   282
   done)"
haftmann@37752
   283
proof (rule Heap_eqI)
haftmann@37752
   284
  fix h
haftmann@37752
   285
  have *: "List.map
haftmann@37752
   286
     (\<lambda>x. fst (the (if x < length a h
haftmann@37752
   287
                    then Some (get_array a h ! x, h) else None)))
haftmann@37752
   288
     [0..<length a h] =
haftmann@37752
   289
       List.map (List.nth (get_array a h)) [0..<length a h]"
haftmann@37752
   290
    by simp
haftmann@37752
   291
  have "Heap_Monad.execute (mapM (Array.nth a) [0..<length a h]) h =
haftmann@37752
   292
    Some (get_array a h, h)"
haftmann@37752
   293
    apply (subst execute_mapM_unchanged_heap)
haftmann@37752
   294
    apply (simp_all add: nth_def guard_def *)
haftmann@37752
   295
    apply (simp add: length_def map_nth)
haftmann@37752
   296
    done
haftmann@37752
   297
  then have "Heap_Monad.execute (do
haftmann@37752
   298
      n \<leftarrow> len a;
haftmann@37752
   299
      mapM (Array.nth a) [0..<n]
haftmann@37752
   300
    done) h = Some (get_array a h, h)"
haftmann@37752
   301
    by (auto intro: execute_eq_SomeI)
haftmann@37752
   302
  then show "Heap_Monad.execute (freeze a) h = Heap_Monad.execute (do
haftmann@37752
   303
      n \<leftarrow> len a;
haftmann@37752
   304
      mapM (Array.nth a) [0..<n]
haftmann@37752
   305
    done) h" by simp
haftmann@37752
   306
qed
haftmann@37752
   307
haftmann@37752
   308
hide_const (open) new' of_list' make' len' nth' upd'
haftmann@37752
   309
haftmann@37752
   310
haftmann@37752
   311
text {* SML *}
haftmann@26182
   312
haftmann@26182
   313
code_type array (SML "_/ array")
haftmann@26182
   314
code_const Array (SML "raise/ (Fail/ \"bare Array\")")
haftmann@26752
   315
code_const Array.new' (SML "(fn/ ()/ =>/ Array.array/ ((_),/ (_)))")
haftmann@35846
   316
code_const Array.of_list' (SML "(fn/ ()/ =>/ Array.fromList/ _)")
haftmann@26752
   317
code_const Array.make' (SML "(fn/ ()/ =>/ Array.tabulate/ ((_),/ (_)))")
haftmann@37719
   318
code_const Array.len' (SML "(fn/ ()/ =>/ Array.length/ _)")
haftmann@26752
   319
code_const Array.nth' (SML "(fn/ ()/ =>/ Array.sub/ ((_),/ (_)))")
haftmann@26752
   320
code_const Array.upd' (SML "(fn/ ()/ =>/ Array.update/ ((_),/ (_),/ (_)))")
haftmann@26182
   321
haftmann@26182
   322
code_reserved SML Array
haftmann@26182
   323
haftmann@26182
   324
haftmann@37752
   325
text {* OCaml *}
haftmann@26182
   326
haftmann@26182
   327
code_type array (OCaml "_/ array")
haftmann@26182
   328
code_const Array (OCaml "failwith/ \"bare Array\"")
haftmann@32580
   329
code_const Array.new' (OCaml "(fun/ ()/ ->/ Array.make/ (Big'_int.int'_of'_big'_int/ _)/ _)")
haftmann@35846
   330
code_const Array.of_list' (OCaml "(fun/ ()/ ->/ Array.of'_list/ _)")
haftmann@37719
   331
code_const Array.len' (OCaml "(fun/ ()/ ->/ Big'_int.big'_int'_of'_int/ (Array.length/ _))")
haftmann@32580
   332
code_const Array.nth' (OCaml "(fun/ ()/ ->/ Array.get/ _/ (Big'_int.int'_of'_big'_int/ _))")
haftmann@32580
   333
code_const Array.upd' (OCaml "(fun/ ()/ ->/ Array.set/ _/ (Big'_int.int'_of'_big'_int/ _)/ _)")
haftmann@26182
   334
haftmann@26182
   335
code_reserved OCaml Array
haftmann@26182
   336
haftmann@26182
   337
haftmann@37752
   338
text {* Haskell *}
haftmann@26182
   339
haftmann@29793
   340
code_type array (Haskell "Heap.STArray/ Heap.RealWorld/ _")
haftmann@26182
   341
code_const Array (Haskell "error/ \"bare Array\"")
haftmann@29793
   342
code_const Array.new' (Haskell "Heap.newArray/ (0,/ _)")
haftmann@29793
   343
code_const Array.of_list' (Haskell "Heap.newListArray/ (0,/ _)")
haftmann@37719
   344
code_const Array.len' (Haskell "Heap.lengthArray")
haftmann@29793
   345
code_const Array.nth' (Haskell "Heap.readArray")
haftmann@29793
   346
code_const Array.upd' (Haskell "Heap.writeArray")
haftmann@26182
   347
haftmann@26170
   348
end