two target language numeral types: integer and natural, as replacement for code_numeral;
former theory HOL/Library/Code_Numeral_Types replaces HOL/Code_Numeral;
refined stack of theories implementing int and/or nat by target language numerals;
reduced number of target language numeral types to exactly one
(* Title: HOL/ex/Code_Binary_Nat_examples.thy
Author: Florian Haftmann, TU Muenchen
*)
header {* Simple examples for natural numbers implemented in binary representation. *}
theory Code_Binary_Nat_examples
imports Complex_Main "~~/src/HOL/Library/Code_Binary_Nat"
begin
fun to_n :: "nat \<Rightarrow> nat list"
where
"to_n 0 = []"
| "to_n (Suc 0) = []"
| "to_n (Suc (Suc 0)) = []"
| "to_n (Suc n) = n # to_n n"
definition naive_prime :: "nat \<Rightarrow> bool"
where
"naive_prime n \<longleftrightarrow> n \<ge> 2 \<and> filter (\<lambda>m. n mod m = 0) (to_n n) = []"
primrec fac :: "nat \<Rightarrow> nat"
where
"fac 0 = 1"
| "fac (Suc n) = Suc n * fac n"
primrec harmonic :: "nat \<Rightarrow> rat"
where
"harmonic 0 = 0"
| "harmonic (Suc n) = 1 / of_nat (Suc n) + harmonic n"
lemma "harmonic 200 \<ge> 5"
by eval
lemma "(let (q, r) = quotient_of (harmonic 8) in q div r) \<ge> 2"
by normalization
lemma "naive_prime 89"
by eval
lemma "naive_prime 89"
by normalization
lemma "\<not> naive_prime 87"
by eval
lemma "\<not> naive_prime 87"
by normalization
lemma "fac 10 > 3000000"
by eval
lemma "fac 10 > 3000000"
by normalization
end