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