src/HOL/Nitpick.thy
author blanchet
Wed Jan 20 11:54:19 2010 +0100 (2010-01-20)
changeset 34938 f4d3daddac42
parent 34124 c4628a1dcf75
child 34982 7b8c366e34a2
permissions -rw-r--r--
fix issues with previous Nitpick change
     1 (*  Title:      HOL/Nitpick.thy
     2     Author:     Jasmin Blanchette, TU Muenchen
     3     Copyright   2008, 2009
     4 
     5 Nitpick: Yet another counterexample generator for Isabelle/HOL.
     6 *)
     7 
     8 header {* Nitpick: Yet Another Counterexample Generator for Isabelle/HOL *}
     9 
    10 theory Nitpick
    11 imports Map SAT
    12 uses ("Tools/Nitpick/kodkod.ML")
    13      ("Tools/Nitpick/kodkod_sat.ML")
    14      ("Tools/Nitpick/nitpick_util.ML")
    15      ("Tools/Nitpick/nitpick_hol.ML")
    16      ("Tools/Nitpick/nitpick_mono.ML")
    17      ("Tools/Nitpick/nitpick_scope.ML")
    18      ("Tools/Nitpick/nitpick_peephole.ML")
    19      ("Tools/Nitpick/nitpick_rep.ML")
    20      ("Tools/Nitpick/nitpick_nut.ML")
    21      ("Tools/Nitpick/nitpick_kodkod.ML")
    22      ("Tools/Nitpick/nitpick_model.ML")
    23      ("Tools/Nitpick/nitpick.ML")
    24      ("Tools/Nitpick/nitpick_isar.ML")
    25      ("Tools/Nitpick/nitpick_tests.ML")
    26      ("Tools/Nitpick/minipick.ML")
    27 begin
    28 
    29 typedecl bisim_iterator
    30 
    31 axiomatization unknown :: 'a
    32            and is_unknown :: "'a \<Rightarrow> bool"
    33            and undefined_fast_The :: 'a
    34            and undefined_fast_Eps :: 'a
    35            and bisim :: "bisim_iterator \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> bool"
    36            and bisim_iterator_max :: bisim_iterator
    37            and Quot :: "'a \<Rightarrow> 'b"
    38            and quot_normal :: "'a \<Rightarrow> 'a"
    39            and Tha :: "('a \<Rightarrow> bool) \<Rightarrow> 'a"
    40 
    41 datatype ('a, 'b) pair_box = PairBox 'a 'b
    42 datatype ('a, 'b) fun_box = FunBox "('a \<Rightarrow> 'b)"
    43 
    44 typedecl unsigned_bit
    45 typedecl signed_bit
    46 
    47 datatype 'a word = Word "('a set)"
    48 
    49 text {*
    50 Alternative definitions.
    51 *}
    52 
    53 lemma If_def [nitpick_def]:
    54 "(if P then Q else R) \<equiv> (P \<longrightarrow> Q) \<and> (\<not> P \<longrightarrow> R)"
    55 by (rule eq_reflection) (rule if_bool_eq_conj)
    56 
    57 lemma Ex1_def [nitpick_def]:
    58 "Ex1 P \<equiv> \<exists>x. P = {x}"
    59 apply (rule eq_reflection)
    60 apply (simp add: Ex1_def expand_set_eq)
    61 apply (rule iffI)
    62  apply (erule exE)
    63  apply (erule conjE)
    64  apply (rule_tac x = x in exI)
    65  apply (rule allI)
    66  apply (rename_tac y)
    67  apply (erule_tac x = y in allE)
    68 by (auto simp: mem_def)
    69 
    70 lemma rtrancl_def [nitpick_def]: "r\<^sup>* \<equiv> (r\<^sup>+)\<^sup>="
    71 by simp
    72 
    73 lemma rtranclp_def [nitpick_def]:
    74 "rtranclp r a b \<equiv> (a = b \<or> tranclp r a b)"
    75 by (rule eq_reflection) (auto dest: rtranclpD)
    76 
    77 lemma tranclp_def [nitpick_def]:
    78 "tranclp r a b \<equiv> trancl (split r) (a, b)"
    79 by (simp add: trancl_def Collect_def mem_def)
    80 
    81 definition refl' :: "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> bool" where
    82 "refl' r \<equiv> \<forall>x. (x, x) \<in> r"
    83 
    84 definition wf' :: "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> bool" where
    85 "wf' r \<equiv> acyclic r \<and> (finite r \<or> unknown)"
    86 
    87 axiomatization wf_wfrec :: "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> (('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b"
    88 
    89 definition wf_wfrec' :: "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> (('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b" where
    90 [nitpick_simp]: "wf_wfrec' R F x = F (Recdef.cut (wf_wfrec R F) R x) x"
    91 
    92 definition wfrec' ::  "('a \<times> 'a \<Rightarrow> bool) \<Rightarrow> (('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b" where
    93 "wfrec' R F x \<equiv> if wf R then wf_wfrec' R F x
    94                 else THE y. wfrec_rel R (%f x. F (Recdef.cut f R x) x) x y"
    95 
    96 definition card' :: "('a \<Rightarrow> bool) \<Rightarrow> nat" where
    97 "card' X \<equiv> length (SOME xs. set xs = X \<and> distinct xs)"
    98 
    99 definition setsum' :: "('a \<Rightarrow> 'b\<Colon>comm_monoid_add) \<Rightarrow> ('a \<Rightarrow> bool) \<Rightarrow> 'b" where
   100 "setsum' f A \<equiv> if finite A then listsum (map f (SOME xs. set xs = A \<and> distinct xs)) else 0"
   101 
   102 inductive fold_graph' :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> bool) \<Rightarrow> 'b \<Rightarrow> bool" where
   103 "fold_graph' f z {} z" |
   104 "\<lbrakk>x \<in> A; fold_graph' f z (A - {x}) y\<rbrakk> \<Longrightarrow> fold_graph' f z A (f x y)"
   105 
   106 text {*
   107 The following lemmas are not strictly necessary but they help the
   108 \textit{special\_level} optimization.
   109 *}
   110 
   111 lemma The_psimp [nitpick_psimp]:
   112 "P = {x} \<Longrightarrow> The P = x"
   113 by (subgoal_tac "{x} = (\<lambda>y. y = x)") (auto simp: mem_def)
   114 
   115 lemma Eps_psimp [nitpick_psimp]:
   116 "\<lbrakk>P x; \<not> P y; Eps P = y\<rbrakk> \<Longrightarrow> Eps P = x"
   117 apply (case_tac "P (Eps P)")
   118  apply auto
   119 apply (erule contrapos_np)
   120 by (rule someI)
   121 
   122 lemma unit_case_def [nitpick_def]:
   123 "unit_case x u \<equiv> x"
   124 apply (subgoal_tac "u = ()")
   125  apply (simp only: unit.cases)
   126 by simp
   127 
   128 declare unit.cases [nitpick_simp del]
   129 
   130 lemma nat_case_def [nitpick_def]:
   131 "nat_case x f n \<equiv> if n = 0 then x else f (n - 1)"
   132 apply (rule eq_reflection)
   133 by (case_tac n) auto
   134 
   135 declare nat.cases [nitpick_simp del]
   136 
   137 lemma list_size_simp [nitpick_simp]:
   138 "list_size f xs = (if xs = [] then 0
   139                    else Suc (f (hd xs) + list_size f (tl xs)))"
   140 "size xs = (if xs = [] then 0 else Suc (size (tl xs)))"
   141 by (case_tac xs) auto
   142 
   143 text {*
   144 Auxiliary definitions used to provide an alternative representation for
   145 @{text rat} and @{text real}.
   146 *}
   147 
   148 function nat_gcd :: "nat \<Rightarrow> nat \<Rightarrow> nat" where
   149 [simp del]: "nat_gcd x y = (if y = 0 then x else nat_gcd y (x mod y))"
   150 by auto
   151 termination
   152 apply (relation "measure (\<lambda>(x, y). x + y + (if y > x then 1 else 0))")
   153  apply auto
   154  apply (metis mod_less_divisor xt1(9))
   155 by (metis mod_mod_trivial mod_self nat_neq_iff xt1(10))
   156 
   157 definition nat_lcm :: "nat \<Rightarrow> nat \<Rightarrow> nat" where
   158 "nat_lcm x y = x * y div (nat_gcd x y)"
   159 
   160 definition int_gcd :: "int \<Rightarrow> int \<Rightarrow> int" where
   161 "int_gcd x y = int (nat_gcd (nat (abs x)) (nat (abs y)))"
   162 
   163 definition int_lcm :: "int \<Rightarrow> int \<Rightarrow> int" where
   164 "int_lcm x y = int (nat_lcm (nat (abs x)) (nat (abs y)))"
   165 
   166 definition Frac :: "int \<times> int \<Rightarrow> bool" where
   167 "Frac \<equiv> \<lambda>(a, b). b > 0 \<and> int_gcd a b = 1"
   168 
   169 axiomatization Abs_Frac :: "int \<times> int \<Rightarrow> 'a"
   170            and Rep_Frac :: "'a \<Rightarrow> int \<times> int"
   171 
   172 definition zero_frac :: 'a where
   173 "zero_frac \<equiv> Abs_Frac (0, 1)"
   174 
   175 definition one_frac :: 'a where
   176 "one_frac \<equiv> Abs_Frac (1, 1)"
   177 
   178 definition num :: "'a \<Rightarrow> int" where
   179 "num \<equiv> fst o Rep_Frac"
   180 
   181 definition denom :: "'a \<Rightarrow> int" where
   182 "denom \<equiv> snd o Rep_Frac"
   183 
   184 function norm_frac :: "int \<Rightarrow> int \<Rightarrow> int \<times> int" where
   185 [simp del]: "norm_frac a b = (if b < 0 then norm_frac (- a) (- b)
   186                               else if a = 0 \<or> b = 0 then (0, 1)
   187                               else let c = int_gcd a b in (a div c, b div c))"
   188 by pat_completeness auto
   189 termination by (relation "measure (\<lambda>(_, b). if b < 0 then 1 else 0)") auto
   190 
   191 definition frac :: "int \<Rightarrow> int \<Rightarrow> 'a" where
   192 "frac a b \<equiv> Abs_Frac (norm_frac a b)"
   193 
   194 definition plus_frac :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
   195 [nitpick_simp]:
   196 "plus_frac q r = (let d = int_lcm (denom q) (denom r) in
   197                     frac (num q * (d div denom q) + num r * (d div denom r)) d)"
   198 
   199 definition times_frac :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
   200 [nitpick_simp]:
   201 "times_frac q r = frac (num q * num r) (denom q * denom r)"
   202 
   203 definition uminus_frac :: "'a \<Rightarrow> 'a" where
   204 "uminus_frac q \<equiv> Abs_Frac (- num q, denom q)"
   205 
   206 definition number_of_frac :: "int \<Rightarrow> 'a" where
   207 "number_of_frac n \<equiv> Abs_Frac (n, 1)"
   208 
   209 definition inverse_frac :: "'a \<Rightarrow> 'a" where
   210 "inverse_frac q \<equiv> frac (denom q) (num q)"
   211 
   212 definition less_eq_frac :: "'a \<Rightarrow> 'a \<Rightarrow> bool" where
   213 [nitpick_simp]:
   214 "less_eq_frac q r \<longleftrightarrow> num (plus_frac q (uminus_frac r)) \<le> 0"
   215 
   216 definition of_frac :: "'a \<Rightarrow> 'b\<Colon>{inverse,ring_1}" where
   217 "of_frac q \<equiv> of_int (num q) / of_int (denom q)"
   218 
   219 (* While Nitpick normally avoids to unfold definitions for locales, it
   220    unfortunately needs to unfold them when dealing with the following built-in
   221    constants. A cleaner approach would be to change "Nitpick_HOL" and
   222    "Nitpick_Nut" so that they handle the unexpanded overloaded constants
   223    directly, but this is slightly more tricky to implement. *)
   224 lemmas [nitpick_def] = div_int_inst.div_int div_int_inst.mod_int
   225     div_nat_inst.div_nat div_nat_inst.mod_nat lower_semilattice_fun_inst.inf_fun
   226     minus_fun_inst.minus_fun minus_int_inst.minus_int minus_nat_inst.minus_nat
   227     one_int_inst.one_int one_nat_inst.one_nat ord_fun_inst.less_eq_fun
   228     ord_int_inst.less_eq_int ord_int_inst.less_int ord_nat_inst.less_eq_nat
   229     ord_nat_inst.less_nat plus_int_inst.plus_int plus_nat_inst.plus_nat
   230     times_int_inst.times_int times_nat_inst.times_nat uminus_int_inst.uminus_int
   231     upper_semilattice_fun_inst.sup_fun zero_int_inst.zero_int
   232     zero_nat_inst.zero_nat
   233 
   234 use "Tools/Nitpick/kodkod.ML"
   235 use "Tools/Nitpick/kodkod_sat.ML"
   236 use "Tools/Nitpick/nitpick_util.ML"
   237 use "Tools/Nitpick/nitpick_hol.ML"
   238 use "Tools/Nitpick/nitpick_mono.ML"
   239 use "Tools/Nitpick/nitpick_scope.ML"
   240 use "Tools/Nitpick/nitpick_peephole.ML"
   241 use "Tools/Nitpick/nitpick_rep.ML"
   242 use "Tools/Nitpick/nitpick_nut.ML"
   243 use "Tools/Nitpick/nitpick_kodkod.ML"
   244 use "Tools/Nitpick/nitpick_model.ML"
   245 use "Tools/Nitpick/nitpick.ML"
   246 use "Tools/Nitpick/nitpick_isar.ML"
   247 use "Tools/Nitpick/nitpick_tests.ML"
   248 use "Tools/Nitpick/minipick.ML"
   249 
   250 setup {* Nitpick_Isar.setup *}
   251 
   252 hide (open) const unknown is_unknown undefined_fast_The undefined_fast_Eps bisim 
   253     bisim_iterator_max Quot quot_normal Tha PairBox FunBox Word refl' wf'
   254     wf_wfrec wf_wfrec' wfrec' card' setsum' fold_graph' nat_gcd nat_lcm int_gcd
   255     int_lcm Frac Abs_Frac Rep_Frac zero_frac one_frac num denom norm_frac frac
   256     plus_frac times_frac uminus_frac number_of_frac inverse_frac less_eq_frac
   257     of_frac
   258 hide (open) type bisim_iterator pair_box fun_box unsigned_bit signed_bit word
   259 hide (open) fact If_def Ex1_def rtrancl_def rtranclp_def tranclp_def refl'_def
   260     wf'_def wf_wfrec'_def wfrec'_def card'_def setsum'_def fold_graph'_def
   261     The_psimp Eps_psimp unit_case_def nat_case_def list_size_simp nat_gcd_def
   262     nat_lcm_def int_gcd_def int_lcm_def Frac_def zero_frac_def one_frac_def
   263     num_def denom_def norm_frac_def frac_def plus_frac_def times_frac_def
   264     uminus_frac_def number_of_frac_def inverse_frac_def less_eq_frac_def
   265     of_frac_def
   266 
   267 end