src/HOL/Library/Efficient_Nat.thy
author haftmann
Tue Sep 16 09:21:24 2008 +0200 (2008-09-16)
changeset 28228 7ebe8dc06cbb
parent 27673 52056ddac194
child 28346 b8390cd56b8f
permissions -rw-r--r--
evaluation using code generator
haftmann@23854
     1
(*  Title:      HOL/Library/Efficient_Nat.thy
haftmann@23854
     2
    ID:         $Id$
haftmann@25931
     3
    Author:     Stefan Berghofer, Florian Haftmann, TU Muenchen
haftmann@23854
     4
*)
haftmann@23854
     5
haftmann@25931
     6
header {* Implementation of natural numbers by target-language integers *}
haftmann@23854
     7
haftmann@23854
     8
theory Efficient_Nat
haftmann@28228
     9
imports Plain Code_Index Code_Integer
haftmann@23854
    10
begin
haftmann@23854
    11
haftmann@23854
    12
text {*
haftmann@25931
    13
  When generating code for functions on natural numbers, the
haftmann@25931
    14
  canonical representation using @{term "0::nat"} and
haftmann@25931
    15
  @{term "Suc"} is unsuitable for computations involving large
haftmann@25931
    16
  numbers.  The efficiency of the generated code can be improved
haftmann@25931
    17
  drastically by implementing natural numbers by target-language
haftmann@25931
    18
  integers.  To do this, just include this theory.
haftmann@23854
    19
*}
haftmann@23854
    20
haftmann@25931
    21
subsection {* Basic arithmetic *}
haftmann@23854
    22
haftmann@23854
    23
text {*
haftmann@23854
    24
  Most standard arithmetic functions on natural numbers are implemented
haftmann@23854
    25
  using their counterparts on the integers:
haftmann@23854
    26
*}
haftmann@23854
    27
haftmann@25931
    28
code_datatype number_nat_inst.number_of_nat
haftmann@24715
    29
haftmann@25931
    30
lemma zero_nat_code [code, code unfold]:
haftmann@25931
    31
  "0 = (Numeral0 :: nat)"
haftmann@25931
    32
  by simp
haftmann@25931
    33
lemmas [code post] = zero_nat_code [symmetric]
haftmann@24715
    34
haftmann@25931
    35
lemma one_nat_code [code, code unfold]:
haftmann@25931
    36
  "1 = (Numeral1 :: nat)"
haftmann@25931
    37
  by simp
haftmann@25931
    38
lemmas [code post] = one_nat_code [symmetric]
haftmann@24715
    39
haftmann@25931
    40
lemma Suc_code [code]:
haftmann@25931
    41
  "Suc n = n + 1"
haftmann@25931
    42
  by simp
haftmann@24715
    43
haftmann@25931
    44
lemma plus_nat_code [code]:
haftmann@25931
    45
  "n + m = nat (of_nat n + of_nat m)"
haftmann@25931
    46
  by simp
haftmann@24715
    47
haftmann@25931
    48
lemma minus_nat_code [code]:
haftmann@25931
    49
  "n - m = nat (of_nat n - of_nat m)"
haftmann@25931
    50
  by simp
haftmann@24715
    51
haftmann@25931
    52
lemma times_nat_code [code]:
haftmann@25931
    53
  "n * m = nat (of_nat n * of_nat m)"
haftmann@25931
    54
  unfolding of_nat_mult [symmetric] by simp
haftmann@24715
    55
haftmann@26009
    56
text {* Specialized @{term "op div \<Colon> nat \<Rightarrow> nat \<Rightarrow> nat"} 
haftmann@26009
    57
  and @{term "op mod \<Colon> nat \<Rightarrow> nat \<Rightarrow> nat"} operations. *}
haftmann@26009
    58
haftmann@26009
    59
definition
haftmann@26100
    60
  divmod_aux ::  "nat \<Rightarrow> nat \<Rightarrow> nat \<times> nat"
haftmann@26009
    61
where
haftmann@26100
    62
  [code func del]: "divmod_aux = divmod"
haftmann@24715
    63
haftmann@26009
    64
lemma [code func]:
haftmann@26100
    65
  "divmod n m = (if m = 0 then (0, n) else divmod_aux n m)"
haftmann@26100
    66
  unfolding divmod_aux_def divmod_div_mod by simp
haftmann@26009
    67
haftmann@26100
    68
lemma divmod_aux_code [code]:
haftmann@26100
    69
  "divmod_aux n m = (nat (of_nat n div of_nat m), nat (of_nat n mod of_nat m))"
haftmann@26100
    70
  unfolding divmod_aux_def divmod_div_mod zdiv_int [symmetric] zmod_int [symmetric] by simp
haftmann@24715
    71
haftmann@25931
    72
lemma eq_nat_code [code]:
haftmann@25931
    73
  "n = m \<longleftrightarrow> (of_nat n \<Colon> int) = of_nat m"
haftmann@25931
    74
  by simp
haftmann@24715
    75
haftmann@25931
    76
lemma less_eq_nat_code [code]:
haftmann@25931
    77
  "n \<le> m \<longleftrightarrow> (of_nat n \<Colon> int) \<le> of_nat m"
haftmann@25931
    78
  by simp
haftmann@23854
    79
haftmann@25931
    80
lemma less_nat_code [code]:
haftmann@25931
    81
  "n < m \<longleftrightarrow> (of_nat n \<Colon> int) < of_nat m"
haftmann@25931
    82
  by simp
haftmann@23854
    83
haftmann@25931
    84
subsection {* Case analysis *}
haftmann@23854
    85
haftmann@23854
    86
text {*
haftmann@25931
    87
  Case analysis on natural numbers is rephrased using a conditional
haftmann@25931
    88
  expression:
haftmann@23854
    89
*}
haftmann@23854
    90
haftmann@25931
    91
lemma [code func, code unfold]:
haftmann@25931
    92
  "nat_case = (\<lambda>f g n. if n = 0 then f else g (n - 1))"
haftmann@25931
    93
  by (auto simp add: expand_fun_eq dest!: gr0_implies_Suc)
haftmann@25615
    94
haftmann@23854
    95
haftmann@23854
    96
subsection {* Preprocessors *}
haftmann@23854
    97
haftmann@23854
    98
text {*
haftmann@23854
    99
  In contrast to @{term "Suc n"}, the term @{term "n + (1::nat)"} is no longer
haftmann@23854
   100
  a constructor term. Therefore, all occurrences of this term in a position
haftmann@23854
   101
  where a pattern is expected (i.e.\ on the left-hand side of a recursion
haftmann@23854
   102
  equation or in the arguments of an inductive relation in an introduction
haftmann@23854
   103
  rule) must be eliminated.
haftmann@23854
   104
  This can be accomplished by applying the following transformation rules:
haftmann@23854
   105
*}
haftmann@23854
   106
haftmann@25931
   107
lemma Suc_if_eq: "(\<And>n. f (Suc n) = h n) \<Longrightarrow> f 0 = g \<Longrightarrow>
haftmann@23854
   108
  f n = (if n = 0 then g else h (n - 1))"
haftmann@23854
   109
  by (case_tac n) simp_all
haftmann@23854
   110
haftmann@25931
   111
lemma Suc_clause: "(\<And>n. P n (Suc n)) \<Longrightarrow> n \<noteq> 0 \<Longrightarrow> P (n - 1) n"
haftmann@23854
   112
  by (case_tac n) simp_all
haftmann@23854
   113
haftmann@23854
   114
text {*
haftmann@23854
   115
  The rules above are built into a preprocessor that is plugged into
haftmann@23854
   116
  the code generator. Since the preprocessor for introduction rules
haftmann@23854
   117
  does not know anything about modes, some of the modes that worked
haftmann@23854
   118
  for the canonical representation of natural numbers may no longer work.
haftmann@23854
   119
*}
haftmann@23854
   120
haftmann@23854
   121
(*<*)
haftmann@27609
   122
setup {*
haftmann@27609
   123
let
haftmann@23854
   124
haftmann@23854
   125
fun remove_suc thy thms =
haftmann@23854
   126
  let
haftmann@23854
   127
    val vname = Name.variant (map fst
haftmann@23854
   128
      (fold (Term.add_varnames o Thm.full_prop_of) thms [])) "x";
haftmann@23854
   129
    val cv = cterm_of thy (Var ((vname, 0), HOLogic.natT));
haftmann@23854
   130
    fun lhs_of th = snd (Thm.dest_comb
haftmann@23854
   131
      (fst (Thm.dest_comb (snd (Thm.dest_comb (cprop_of th))))));
haftmann@23854
   132
    fun rhs_of th = snd (Thm.dest_comb (snd (Thm.dest_comb (cprop_of th))));
haftmann@23854
   133
    fun find_vars ct = (case term_of ct of
haftmann@23854
   134
        (Const ("Suc", _) $ Var _) => [(cv, snd (Thm.dest_comb ct))]
haftmann@23854
   135
      | _ $ _ =>
haftmann@23854
   136
        let val (ct1, ct2) = Thm.dest_comb ct
haftmann@23854
   137
        in 
haftmann@23854
   138
          map (apfst (fn ct => Thm.capply ct ct2)) (find_vars ct1) @
haftmann@23854
   139
          map (apfst (Thm.capply ct1)) (find_vars ct2)
haftmann@23854
   140
        end
haftmann@23854
   141
      | _ => []);
haftmann@23854
   142
    val eqs = maps
haftmann@23854
   143
      (fn th => map (pair th) (find_vars (lhs_of th))) thms;
haftmann@23854
   144
    fun mk_thms (th, (ct, cv')) =
haftmann@23854
   145
      let
haftmann@23854
   146
        val th' =
haftmann@23854
   147
          Thm.implies_elim
haftmann@23854
   148
           (Conv.fconv_rule (Thm.beta_conversion true)
haftmann@23854
   149
             (Drule.instantiate'
haftmann@23854
   150
               [SOME (ctyp_of_term ct)] [SOME (Thm.cabs cv ct),
haftmann@23854
   151
                 SOME (Thm.cabs cv' (rhs_of th)), NONE, SOME cv']
haftmann@24222
   152
               @{thm Suc_if_eq})) (Thm.forall_intr cv' th)
haftmann@23854
   153
      in
haftmann@23854
   154
        case map_filter (fn th'' =>
haftmann@23854
   155
            SOME (th'', singleton
haftmann@23854
   156
              (Variable.trade (K (fn [th'''] => [th''' RS th'])) (Variable.thm_context th'')) th'')
haftmann@23854
   157
          handle THM _ => NONE) thms of
haftmann@23854
   158
            [] => NONE
haftmann@23854
   159
          | thps =>
haftmann@23854
   160
              let val (ths1, ths2) = split_list thps
haftmann@23854
   161
              in SOME (subtract Thm.eq_thm (th :: ths1) thms @ ths2) end
haftmann@23854
   162
      end
haftmann@27609
   163
  in case get_first mk_thms eqs of
haftmann@23854
   164
      NONE => thms
haftmann@23854
   165
    | SOME x => remove_suc thy x
haftmann@23854
   166
  end;
haftmann@23854
   167
haftmann@23854
   168
fun eqn_suc_preproc thy ths =
haftmann@23854
   169
  let
haftmann@24222
   170
    val dest = fst o HOLogic.dest_eq o HOLogic.dest_Trueprop o prop_of;
haftmann@24222
   171
    fun contains_suc t = member (op =) (term_consts t) @{const_name Suc};
haftmann@23854
   172
  in
haftmann@23854
   173
    if forall (can dest) ths andalso
haftmann@23854
   174
      exists (contains_suc o dest) ths
haftmann@23854
   175
    then remove_suc thy ths else ths
haftmann@23854
   176
  end;
haftmann@23854
   177
haftmann@23854
   178
fun remove_suc_clause thy thms =
haftmann@23854
   179
  let
haftmann@23854
   180
    val vname = Name.variant (map fst
haftmann@23854
   181
      (fold (Term.add_varnames o Thm.full_prop_of) thms [])) "x";
haftmann@24222
   182
    fun find_var (t as Const (@{const_name Suc}, _) $ (v as Var _)) = SOME (t, v)
haftmann@23854
   183
      | find_var (t $ u) = (case find_var t of NONE => find_var u | x => x)
haftmann@23854
   184
      | find_var _ = NONE;
haftmann@23854
   185
    fun find_thm th =
haftmann@23854
   186
      let val th' = Conv.fconv_rule ObjectLogic.atomize th
haftmann@23854
   187
      in Option.map (pair (th, th')) (find_var (prop_of th')) end
haftmann@23854
   188
  in
haftmann@23854
   189
    case get_first find_thm thms of
haftmann@23854
   190
      NONE => thms
haftmann@23854
   191
    | SOME ((th, th'), (Sucv, v)) =>
haftmann@23854
   192
        let
haftmann@23854
   193
          val cert = cterm_of (Thm.theory_of_thm th);
haftmann@23854
   194
          val th'' = ObjectLogic.rulify (Thm.implies_elim
haftmann@23854
   195
            (Conv.fconv_rule (Thm.beta_conversion true)
haftmann@23854
   196
              (Drule.instantiate' []
haftmann@23854
   197
                [SOME (cert (lambda v (Abs ("x", HOLogic.natT,
haftmann@23854
   198
                   abstract_over (Sucv,
haftmann@23854
   199
                     HOLogic.dest_Trueprop (prop_of th')))))),
haftmann@24222
   200
                 SOME (cert v)] @{thm Suc_clause}))
haftmann@23854
   201
            (Thm.forall_intr (cert v) th'))
haftmann@23854
   202
        in
haftmann@23854
   203
          remove_suc_clause thy (map (fn th''' =>
haftmann@23854
   204
            if (op = o pairself prop_of) (th''', th) then th'' else th''') thms)
haftmann@23854
   205
        end
haftmann@23854
   206
  end;
haftmann@23854
   207
haftmann@23854
   208
fun clause_suc_preproc thy ths =
haftmann@23854
   209
  let
haftmann@23854
   210
    val dest = fst o HOLogic.dest_mem o HOLogic.dest_Trueprop
haftmann@23854
   211
  in
haftmann@23854
   212
    if forall (can (dest o concl_of)) ths andalso
haftmann@23854
   213
      exists (fn th => member (op =) (foldr add_term_consts
haftmann@23854
   214
        [] (map_filter (try dest) (concl_of th :: prems_of th))) "Suc") ths
haftmann@23854
   215
    then remove_suc_clause thy ths else ths
haftmann@23854
   216
  end;
haftmann@23854
   217
haftmann@27609
   218
fun lift f thy thms1 =
haftmann@27609
   219
  let
haftmann@27609
   220
    val thms2 = Drule.zero_var_indexes_list thms1;
haftmann@27609
   221
    val thms3 = try (map (fn thm => thm RS @{thm meta_eq_to_obj_eq})
haftmann@27609
   222
      #> f thy
haftmann@27609
   223
      #> map (fn thm => thm RS @{thm eq_reflection})
haftmann@27609
   224
      #> map (Conv.fconv_rule Drule.beta_eta_conversion)) thms2;
haftmann@27609
   225
    val thms4 = Option.map Drule.zero_var_indexes_list thms3;
haftmann@27609
   226
  in case thms4
haftmann@27609
   227
   of NONE => NONE
haftmann@27609
   228
    | SOME thms4 => if Thm.eq_thms (thms2, thms4) then NONE else SOME thms4
haftmann@27609
   229
  end
haftmann@23854
   230
haftmann@27609
   231
in
haftmann@27609
   232
haftmann@23854
   233
  Codegen.add_preprocessor eqn_suc_preproc
haftmann@23854
   234
  #> Codegen.add_preprocessor clause_suc_preproc
haftmann@27609
   235
  #> Code.add_functrans ("eqn_Suc", lift eqn_suc_preproc)
haftmann@27609
   236
  #> Code.add_functrans ("clause_Suc", lift clause_suc_preproc)
haftmann@27609
   237
haftmann@27609
   238
end;
haftmann@23854
   239
*}
haftmann@23854
   240
(*>*)
haftmann@23854
   241
haftmann@27609
   242
haftmann@25931
   243
subsection {* Target language setup *}
haftmann@25931
   244
haftmann@25931
   245
text {*
haftmann@25967
   246
  For ML, we map @{typ nat} to target language integers, where we
haftmann@25931
   247
  assert that values are always non-negative.
haftmann@25931
   248
*}
haftmann@25931
   249
haftmann@25931
   250
code_type nat
haftmann@27496
   251
  (SML "IntInf.int")
haftmann@25931
   252
  (OCaml "Big'_int.big'_int")
haftmann@25931
   253
haftmann@25931
   254
types_code
haftmann@25931
   255
  nat ("int")
haftmann@25931
   256
attach (term_of) {*
haftmann@25931
   257
val term_of_nat = HOLogic.mk_number HOLogic.natT;
haftmann@25931
   258
*}
haftmann@25931
   259
attach (test) {*
haftmann@25931
   260
fun gen_nat i =
haftmann@25931
   261
  let val n = random_range 0 i
haftmann@25931
   262
  in (n, fn () => term_of_nat n) end;
haftmann@25931
   263
*}
haftmann@25931
   264
haftmann@25931
   265
text {*
haftmann@25967
   266
  For Haskell we define our own @{typ nat} type.  The reason
haftmann@25967
   267
  is that we have to distinguish type class instances
haftmann@25967
   268
  for @{typ nat} and @{typ int}.
haftmann@25967
   269
*}
haftmann@25967
   270
haftmann@25967
   271
code_include Haskell "Nat" {*
haftmann@25967
   272
newtype Nat = Nat Integer deriving (Show, Eq);
haftmann@25967
   273
haftmann@25967
   274
instance Num Nat where {
haftmann@25967
   275
  fromInteger k = Nat (if k >= 0 then k else 0);
haftmann@25967
   276
  Nat n + Nat m = Nat (n + m);
haftmann@25967
   277
  Nat n - Nat m = fromInteger (n - m);
haftmann@25967
   278
  Nat n * Nat m = Nat (n * m);
haftmann@25967
   279
  abs n = n;
haftmann@25967
   280
  signum _ = 1;
haftmann@25967
   281
  negate n = error "negate Nat";
haftmann@25967
   282
};
haftmann@25967
   283
haftmann@25967
   284
instance Ord Nat where {
haftmann@25967
   285
  Nat n <= Nat m = n <= m;
haftmann@25967
   286
  Nat n < Nat m = n < m;
haftmann@25967
   287
};
haftmann@25967
   288
haftmann@25967
   289
instance Real Nat where {
haftmann@25967
   290
  toRational (Nat n) = toRational n;
haftmann@25967
   291
};
haftmann@25967
   292
haftmann@25967
   293
instance Enum Nat where {
haftmann@25967
   294
  toEnum k = fromInteger (toEnum k);
haftmann@25967
   295
  fromEnum (Nat n) = fromEnum n;
haftmann@25967
   296
};
haftmann@25967
   297
haftmann@25967
   298
instance Integral Nat where {
haftmann@25967
   299
  toInteger (Nat n) = n;
haftmann@25967
   300
  divMod n m = quotRem n m;
haftmann@25967
   301
  quotRem (Nat n) (Nat m) = (Nat k, Nat l) where (k, l) = quotRem n m;
haftmann@25967
   302
};
haftmann@25967
   303
*}
haftmann@25967
   304
haftmann@25967
   305
code_reserved Haskell Nat
haftmann@25967
   306
haftmann@25967
   307
code_type nat
haftmann@25967
   308
  (Haskell "Nat")
haftmann@25967
   309
haftmann@25967
   310
code_instance nat :: eq
haftmann@25967
   311
  (Haskell -)
haftmann@25967
   312
haftmann@25967
   313
text {*
haftmann@25931
   314
  Natural numerals.
haftmann@25931
   315
*}
haftmann@25931
   316
haftmann@25967
   317
lemma [code inline, symmetric, code post]:
haftmann@25931
   318
  "nat (number_of i) = number_nat_inst.number_of_nat i"
haftmann@25931
   319
  -- {* this interacts as desired with @{thm nat_number_of_def} *}
haftmann@25931
   320
  by (simp add: number_nat_inst.number_of_nat)
haftmann@25931
   321
haftmann@25931
   322
setup {*
haftmann@25931
   323
  fold (Numeral.add_code @{const_name number_nat_inst.number_of_nat}
haftmann@25967
   324
    true false) ["SML", "OCaml", "Haskell"]
haftmann@25931
   325
*}
haftmann@25931
   326
haftmann@25931
   327
text {*
haftmann@25931
   328
  Since natural numbers are implemented
haftmann@25967
   329
  using integers in ML, the coercion function @{const "of_nat"} of type
haftmann@25931
   330
  @{typ "nat \<Rightarrow> int"} is simply implemented by the identity function.
haftmann@25931
   331
  For the @{const "nat"} function for converting an integer to a natural
haftmann@25931
   332
  number, we give a specific implementation using an ML function that
haftmann@25931
   333
  returns its input value, provided that it is non-negative, and otherwise
haftmann@25931
   334
  returns @{text "0"}.
haftmann@25931
   335
*}
haftmann@25931
   336
haftmann@25931
   337
definition
haftmann@25931
   338
  int :: "nat \<Rightarrow> int"
haftmann@25931
   339
where
haftmann@25931
   340
  [code func del]: "int = of_nat"
haftmann@25931
   341
haftmann@25931
   342
lemma int_code' [code func]:
haftmann@25931
   343
  "int (number_of l) = (if neg (number_of l \<Colon> int) then 0 else number_of l)"
haftmann@25931
   344
  unfolding int_nat_number_of [folded int_def] ..
haftmann@25931
   345
haftmann@25931
   346
lemma nat_code' [code func]:
haftmann@25931
   347
  "nat (number_of l) = (if neg (number_of l \<Colon> int) then 0 else number_of l)"
haftmann@25931
   348
  by auto
haftmann@25931
   349
haftmann@25931
   350
lemma of_nat_int [code unfold]:
haftmann@25931
   351
  "of_nat = int" by (simp add: int_def)
haftmann@25967
   352
declare of_nat_int [symmetric, code post]
haftmann@25931
   353
haftmann@25931
   354
code_const int
haftmann@25931
   355
  (SML "_")
haftmann@25931
   356
  (OCaml "_")
haftmann@25931
   357
haftmann@25931
   358
consts_code
haftmann@25931
   359
  int ("(_)")
haftmann@25931
   360
  nat ("\<module>nat")
haftmann@25931
   361
attach {*
haftmann@25931
   362
fun nat i = if i < 0 then 0 else i;
haftmann@25931
   363
*}
haftmann@25931
   364
haftmann@25967
   365
code_const nat
haftmann@25967
   366
  (SML "IntInf.max/ (/0,/ _)")
haftmann@25967
   367
  (OCaml "Big'_int.max'_big'_int/ Big'_int.zero'_big'_int")
haftmann@25967
   368
haftmann@25967
   369
text {* For Haskell, things are slightly different again. *}
haftmann@25967
   370
haftmann@25967
   371
code_const int and nat
haftmann@25967
   372
  (Haskell "toInteger" and "fromInteger")
haftmann@25931
   373
haftmann@25931
   374
text {* Conversion from and to indices. *}
haftmann@25931
   375
haftmann@25967
   376
code_const index_of_nat
haftmann@25967
   377
  (SML "IntInf.toInt")
haftmann@25967
   378
  (OCaml "Big'_int.int'_of'_big'_int")
haftmann@27673
   379
  (Haskell "fromEnum")
haftmann@25967
   380
haftmann@25931
   381
code_const nat_of_index
haftmann@25931
   382
  (SML "IntInf.fromInt")
haftmann@25931
   383
  (OCaml "Big'_int.big'_int'_of'_int")
haftmann@27673
   384
  (Haskell "toEnum")
haftmann@25931
   385
haftmann@25931
   386
text {* Using target language arithmetic operations whenever appropriate *}
haftmann@25931
   387
haftmann@25931
   388
code_const "op + \<Colon> nat \<Rightarrow> nat \<Rightarrow> nat"
haftmann@25931
   389
  (SML "IntInf.+ ((_), (_))")
haftmann@25931
   390
  (OCaml "Big'_int.add'_big'_int")
haftmann@25931
   391
  (Haskell infixl 6 "+")
haftmann@25931
   392
haftmann@25931
   393
code_const "op * \<Colon> nat \<Rightarrow> nat \<Rightarrow> nat"
haftmann@25931
   394
  (SML "IntInf.* ((_), (_))")
haftmann@25931
   395
  (OCaml "Big'_int.mult'_big'_int")
haftmann@25931
   396
  (Haskell infixl 7 "*")
haftmann@25931
   397
haftmann@26100
   398
code_const divmod_aux
haftmann@26009
   399
  (SML "IntInf.divMod/ ((_),/ (_))")
haftmann@26009
   400
  (OCaml "Big'_int.quomod'_big'_int")
haftmann@26009
   401
  (Haskell "divMod")
haftmann@25931
   402
haftmann@25931
   403
code_const "op = \<Colon> nat \<Rightarrow> nat \<Rightarrow> bool"
haftmann@25931
   404
  (SML "!((_ : IntInf.int) = _)")
haftmann@25931
   405
  (OCaml "Big'_int.eq'_big'_int")
haftmann@25931
   406
  (Haskell infixl 4 "==")
haftmann@25931
   407
haftmann@25931
   408
code_const "op \<le> \<Colon> nat \<Rightarrow> nat \<Rightarrow> bool"
haftmann@25931
   409
  (SML "IntInf.<= ((_), (_))")
haftmann@25931
   410
  (OCaml "Big'_int.le'_big'_int")
haftmann@25931
   411
  (Haskell infix 4 "<=")
haftmann@25931
   412
haftmann@25931
   413
code_const "op < \<Colon> nat \<Rightarrow> nat \<Rightarrow> bool"
haftmann@25931
   414
  (SML "IntInf.< ((_), (_))")
haftmann@25931
   415
  (OCaml "Big'_int.lt'_big'_int")
haftmann@25931
   416
  (Haskell infix 4 "<")
haftmann@25931
   417
haftmann@25931
   418
consts_code
haftmann@25931
   419
  0                            ("0")
haftmann@25931
   420
  Suc                          ("(_ +/ 1)")
haftmann@25931
   421
  "op + \<Colon>  nat \<Rightarrow> nat \<Rightarrow> nat"   ("(_ +/ _)")
haftmann@25931
   422
  "op * \<Colon>  nat \<Rightarrow> nat \<Rightarrow> nat"   ("(_ */ _)")
haftmann@25931
   423
  "op \<le> \<Colon>  nat \<Rightarrow> nat \<Rightarrow> bool"  ("(_ <=/ _)")
haftmann@25931
   424
  "op < \<Colon>  nat \<Rightarrow> nat \<Rightarrow> bool"  ("(_ </ _)")
haftmann@25931
   425
haftmann@25931
   426
haftmann@28228
   427
text {* Evaluation *}
haftmann@28228
   428
haftmann@28228
   429
lemma [code func, code func del]:
haftmann@28228
   430
  "(Code_Eval.term_of \<Colon> nat \<Rightarrow> term) = Code_Eval.term_of" ..
haftmann@28228
   431
haftmann@28228
   432
code_const "Code_Eval.term_of \<Colon> nat \<Rightarrow> term"
haftmann@28228
   433
  (SML "HOLogic.mk'_number/ HOLogic.natT")
haftmann@28228
   434
haftmann@28228
   435
haftmann@25931
   436
text {* Module names *}
haftmann@23854
   437
haftmann@23854
   438
code_modulename SML
haftmann@23854
   439
  Nat Integer
haftmann@23854
   440
  Divides Integer
haftmann@23854
   441
  Efficient_Nat Integer
haftmann@23854
   442
haftmann@23854
   443
code_modulename OCaml
haftmann@23854
   444
  Nat Integer
haftmann@23854
   445
  Divides Integer
haftmann@23854
   446
  Efficient_Nat Integer
haftmann@23854
   447
haftmann@23854
   448
code_modulename Haskell
haftmann@23854
   449
  Nat Integer
haftmann@24195
   450
  Divides Integer
haftmann@23854
   451
  Efficient_Nat Integer
haftmann@23854
   452
haftmann@25931
   453
hide const int
haftmann@23854
   454
haftmann@23854
   455
end