src/HOL/Nitpick_Examples/Manual_Nits.thy
author nipkow
Mon Jan 30 21:49:41 2012 +0100 (2012-01-30)
changeset 46372 6fa9cdb8b850
parent 46162 1148fab5104e
child 47092 fa3538d6004b
permissions -rw-r--r--
added "'a rel"
blanchet@33197
     1
(*  Title:      HOL/Nitpick_Examples/Manual_Nits.thy
blanchet@33197
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@45035
     3
    Copyright   2009-2011
blanchet@33197
     4
blanchet@33197
     5
Examples from the Nitpick manual.
blanchet@33197
     6
*)
blanchet@33197
     7
blanchet@33197
     8
header {* Examples from the Nitpick Manual *}
blanchet@33197
     9
blanchet@37477
    10
(* The "expect" arguments to Nitpick in this theory and the other example
blanchet@37477
    11
   theories are there so that the example can also serve as a regression test
blanchet@37477
    12
   suite. *)
blanchet@37477
    13
blanchet@33197
    14
theory Manual_Nits
wenzelm@41413
    15
imports Main "~~/src/HOL/Library/Quotient_Product" RealDef
blanchet@33197
    16
begin
blanchet@33197
    17
blanchet@45053
    18
chapter {* 2. First Steps *}
blanchet@33197
    19
blanchet@46104
    20
nitpick_params [sat_solver = MiniSat_JNI, max_threads = 1, timeout = 240]
blanchet@33197
    21
blanchet@45053
    22
subsection {* 2.1. Propositional Logic *}
blanchet@33197
    23
blanchet@33197
    24
lemma "P \<longleftrightarrow> Q"
blanchet@35671
    25
nitpick [expect = genuine]
blanchet@33197
    26
apply auto
blanchet@35671
    27
nitpick [expect = genuine] 1
blanchet@35671
    28
nitpick [expect = genuine] 2
blanchet@33197
    29
oops
blanchet@33197
    30
blanchet@45053
    31
subsection {* 2.2. Type Variables *}
blanchet@33197
    32
blanchet@46104
    33
lemma "x \<in> A \<Longrightarrow> (THE y. y \<in> A) \<in> A"
blanchet@35671
    34
nitpick [verbose, expect = genuine]
blanchet@33197
    35
oops
blanchet@33197
    36
blanchet@45053
    37
subsection {* 2.3. Constants *}
blanchet@33197
    38
blanchet@46104
    39
lemma "x \<in> A \<Longrightarrow> (THE y. y \<in> A) \<in> A"
blanchet@35671
    40
nitpick [show_consts, expect = genuine]
blanchet@39362
    41
nitpick [dont_specialize, show_consts, expect = genuine]
blanchet@33197
    42
oops
blanchet@33197
    43
blanchet@46104
    44
lemma "\<exists>!x. x \<in> A \<Longrightarrow> (THE y. y \<in> A) \<in> A"
blanchet@35671
    45
nitpick [expect = none]
blanchet@42959
    46
nitpick [card 'a = 1\<emdash>50, expect = none]
blanchet@33197
    47
(* sledgehammer *)
blanchet@46104
    48
by (metis the_equality)
blanchet@33197
    49
blanchet@45053
    50
subsection {* 2.4. Skolemization *}
blanchet@33197
    51
blanchet@33197
    52
lemma "\<exists>g. \<forall>x. g (f x) = x \<Longrightarrow> \<forall>y. \<exists>x. y = f x"
blanchet@35671
    53
nitpick [expect = genuine]
blanchet@33197
    54
oops
blanchet@33197
    55
blanchet@33197
    56
lemma "\<exists>x. \<forall>f. f x = x"
blanchet@35671
    57
nitpick [expect = genuine]
blanchet@33197
    58
oops
blanchet@33197
    59
blanchet@33197
    60
lemma "refl r \<Longrightarrow> sym r"
blanchet@35671
    61
nitpick [expect = genuine]
blanchet@33197
    62
oops
blanchet@33197
    63
blanchet@45053
    64
subsection {* 2.5. Natural Numbers and Integers *}
blanchet@33197
    65
blanchet@33197
    66
lemma "\<lbrakk>i \<le> j; n \<le> (m\<Colon>int)\<rbrakk> \<Longrightarrow> i * n + j * m \<le> i * m + j * n"
blanchet@35671
    67
nitpick [expect = genuine]
blanchet@46104
    68
nitpick [binary_ints, bits = 16, expect = genuine]
blanchet@33197
    69
oops
blanchet@33197
    70
blanchet@33197
    71
lemma "\<forall>n. Suc n \<noteq> n \<Longrightarrow> P"
blanchet@42421
    72
nitpick [card nat = 100, check_potential, tac_timeout = 5, expect = genuine]
blanchet@33197
    73
oops
blanchet@33197
    74
blanchet@33197
    75
lemma "P Suc"
blanchet@35671
    76
nitpick [expect = none]
blanchet@33197
    77
oops
blanchet@33197
    78
blanchet@33197
    79
lemma "P (op +\<Colon>nat\<Rightarrow>nat\<Rightarrow>nat)"
blanchet@35671
    80
nitpick [card nat = 1, expect = genuine]
blanchet@35671
    81
nitpick [card nat = 2, expect = none]
blanchet@33197
    82
oops
blanchet@33197
    83
blanchet@45053
    84
subsection {* 2.6. Inductive Datatypes *}
blanchet@33197
    85
blanchet@33197
    86
lemma "hd (xs @ [y, y]) = hd xs"
blanchet@35671
    87
nitpick [expect = genuine]
blanchet@35671
    88
nitpick [show_consts, show_datatypes, expect = genuine]
blanchet@33197
    89
oops
blanchet@33197
    90
blanchet@33197
    91
lemma "\<lbrakk>length xs = 1; length ys = 1\<rbrakk> \<Longrightarrow> xs = ys"
blanchet@35671
    92
nitpick [show_datatypes, expect = genuine]
blanchet@33197
    93
oops
blanchet@33197
    94
blanchet@45053
    95
subsection {* 2.7. Typedefs, Records, Rationals, and Reals *}
blanchet@33197
    96
blanchet@46104
    97
typedef three = "{0\<Colon>nat, 1, 2}"
blanchet@46104
    98
by blast
blanchet@33197
    99
blanchet@33197
   100
definition A :: three where "A \<equiv> Abs_three 0"
blanchet@33197
   101
definition B :: three where "B \<equiv> Abs_three 1"
blanchet@33197
   102
definition C :: three where "C \<equiv> Abs_three 2"
blanchet@33197
   103
blanchet@46104
   104
lemma "\<lbrakk>A \<in> X; B \<in> X\<rbrakk> \<Longrightarrow> c \<in> X"
blanchet@35671
   105
nitpick [show_datatypes, expect = genuine]
blanchet@33197
   106
oops
blanchet@33197
   107
blanchet@35284
   108
fun my_int_rel where
blanchet@35284
   109
"my_int_rel (x, y) (u, v) = (x + v = u + y)"
blanchet@35284
   110
blanchet@35284
   111
quotient_type my_int = "nat \<times> nat" / my_int_rel
nipkow@39302
   112
by (auto simp add: equivp_def fun_eq_iff)
blanchet@35284
   113
blanchet@35284
   114
definition add_raw where
blanchet@35284
   115
"add_raw \<equiv> \<lambda>(x, y) (u, v). (x + (u\<Colon>nat), y + (v\<Colon>nat))"
blanchet@35284
   116
blanchet@35284
   117
quotient_definition "add\<Colon>my_int \<Rightarrow> my_int \<Rightarrow> my_int" is add_raw
blanchet@35284
   118
blanchet@35284
   119
lemma "add x y = add x x"
blanchet@35671
   120
nitpick [show_datatypes, expect = genuine]
blanchet@35284
   121
oops
blanchet@35284
   122
blanchet@35711
   123
ML {*
blanchet@35712
   124
fun my_int_postproc _ _ _ T (Const _ $ (Const _ $ t1 $ t2)) =
blanchet@35712
   125
    HOLogic.mk_number T (snd (HOLogic.dest_number t1)
blanchet@35712
   126
                         - snd (HOLogic.dest_number t2))
blanchet@35712
   127
  | my_int_postproc _ _ _ _ t = t
blanchet@35711
   128
*}
blanchet@35711
   129
blanchet@38288
   130
declaration {*
blanchet@38284
   131
Nitpick_Model.register_term_postprocessor @{typ my_int} my_int_postproc
blanchet@38242
   132
*}
blanchet@35711
   133
blanchet@35711
   134
lemma "add x y = add x x"
blanchet@35711
   135
nitpick [show_datatypes]
blanchet@35711
   136
oops
blanchet@35711
   137
blanchet@33197
   138
record point =
blanchet@33197
   139
  Xcoord :: int
blanchet@33197
   140
  Ycoord :: int
blanchet@33197
   141
blanchet@33197
   142
lemma "Xcoord (p\<Colon>point) = Xcoord (q\<Colon>point)"
blanchet@35671
   143
nitpick [show_datatypes, expect = genuine]
blanchet@33197
   144
oops
blanchet@33197
   145
blanchet@33197
   146
lemma "4 * x + 3 * (y\<Colon>real) \<noteq> 1 / 2"
blanchet@35671
   147
nitpick [show_datatypes, expect = genuine]
blanchet@33197
   148
oops
blanchet@33197
   149
blanchet@45053
   150
subsection {* 2.8. Inductive and Coinductive Predicates *}
blanchet@33197
   151
blanchet@33197
   152
inductive even where
blanchet@33197
   153
"even 0" |
blanchet@33197
   154
"even n \<Longrightarrow> even (Suc (Suc n))"
blanchet@33197
   155
blanchet@33197
   156
lemma "\<exists>n. even n \<and> even (Suc n)"
blanchet@35710
   157
nitpick [card nat = 50, unary_ints, verbose, expect = potential]
blanchet@33197
   158
oops
blanchet@33197
   159
blanchet@35710
   160
lemma "\<exists>n \<le> 49. even n \<and> even (Suc n)"
blanchet@38184
   161
nitpick [card nat = 50, unary_ints, expect = genuine]
blanchet@33197
   162
oops
blanchet@33197
   163
blanchet@33197
   164
inductive even' where
blanchet@33197
   165
"even' (0\<Colon>nat)" |
blanchet@33197
   166
"even' 2" |
blanchet@33197
   167
"\<lbrakk>even' m; even' n\<rbrakk> \<Longrightarrow> even' (m + n)"
blanchet@33197
   168
blanchet@33197
   169
lemma "\<exists>n \<in> {0, 2, 4, 6, 8}. \<not> even' n"
blanchet@35671
   170
nitpick [card nat = 10, unary_ints, verbose, show_consts, expect = genuine]
blanchet@33197
   171
oops
blanchet@33197
   172
blanchet@33197
   173
lemma "even' (n - 2) \<Longrightarrow> even' n"
blanchet@35671
   174
nitpick [card nat = 10, show_consts, expect = genuine]
blanchet@33197
   175
oops
blanchet@33197
   176
blanchet@33197
   177
coinductive nats where
blanchet@33197
   178
"nats (x\<Colon>nat) \<Longrightarrow> nats x"
blanchet@33197
   179
haftmann@45970
   180
lemma "nats = (\<lambda>n. n \<in> {0, 1, 2, 3, 4})"
blanchet@35671
   181
nitpick [card nat = 10, show_consts, expect = genuine]
blanchet@33197
   182
oops
blanchet@33197
   183
blanchet@33197
   184
inductive odd where
blanchet@33197
   185
"odd 1" |
blanchet@33197
   186
"\<lbrakk>odd m; even n\<rbrakk> \<Longrightarrow> odd (m + n)"
blanchet@33197
   187
blanchet@33197
   188
lemma "odd n \<Longrightarrow> odd (n - 2)"
blanchet@46105
   189
nitpick [card nat = 4, show_consts, expect = genuine]
blanchet@33197
   190
oops
blanchet@33197
   191
blanchet@45053
   192
subsection {* 2.9. Coinductive Datatypes *}
blanchet@33197
   193
blanchet@35665
   194
(* Lazy lists are defined in Andreas Lochbihler's "Coinductive" AFP entry. Since
blanchet@38184
   195
   we cannot rely on its presence, we expediently provide our own
blanchet@38184
   196
   axiomatization. The examples also work unchanged with Lochbihler's
blanchet@38184
   197
   "Coinductive_List" theory. *)
blanchet@35665
   198
blanchet@46106
   199
(* BEGIN LAZY LIST SETUP *)
wenzelm@45694
   200
definition "llist = (UNIV\<Colon>('a list + (nat \<Rightarrow> 'a)) set)"
wenzelm@45694
   201
wenzelm@45694
   202
typedef (open) 'a llist = "llist\<Colon>('a list + (nat \<Rightarrow> 'a)) set"
wenzelm@45694
   203
unfolding llist_def by auto
blanchet@35665
   204
blanchet@35671
   205
definition LNil where
blanchet@35671
   206
"LNil = Abs_llist (Inl [])"
blanchet@35665
   207
definition LCons where
blanchet@35665
   208
"LCons y ys = Abs_llist (case Rep_llist ys of
blanchet@35665
   209
                           Inl ys' \<Rightarrow> Inl (y # ys')
blanchet@35665
   210
                         | Inr f \<Rightarrow> Inr (\<lambda>n. case n of 0 \<Rightarrow> y | Suc m \<Rightarrow> f m))"
blanchet@35665
   211
blanchet@35665
   212
axiomatization iterates :: "('a \<Rightarrow> 'a) \<Rightarrow> 'a \<Rightarrow> 'a llist"
blanchet@35665
   213
blanchet@35665
   214
lemma iterates_def [nitpick_simp]:
blanchet@35665
   215
"iterates f a = LCons a (iterates f (f a))"
blanchet@35665
   216
sorry
blanchet@35665
   217
blanchet@38288
   218
declaration {*
blanchet@38284
   219
Nitpick_HOL.register_codatatype @{typ "'a llist"} ""
blanchet@35665
   220
    (map dest_Const [@{term LNil}, @{term LCons}])
blanchet@35665
   221
*}
blanchet@46106
   222
(* END LAZY LIST SETUP *)
blanchet@35665
   223
blanchet@33197
   224
lemma "xs \<noteq> LCons a xs"
blanchet@35671
   225
nitpick [expect = genuine]
blanchet@33197
   226
oops
blanchet@33197
   227
blanchet@33197
   228
lemma "\<lbrakk>xs = LCons a xs; ys = iterates (\<lambda>b. a) b\<rbrakk> \<Longrightarrow> xs = ys"
blanchet@35671
   229
nitpick [verbose, expect = genuine]
blanchet@33197
   230
oops
blanchet@33197
   231
blanchet@33197
   232
lemma "\<lbrakk>xs = LCons a xs; ys = LCons a ys\<rbrakk> \<Longrightarrow> xs = ys"
blanchet@35671
   233
nitpick [bisim_depth = -1, show_datatypes, expect = quasi_genuine]
blanchet@42959
   234
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   235
sorry
blanchet@33197
   236
blanchet@45053
   237
subsection {* 2.10. Boxing *}
blanchet@33197
   238
blanchet@33197
   239
datatype tm = Var nat | Lam tm | App tm tm
blanchet@33197
   240
blanchet@33197
   241
primrec lift where
blanchet@33197
   242
"lift (Var j) k = Var (if j < k then j else j + 1)" |
blanchet@33197
   243
"lift (Lam t) k = Lam (lift t (k + 1))" |
blanchet@33197
   244
"lift (App t u) k = App (lift t k) (lift u k)"
blanchet@33197
   245
blanchet@33197
   246
primrec loose where
blanchet@33197
   247
"loose (Var j) k = (j \<ge> k)" |
blanchet@33197
   248
"loose (Lam t) k = loose t (Suc k)" |
blanchet@33197
   249
"loose (App t u) k = (loose t k \<or> loose u k)"
blanchet@33197
   250
blanchet@33197
   251
primrec subst\<^isub>1 where
blanchet@33197
   252
"subst\<^isub>1 \<sigma> (Var j) = \<sigma> j" |
blanchet@33197
   253
"subst\<^isub>1 \<sigma> (Lam t) =
blanchet@33197
   254
 Lam (subst\<^isub>1 (\<lambda>n. case n of 0 \<Rightarrow> Var 0 | Suc m \<Rightarrow> lift (\<sigma> m) 1) t)" |
blanchet@33197
   255
"subst\<^isub>1 \<sigma> (App t u) = App (subst\<^isub>1 \<sigma> t) (subst\<^isub>1 \<sigma> u)"
blanchet@33197
   256
blanchet@33197
   257
lemma "\<not> loose t 0 \<Longrightarrow> subst\<^isub>1 \<sigma> t = t"
blanchet@35671
   258
nitpick [verbose, expect = genuine]
blanchet@35671
   259
nitpick [eval = "subst\<^isub>1 \<sigma> t", expect = genuine]
blanchet@35671
   260
(* nitpick [dont_box, expect = unknown] *)
blanchet@33197
   261
oops
blanchet@33197
   262
blanchet@33197
   263
primrec subst\<^isub>2 where
blanchet@33197
   264
"subst\<^isub>2 \<sigma> (Var j) = \<sigma> j" |
blanchet@33197
   265
"subst\<^isub>2 \<sigma> (Lam t) =
blanchet@33197
   266
 Lam (subst\<^isub>2 (\<lambda>n. case n of 0 \<Rightarrow> Var 0 | Suc m \<Rightarrow> lift (\<sigma> m) 0) t)" |
blanchet@33197
   267
"subst\<^isub>2 \<sigma> (App t u) = App (subst\<^isub>2 \<sigma> t) (subst\<^isub>2 \<sigma> u)"
blanchet@33197
   268
blanchet@33197
   269
lemma "\<not> loose t 0 \<Longrightarrow> subst\<^isub>2 \<sigma> t = t"
blanchet@42959
   270
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   271
sorry
blanchet@33197
   272
blanchet@45053
   273
subsection {* 2.11. Scope Monotonicity *}
blanchet@33197
   274
blanchet@33197
   275
lemma "length xs = length ys \<Longrightarrow> rev (zip xs ys) = zip xs (rev ys)"
blanchet@35671
   276
nitpick [verbose, expect = genuine]
blanchet@33197
   277
oops
blanchet@33197
   278
blanchet@33197
   279
lemma "\<exists>g. \<forall>x\<Colon>'b. g (f x) = x \<Longrightarrow> \<forall>y\<Colon>'a. \<exists>x. y = f x"
blanchet@35671
   280
nitpick [mono, expect = none]
blanchet@35671
   281
nitpick [expect = genuine]
blanchet@33197
   282
oops
blanchet@33197
   283
blanchet@45053
   284
subsection {* 2.12. Inductive Properties *}
blanchet@34982
   285
blanchet@34982
   286
inductive_set reach where
blanchet@34982
   287
"(4\<Colon>nat) \<in> reach" |
blanchet@34982
   288
"n \<in> reach \<Longrightarrow> n < 4 \<Longrightarrow> 3 * n + 1 \<in> reach" |
blanchet@34982
   289
"n \<in> reach \<Longrightarrow> n + 2 \<in> reach"
blanchet@34982
   290
blanchet@34982
   291
lemma "n \<in> reach \<Longrightarrow> 2 dvd n"
blanchet@38184
   292
(* nitpick *)
blanchet@34982
   293
apply (induct set: reach)
blanchet@34982
   294
  apply auto
blanchet@42959
   295
 nitpick [card = 1\<emdash>4, bits = 1\<emdash>4, expect = none]
blanchet@34982
   296
 apply (thin_tac "n \<in> reach")
blanchet@35671
   297
 nitpick [expect = genuine]
blanchet@34982
   298
oops
blanchet@34982
   299
blanchet@34982
   300
lemma "n \<in> reach \<Longrightarrow> 2 dvd n \<and> n \<noteq> 0"
blanchet@38184
   301
(* nitpick *)
blanchet@34982
   302
apply (induct set: reach)
blanchet@34982
   303
  apply auto
blanchet@42959
   304
 nitpick [card = 1\<emdash>4, bits = 1\<emdash>4, expect = none]
blanchet@34982
   305
 apply (thin_tac "n \<in> reach")
blanchet@35671
   306
 nitpick [expect = genuine]
blanchet@34982
   307
oops
blanchet@34982
   308
blanchet@34982
   309
lemma "n \<in> reach \<Longrightarrow> 2 dvd n \<and> n \<ge> 4"
blanchet@34982
   310
by (induct set: reach) arith+
blanchet@34982
   311
blanchet@34982
   312
datatype 'a bin_tree = Leaf 'a | Branch "'a bin_tree" "'a bin_tree"
blanchet@34982
   313
blanchet@34982
   314
primrec labels where
blanchet@34982
   315
"labels (Leaf a) = {a}" |
blanchet@34982
   316
"labels (Branch t u) = labels t \<union> labels u"
blanchet@34982
   317
blanchet@34982
   318
primrec swap where
blanchet@34982
   319
"swap (Leaf c) a b =
blanchet@34982
   320
 (if c = a then Leaf b else if c = b then Leaf a else Leaf c)" |
blanchet@34982
   321
"swap (Branch t u) a b = Branch (swap t a b) (swap u a b)"
blanchet@34982
   322
blanchet@35180
   323
lemma "{a, b} \<subseteq> labels t \<Longrightarrow> labels (swap t a b) = labels t"
blanchet@35671
   324
(* nitpick *)
blanchet@34982
   325
proof (induct t)
blanchet@34982
   326
  case Leaf thus ?case by simp
blanchet@34982
   327
next
blanchet@34982
   328
  case (Branch t u) thus ?case
blanchet@35671
   329
  (* nitpick *)
blanchet@35671
   330
  nitpick [non_std, show_all, expect = genuine]
blanchet@34982
   331
oops
blanchet@34982
   332
blanchet@34982
   333
lemma "labels (swap t a b) =
blanchet@34982
   334
       (if a \<in> labels t then
blanchet@34982
   335
          if b \<in> labels t then labels t else (labels t - {a}) \<union> {b}
blanchet@34982
   336
        else
blanchet@34982
   337
          if b \<in> labels t then (labels t - {b}) \<union> {a} else labels t)"
blanchet@35309
   338
(* nitpick *)
blanchet@34982
   339
proof (induct t)
blanchet@34982
   340
  case Leaf thus ?case by simp
blanchet@34982
   341
next
blanchet@34982
   342
  case (Branch t u) thus ?case
blanchet@42959
   343
  nitpick [non_std, card = 1\<emdash>4, expect = none]
blanchet@34982
   344
  by auto
blanchet@34982
   345
qed
blanchet@34982
   346
blanchet@45053
   347
section {* 3. Case Studies *}
blanchet@33197
   348
blanchet@36268
   349
nitpick_params [max_potential = 0]
blanchet@33197
   350
blanchet@45053
   351
subsection {* 3.1. A Context-Free Grammar *}
blanchet@33197
   352
blanchet@33197
   353
datatype alphabet = a | b
blanchet@33197
   354
blanchet@33197
   355
inductive_set S\<^isub>1 and A\<^isub>1 and B\<^isub>1 where
blanchet@33197
   356
  "[] \<in> S\<^isub>1"
blanchet@33197
   357
| "w \<in> A\<^isub>1 \<Longrightarrow> b # w \<in> S\<^isub>1"
blanchet@33197
   358
| "w \<in> B\<^isub>1 \<Longrightarrow> a # w \<in> S\<^isub>1"
blanchet@33197
   359
| "w \<in> S\<^isub>1 \<Longrightarrow> a # w \<in> A\<^isub>1"
blanchet@33197
   360
| "w \<in> S\<^isub>1 \<Longrightarrow> b # w \<in> S\<^isub>1"
blanchet@33197
   361
| "\<lbrakk>v \<in> B\<^isub>1; v \<in> B\<^isub>1\<rbrakk> \<Longrightarrow> a # v @ w \<in> B\<^isub>1"
blanchet@33197
   362
blanchet@33197
   363
theorem S\<^isub>1_sound:
blanchet@33197
   364
"w \<in> S\<^isub>1 \<longrightarrow> length [x \<leftarrow> w. x = a] = length [x \<leftarrow> w. x = b]"
blanchet@35671
   365
nitpick [expect = genuine]
blanchet@33197
   366
oops
blanchet@33197
   367
blanchet@33197
   368
inductive_set S\<^isub>2 and A\<^isub>2 and B\<^isub>2 where
blanchet@33197
   369
  "[] \<in> S\<^isub>2"
blanchet@33197
   370
| "w \<in> A\<^isub>2 \<Longrightarrow> b # w \<in> S\<^isub>2"
blanchet@33197
   371
| "w \<in> B\<^isub>2 \<Longrightarrow> a # w \<in> S\<^isub>2"
blanchet@33197
   372
| "w \<in> S\<^isub>2 \<Longrightarrow> a # w \<in> A\<^isub>2"
blanchet@33197
   373
| "w \<in> S\<^isub>2 \<Longrightarrow> b # w \<in> B\<^isub>2"
blanchet@33197
   374
| "\<lbrakk>v \<in> B\<^isub>2; v \<in> B\<^isub>2\<rbrakk> \<Longrightarrow> a # v @ w \<in> B\<^isub>2"
blanchet@33197
   375
blanchet@33197
   376
theorem S\<^isub>2_sound:
blanchet@33197
   377
"w \<in> S\<^isub>2 \<longrightarrow> length [x \<leftarrow> w. x = a] = length [x \<leftarrow> w. x = b]"
blanchet@35671
   378
nitpick [expect = genuine]
blanchet@33197
   379
oops
blanchet@33197
   380
blanchet@33197
   381
inductive_set S\<^isub>3 and A\<^isub>3 and B\<^isub>3 where
blanchet@33197
   382
  "[] \<in> S\<^isub>3"
blanchet@33197
   383
| "w \<in> A\<^isub>3 \<Longrightarrow> b # w \<in> S\<^isub>3"
blanchet@33197
   384
| "w \<in> B\<^isub>3 \<Longrightarrow> a # w \<in> S\<^isub>3"
blanchet@33197
   385
| "w \<in> S\<^isub>3 \<Longrightarrow> a # w \<in> A\<^isub>3"
blanchet@33197
   386
| "w \<in> S\<^isub>3 \<Longrightarrow> b # w \<in> B\<^isub>3"
blanchet@33197
   387
| "\<lbrakk>v \<in> B\<^isub>3; w \<in> B\<^isub>3\<rbrakk> \<Longrightarrow> a # v @ w \<in> B\<^isub>3"
blanchet@33197
   388
blanchet@33197
   389
theorem S\<^isub>3_sound:
blanchet@33197
   390
"w \<in> S\<^isub>3 \<longrightarrow> length [x \<leftarrow> w. x = a] = length [x \<leftarrow> w. x = b]"
blanchet@42959
   391
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   392
sorry
blanchet@33197
   393
blanchet@33197
   394
theorem S\<^isub>3_complete:
blanchet@33197
   395
"length [x \<leftarrow> w. x = a] = length [x \<leftarrow> w. x = b] \<longrightarrow> w \<in> S\<^isub>3"
blanchet@35671
   396
nitpick [expect = genuine]
blanchet@33197
   397
oops
blanchet@33197
   398
blanchet@33197
   399
inductive_set S\<^isub>4 and A\<^isub>4 and B\<^isub>4 where
blanchet@33197
   400
  "[] \<in> S\<^isub>4"
blanchet@33197
   401
| "w \<in> A\<^isub>4 \<Longrightarrow> b # w \<in> S\<^isub>4"
blanchet@33197
   402
| "w \<in> B\<^isub>4 \<Longrightarrow> a # w \<in> S\<^isub>4"
blanchet@33197
   403
| "w \<in> S\<^isub>4 \<Longrightarrow> a # w \<in> A\<^isub>4"
blanchet@33197
   404
| "\<lbrakk>v \<in> A\<^isub>4; w \<in> A\<^isub>4\<rbrakk> \<Longrightarrow> b # v @ w \<in> A\<^isub>4"
blanchet@33197
   405
| "w \<in> S\<^isub>4 \<Longrightarrow> b # w \<in> B\<^isub>4"
blanchet@33197
   406
| "\<lbrakk>v \<in> B\<^isub>4; w \<in> B\<^isub>4\<rbrakk> \<Longrightarrow> a # v @ w \<in> B\<^isub>4"
blanchet@33197
   407
blanchet@33197
   408
theorem S\<^isub>4_sound:
blanchet@33197
   409
"w \<in> S\<^isub>4 \<longrightarrow> length [x \<leftarrow> w. x = a] = length [x \<leftarrow> w. x = b]"
blanchet@42959
   410
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   411
sorry
blanchet@33197
   412
blanchet@33197
   413
theorem S\<^isub>4_complete:
blanchet@33197
   414
"length [x \<leftarrow> w. x = a] = length [x \<leftarrow> w. x = b] \<longrightarrow> w \<in> S\<^isub>4"
blanchet@42959
   415
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   416
sorry
blanchet@33197
   417
blanchet@33197
   418
theorem S\<^isub>4_A\<^isub>4_B\<^isub>4_sound_and_complete:
blanchet@33197
   419
"w \<in> S\<^isub>4 \<longleftrightarrow> length [x \<leftarrow> w. x = a] = length [x \<leftarrow> w. x = b]"
blanchet@33197
   420
"w \<in> A\<^isub>4 \<longleftrightarrow> length [x \<leftarrow> w. x = a] = length [x \<leftarrow> w. x = b] + 1"
blanchet@33197
   421
"w \<in> B\<^isub>4 \<longleftrightarrow> length [x \<leftarrow> w. x = b] = length [x \<leftarrow> w. x = a] + 1"
blanchet@42959
   422
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   423
sorry
blanchet@33197
   424
blanchet@45053
   425
subsection {* 3.2. AA Trees *}
blanchet@33197
   426
blanchet@34982
   427
datatype 'a aa_tree = \<Lambda> | N "'a\<Colon>linorder" nat "'a aa_tree" "'a aa_tree"
blanchet@33197
   428
blanchet@33197
   429
primrec data where
blanchet@33197
   430
"data \<Lambda> = undefined" |
blanchet@33197
   431
"data (N x _ _ _) = x"
blanchet@33197
   432
blanchet@33197
   433
primrec dataset where
blanchet@33197
   434
"dataset \<Lambda> = {}" |
blanchet@33197
   435
"dataset (N x _ t u) = {x} \<union> dataset t \<union> dataset u"
blanchet@33197
   436
blanchet@33197
   437
primrec level where
blanchet@33197
   438
"level \<Lambda> = 0" |
blanchet@33197
   439
"level (N _ k _ _) = k"
blanchet@33197
   440
blanchet@33197
   441
primrec left where
blanchet@33197
   442
"left \<Lambda> = \<Lambda>" |
blanchet@33197
   443
"left (N _ _ t\<^isub>1 _) = t\<^isub>1"
blanchet@33197
   444
blanchet@33197
   445
primrec right where
blanchet@33197
   446
"right \<Lambda> = \<Lambda>" |
blanchet@33197
   447
"right (N _ _ _ t\<^isub>2) = t\<^isub>2"
blanchet@33197
   448
blanchet@33197
   449
fun wf where
blanchet@33197
   450
"wf \<Lambda> = True" |
blanchet@33197
   451
"wf (N _ k t u) =
blanchet@33197
   452
 (if t = \<Lambda> then
blanchet@33197
   453
    k = 1 \<and> (u = \<Lambda> \<or> (level u = 1 \<and> left u = \<Lambda> \<and> right u = \<Lambda>))
blanchet@33197
   454
  else
blanchet@33197
   455
    wf t \<and> wf u \<and> u \<noteq> \<Lambda> \<and> level t < k \<and> level u \<le> k \<and> level (right u) < k)"
blanchet@33197
   456
blanchet@33197
   457
fun skew where
blanchet@33197
   458
"skew \<Lambda> = \<Lambda>" |
blanchet@33197
   459
"skew (N x k t u) =
blanchet@33197
   460
 (if t \<noteq> \<Lambda> \<and> k = level t then
blanchet@33197
   461
    N (data t) k (left t) (N x k (right t) u)
blanchet@33197
   462
  else
blanchet@33197
   463
    N x k t u)"
blanchet@33197
   464
blanchet@33197
   465
fun split where
blanchet@33197
   466
"split \<Lambda> = \<Lambda>" |
blanchet@33197
   467
"split (N x k t u) =
blanchet@33197
   468
 (if u \<noteq> \<Lambda> \<and> k = level (right u) then
blanchet@33197
   469
    N (data u) (Suc k) (N x k t (left u)) (right u)
blanchet@33197
   470
  else
blanchet@33197
   471
    N x k t u)"
blanchet@33197
   472
blanchet@33197
   473
theorem dataset_skew_split:
blanchet@33197
   474
"dataset (skew t) = dataset t"
blanchet@33197
   475
"dataset (split t) = dataset t"
blanchet@42959
   476
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   477
sorry
blanchet@33197
   478
blanchet@33197
   479
theorem wf_skew_split:
blanchet@33197
   480
"wf t \<Longrightarrow> skew t = t"
blanchet@33197
   481
"wf t \<Longrightarrow> split t = t"
blanchet@42959
   482
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   483
sorry
blanchet@33197
   484
blanchet@33197
   485
primrec insort\<^isub>1 where
blanchet@33197
   486
"insort\<^isub>1 \<Lambda> x = N x 1 \<Lambda> \<Lambda>" |
blanchet@33197
   487
"insort\<^isub>1 (N y k t u) x =
blanchet@33197
   488
 (* (split \<circ> skew) *) (N y k (if x < y then insort\<^isub>1 t x else t)
blanchet@33197
   489
                             (if x > y then insort\<^isub>1 u x else u))"
blanchet@33197
   490
blanchet@33197
   491
theorem wf_insort\<^isub>1: "wf t \<Longrightarrow> wf (insort\<^isub>1 t x)"
blanchet@35671
   492
nitpick [expect = genuine]
blanchet@33197
   493
oops
blanchet@33197
   494
blanchet@33197
   495
theorem wf_insort\<^isub>1_nat: "wf t \<Longrightarrow> wf (insort\<^isub>1 t (x\<Colon>nat))"
blanchet@35671
   496
nitpick [eval = "insort\<^isub>1 t x", expect = genuine]
blanchet@33197
   497
oops
blanchet@33197
   498
blanchet@33197
   499
primrec insort\<^isub>2 where
blanchet@33197
   500
"insort\<^isub>2 \<Lambda> x = N x 1 \<Lambda> \<Lambda>" |
blanchet@33197
   501
"insort\<^isub>2 (N y k t u) x =
blanchet@33197
   502
 (split \<circ> skew) (N y k (if x < y then insort\<^isub>2 t x else t)
blanchet@33197
   503
                       (if x > y then insort\<^isub>2 u x else u))"
blanchet@33197
   504
blanchet@33197
   505
theorem wf_insort\<^isub>2: "wf t \<Longrightarrow> wf (insort\<^isub>2 t x)"
blanchet@42959
   506
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   507
sorry
blanchet@33197
   508
blanchet@33197
   509
theorem dataset_insort\<^isub>2: "dataset (insort\<^isub>2 t x) = {x} \<union> dataset t"
blanchet@42959
   510
nitpick [card = 1\<emdash>5, expect = none]
blanchet@33197
   511
sorry
blanchet@33197
   512
blanchet@33197
   513
end