src/HOL/Nitpick.thy
author haftmann
Thu Apr 18 06:06:54 2019 +0000 (5 weeks ago)
changeset 70183 3ea80c950023
parent 69605 a96320074298
permissions -rw-r--r--
incorporated various material from the AFP into the distribution
blanchet@33192
     1
(*  Title:      HOL/Nitpick.thy
blanchet@33192
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@35807
     3
    Copyright   2008, 2009, 2010
blanchet@33192
     4
blanchet@33192
     5
Nitpick: Yet another counterexample generator for Isabelle/HOL.
blanchet@33192
     6
*)
blanchet@33192
     7
wenzelm@60758
     8
section \<open>Nitpick: Yet Another Counterexample Generator for Isabelle/HOL\<close>
blanchet@33192
     9
blanchet@33192
    10
theory Nitpick
haftmann@65555
    11
imports Record GCD
blanchet@55539
    12
keywords
blanchet@55539
    13
  "nitpick" :: diag and
blanchet@55539
    14
  "nitpick_params" :: thy_decl
blanchet@33192
    15
begin
blanchet@33192
    16
blanchet@58350
    17
datatype (plugins only: extraction) (dead 'a, dead 'b) fun_box = FunBox "'a \<Rightarrow> 'b"
blanchet@58350
    18
datatype (plugins only: extraction) (dead 'a, dead 'b) pair_box = PairBox 'a 'b
blanchet@58350
    19
datatype (plugins only: extraction) (dead 'a) word = Word "'a set"
blanchet@33192
    20
blanchet@57992
    21
typedecl bisim_iterator
blanchet@34124
    22
typedecl unsigned_bit
blanchet@34124
    23
typedecl signed_bit
blanchet@34124
    24
blanchet@57992
    25
consts
blanchet@57992
    26
  unknown :: 'a
blanchet@57992
    27
  is_unknown :: "'a \<Rightarrow> bool"
blanchet@57992
    28
  bisim :: "bisim_iterator \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> bool"
blanchet@57992
    29
  bisim_iterator_max :: bisim_iterator
blanchet@57992
    30
  Quot :: "'a \<Rightarrow> 'b"
blanchet@57992
    31
  safe_The :: "('a \<Rightarrow> bool) \<Rightarrow> 'a"
blanchet@33192
    32
wenzelm@60758
    33
text \<open>
blanchet@33192
    34
Alternative definitions.
wenzelm@60758
    35
\<close>
blanchet@33192
    36
blanchet@57992
    37
lemma Ex1_unfold[nitpick_unfold]: "Ex1 P \<equiv> \<exists>x. {x. P x} = {x}"
blanchet@57992
    38
  apply (rule eq_reflection)
blanchet@57992
    39
  apply (simp add: Ex1_def set_eq_iff)
blanchet@57992
    40
  apply (rule iffI)
blanchet@57992
    41
   apply (erule exE)
blanchet@57992
    42
   apply (erule conjE)
blanchet@57992
    43
   apply (rule_tac x = x in exI)
blanchet@57992
    44
   apply (rule allI)
blanchet@57992
    45
   apply (rename_tac y)
blanchet@57992
    46
   apply (erule_tac x = y in allE)
blanchet@57992
    47
  by auto
blanchet@33192
    48
blanchet@57992
    49
lemma rtrancl_unfold[nitpick_unfold]: "r\<^sup>* \<equiv> (r\<^sup>+)\<^sup>="
haftmann@45140
    50
  by (simp only: rtrancl_trancl_reflcl)
blanchet@33192
    51
blanchet@57992
    52
lemma rtranclp_unfold[nitpick_unfold]: "rtranclp r a b \<equiv> (a = b \<or> tranclp r a b)"
blanchet@57992
    53
  by (rule eq_reflection) (auto dest: rtranclpD)
blanchet@33192
    54
blanchet@57992
    55
lemma tranclp_unfold[nitpick_unfold]:
blanchet@57992
    56
  "tranclp r a b \<equiv> (a, b) \<in> trancl {(x, y). r x y}"
blanchet@57992
    57
  by (simp add: trancl_def)
blanchet@33192
    58
blanchet@54148
    59
lemma [nitpick_simp]:
blanchet@57992
    60
  "of_nat n = (if n = 0 then 0 else 1 + of_nat (n - 1))"
blanchet@57992
    61
  by (cases n) auto
blanchet@47909
    62
blanchet@41046
    63
definition prod :: "'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<times> 'b) set" where
blanchet@57992
    64
  "prod A B = {(a, b). a \<in> A \<and> b \<in> B}"
blanchet@41046
    65
haftmann@44278
    66
definition refl' :: "('a \<times> 'a) set \<Rightarrow> bool" where
blanchet@57992
    67
  "refl' r \<equiv> \<forall>x. (x, x) \<in> r"
blanchet@33192
    68
haftmann@44278
    69
definition wf' :: "('a \<times> 'a) set \<Rightarrow> bool" where
blanchet@57992
    70
  "wf' r \<equiv> acyclic r \<and> (finite r \<or> unknown)"
blanchet@33192
    71
haftmann@44278
    72
definition card' :: "'a set \<Rightarrow> nat" where
blanchet@57992
    73
  "card' A \<equiv> if finite A then length (SOME xs. set xs = A \<and> distinct xs) else 0"
blanchet@33192
    74
nipkow@64267
    75
definition sum' :: "('a \<Rightarrow> 'b::comm_monoid_add) \<Rightarrow> 'a set \<Rightarrow> 'b" where
nipkow@64267
    76
  "sum' f A \<equiv> if finite A then sum_list (map f (SOME xs. set xs = A \<and> distinct xs)) else 0"
blanchet@33192
    77
haftmann@44278
    78
inductive fold_graph' :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'b \<Rightarrow> 'a set \<Rightarrow> 'b \<Rightarrow> bool" where
blanchet@57992
    79
  "fold_graph' f z {} z" |
blanchet@57992
    80
  "\<lbrakk>x \<in> A; fold_graph' f z (A - {x}) y\<rbrakk> \<Longrightarrow> fold_graph' f z A (f x y)"
blanchet@33192
    81
wenzelm@60758
    82
text \<open>
blanchet@33192
    83
The following lemmas are not strictly necessary but they help the
blanchet@47909
    84
\textit{specialize} optimization.
wenzelm@60758
    85
\<close>
blanchet@33192
    86
nipkow@67399
    87
lemma The_psimp[nitpick_psimp]: "P = (=) x \<Longrightarrow> The P = x"
haftmann@45970
    88
  by auto
blanchet@33192
    89
blanchet@57992
    90
lemma Eps_psimp[nitpick_psimp]:
blanchet@57992
    91
  "\<lbrakk>P x; \<not> P y; Eps P = y\<rbrakk> \<Longrightarrow> Eps P = x"
blanchet@57992
    92
  apply (cases "P (Eps P)")
blanchet@57992
    93
   apply auto
blanchet@57992
    94
  apply (erule contrapos_np)
blanchet@57992
    95
  by (rule someI)
blanchet@33192
    96
blanchet@57992
    97
lemma case_unit_unfold[nitpick_unfold]:
blanchet@57992
    98
  "case_unit x u \<equiv> x"
blanchet@57992
    99
  apply (subgoal_tac "u = ()")
blanchet@57992
   100
   apply (simp only: unit.case)
blanchet@57992
   101
  by simp
blanchet@33192
   102
blanchet@57992
   103
declare unit.case[nitpick_simp del]
blanchet@33556
   104
blanchet@57992
   105
lemma case_nat_unfold[nitpick_unfold]:
blanchet@57992
   106
  "case_nat x f n \<equiv> if n = 0 then x else f (n - 1)"
blanchet@57992
   107
  apply (rule eq_reflection)
blanchet@57992
   108
  by (cases n) auto
blanchet@33192
   109
blanchet@57992
   110
declare nat.case[nitpick_simp del]
blanchet@33556
   111
blanchet@57992
   112
lemma size_list_simp[nitpick_simp]:
blanchet@57992
   113
  "size_list f xs = (if xs = [] then 0 else Suc (f (hd xs) + size_list f (tl xs)))"
blanchet@57992
   114
  "size xs = (if xs = [] then 0 else Suc (size (tl xs)))"
blanchet@57992
   115
  by (cases xs) auto
blanchet@33192
   116
wenzelm@60758
   117
text \<open>
blanchet@33192
   118
Auxiliary definitions used to provide an alternative representation for
wenzelm@61799
   119
\<open>rat\<close> and \<open>real\<close>.
wenzelm@60758
   120
\<close>
blanchet@33192
   121
haftmann@66011
   122
fun nat_gcd :: "nat \<Rightarrow> nat \<Rightarrow> nat" where
blanchet@57992
   123
  "nat_gcd x y = (if y = 0 then x else nat_gcd y (x mod y))"
haftmann@66011
   124
  
haftmann@65555
   125
declare nat_gcd.simps [simp del]
blanchet@33192
   126
blanchet@33192
   127
definition nat_lcm :: "nat \<Rightarrow> nat \<Rightarrow> nat" where
blanchet@57992
   128
  "nat_lcm x y = x * y div (nat_gcd x y)"
blanchet@33192
   129
haftmann@66011
   130
lemma gcd_eq_nitpick_gcd [nitpick_unfold]:
haftmann@66011
   131
  "gcd x y = Nitpick.nat_gcd x y"
haftmann@65555
   132
  by (induct x y rule: nat_gcd.induct)
haftmann@65555
   133
    (simp add: gcd_nat.simps Nitpick.nat_gcd.simps)
haftmann@65555
   134
haftmann@66011
   135
lemma lcm_eq_nitpick_lcm [nitpick_unfold]:
haftmann@66011
   136
  "lcm x y = Nitpick.nat_lcm x y"
haftmann@65555
   137
  by (simp only: lcm_nat_def Nitpick.nat_lcm_def gcd_eq_nitpick_gcd)
haftmann@65555
   138
blanchet@33192
   139
definition Frac :: "int \<times> int \<Rightarrow> bool" where
haftmann@67051
   140
  "Frac \<equiv> \<lambda>(a, b). b > 0 \<and> coprime a b"
blanchet@33192
   141
blanchet@57992
   142
consts
blanchet@57992
   143
  Abs_Frac :: "int \<times> int \<Rightarrow> 'a"
blanchet@56643
   144
  Rep_Frac :: "'a \<Rightarrow> int \<times> int"
blanchet@33192
   145
blanchet@33192
   146
definition zero_frac :: 'a where
blanchet@57992
   147
  "zero_frac \<equiv> Abs_Frac (0, 1)"
blanchet@33192
   148
blanchet@33192
   149
definition one_frac :: 'a where
blanchet@57992
   150
  "one_frac \<equiv> Abs_Frac (1, 1)"
blanchet@33192
   151
blanchet@33192
   152
definition num :: "'a \<Rightarrow> int" where
wenzelm@67091
   153
  "num \<equiv> fst \<circ> Rep_Frac"
blanchet@33192
   154
blanchet@33192
   155
definition denom :: "'a \<Rightarrow> int" where
wenzelm@67091
   156
  "denom \<equiv> snd \<circ> Rep_Frac"
blanchet@33192
   157
blanchet@33192
   158
function norm_frac :: "int \<Rightarrow> int \<Rightarrow> int \<times> int" where
blanchet@57992
   159
  "norm_frac a b =
blanchet@57992
   160
    (if b < 0 then norm_frac (- a) (- b)
blanchet@57992
   161
     else if a = 0 \<or> b = 0 then (0, 1)
haftmann@66011
   162
     else let c = gcd a b in (a div c, b div c))"
blanchet@57992
   163
  by pat_completeness auto
blanchet@57992
   164
  termination by (relation "measure (\<lambda>(_, b). if b < 0 then 1 else 0)") auto
blanchet@57992
   165
blanchet@57992
   166
declare norm_frac.simps[simp del]
blanchet@33192
   167
blanchet@33192
   168
definition frac :: "int \<Rightarrow> int \<Rightarrow> 'a" where
blanchet@57992
   169
  "frac a b \<equiv> Abs_Frac (norm_frac a b)"
blanchet@33192
   170
blanchet@33192
   171
definition plus_frac :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
haftmann@66011
   172
  [nitpick_simp]: "plus_frac q r = (let d = lcm (denom q) (denom r) in
blanchet@57992
   173
    frac (num q * (d div denom q) + num r * (d div denom r)) d)"
blanchet@33192
   174
blanchet@33192
   175
definition times_frac :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" where
blanchet@57992
   176
  [nitpick_simp]: "times_frac q r = frac (num q * num r) (denom q * denom r)"
blanchet@33192
   177
blanchet@33192
   178
definition uminus_frac :: "'a \<Rightarrow> 'a" where
blanchet@57992
   179
  "uminus_frac q \<equiv> Abs_Frac (- num q, denom q)"
blanchet@33192
   180
blanchet@33192
   181
definition number_of_frac :: "int \<Rightarrow> 'a" where
blanchet@57992
   182
  "number_of_frac n \<equiv> Abs_Frac (n, 1)"
blanchet@33192
   183
blanchet@33192
   184
definition inverse_frac :: "'a \<Rightarrow> 'a" where
blanchet@57992
   185
  "inverse_frac q \<equiv> frac (denom q) (num q)"
blanchet@33192
   186
blanchet@37397
   187
definition less_frac :: "'a \<Rightarrow> 'a \<Rightarrow> bool" where
blanchet@57992
   188
  [nitpick_simp]: "less_frac q r \<longleftrightarrow> num (plus_frac q (uminus_frac r)) < 0"
blanchet@37397
   189
blanchet@33192
   190
definition less_eq_frac :: "'a \<Rightarrow> 'a \<Rightarrow> bool" where
blanchet@57992
   191
  [nitpick_simp]: "less_eq_frac q r \<longleftrightarrow> num (plus_frac q (uminus_frac r)) \<le> 0"
blanchet@33192
   192
wenzelm@61076
   193
definition of_frac :: "'a \<Rightarrow> 'b::{inverse,ring_1}" where
blanchet@57992
   194
  "of_frac q \<equiv> of_int (num q) / of_int (denom q)"
blanchet@33192
   195
blanchet@55017
   196
axiomatization wf_wfrec :: "('a \<times> 'a) set \<Rightarrow> (('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b"
blanchet@55017
   197
blanchet@55017
   198
definition wf_wfrec' :: "('a \<times> 'a) set \<Rightarrow> (('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b" where
blanchet@57992
   199
  [nitpick_simp]: "wf_wfrec' R F x = F (cut (wf_wfrec R F) R x) x"
blanchet@55017
   200
blanchet@55017
   201
definition wfrec' ::  "('a \<times> 'a) set \<Rightarrow> (('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b" where
blanchet@57992
   202
  "wfrec' R F x \<equiv> if wf R then wf_wfrec' R F x else THE y. wfrec_rel R (\<lambda>f x. F (cut f R x) x) x y"
blanchet@55017
   203
wenzelm@69605
   204
ML_file \<open>Tools/Nitpick/kodkod.ML\<close>
wenzelm@69605
   205
ML_file \<open>Tools/Nitpick/kodkod_sat.ML\<close>
wenzelm@69605
   206
ML_file \<open>Tools/Nitpick/nitpick_util.ML\<close>
wenzelm@69605
   207
ML_file \<open>Tools/Nitpick/nitpick_hol.ML\<close>
wenzelm@69605
   208
ML_file \<open>Tools/Nitpick/nitpick_mono.ML\<close>
wenzelm@69605
   209
ML_file \<open>Tools/Nitpick/nitpick_preproc.ML\<close>
wenzelm@69605
   210
ML_file \<open>Tools/Nitpick/nitpick_scope.ML\<close>
wenzelm@69605
   211
ML_file \<open>Tools/Nitpick/nitpick_peephole.ML\<close>
wenzelm@69605
   212
ML_file \<open>Tools/Nitpick/nitpick_rep.ML\<close>
wenzelm@69605
   213
ML_file \<open>Tools/Nitpick/nitpick_nut.ML\<close>
wenzelm@69605
   214
ML_file \<open>Tools/Nitpick/nitpick_kodkod.ML\<close>
wenzelm@69605
   215
ML_file \<open>Tools/Nitpick/nitpick_model.ML\<close>
wenzelm@69605
   216
ML_file \<open>Tools/Nitpick/nitpick.ML\<close>
wenzelm@69605
   217
ML_file \<open>Tools/Nitpick/nitpick_commands.ML\<close>
wenzelm@69605
   218
ML_file \<open>Tools/Nitpick/nitpick_tests.ML\<close>
blanchet@33192
   219
wenzelm@60758
   220
setup \<open>
krauss@44016
   221
  Nitpick_HOL.register_ersatz_global
wenzelm@69593
   222
    [(\<^const_name>\<open>card\<close>, \<^const_name>\<open>card'\<close>),
wenzelm@69593
   223
     (\<^const_name>\<open>sum\<close>, \<^const_name>\<open>sum'\<close>),
wenzelm@69593
   224
     (\<^const_name>\<open>fold_graph\<close>, \<^const_name>\<open>fold_graph'\<close>),
wenzelm@69593
   225
     (\<^const_name>\<open>wf\<close>, \<^const_name>\<open>wf'\<close>),
wenzelm@69593
   226
     (\<^const_name>\<open>wf_wfrec\<close>, \<^const_name>\<open>wf_wfrec'\<close>),
wenzelm@69593
   227
     (\<^const_name>\<open>wfrec\<close>, \<^const_name>\<open>wfrec'\<close>)]
wenzelm@60758
   228
\<close>
blanchet@33561
   229
blanchet@57992
   230
hide_const (open) unknown is_unknown bisim bisim_iterator_max Quot safe_The FunBox PairBox Word prod
haftmann@66011
   231
  refl' wf' card' sum' fold_graph' nat_gcd nat_lcm Frac Abs_Frac Rep_Frac
blanchet@57992
   232
  zero_frac one_frac num denom norm_frac frac plus_frac times_frac uminus_frac number_of_frac
blanchet@57992
   233
  inverse_frac less_frac less_eq_frac of_frac wf_wfrec wf_wfrec wfrec'
blanchet@57992
   234
blanchet@46324
   235
hide_type (open) bisim_iterator fun_box pair_box unsigned_bit signed_bit word
blanchet@57992
   236
blanchet@57992
   237
hide_fact (open) Ex1_unfold rtrancl_unfold rtranclp_unfold tranclp_unfold prod_def refl'_def wf'_def
nipkow@64267
   238
  card'_def sum'_def The_psimp Eps_psimp case_unit_unfold case_nat_unfold
haftmann@66011
   239
  size_list_simp nat_lcm_def Frac_def zero_frac_def one_frac_def
wenzelm@61121
   240
  num_def denom_def frac_def plus_frac_def times_frac_def uminus_frac_def
blanchet@57992
   241
  number_of_frac_def inverse_frac_def less_frac_def less_eq_frac_def of_frac_def wf_wfrec'_def
blanchet@57992
   242
  wfrec'_def
blanchet@33192
   243
blanchet@33192
   244
end