# HG changeset patch
# User Andreas Lochbihler
# Date 1405085711 -7200
# Node ID 36041934e4296e095bbc25316317dfa243579c38
# Parent  faa8b4486d5a1768e6af2ce4de67837e9d6e15f4
adapt and reactivate Quickcheck_Types and add two test cases

diff -r faa8b4486d5a -r 36041934e429 src/HOL/Library/Quickcheck_Types.thy
--- a/src/HOL/Library/Quickcheck_Types.thy	Fri Jul 11 00:55:46 2014 +0200
+++ b/src/HOL/Library/Quickcheck_Types.thy	Fri Jul 11 15:35:11 2014 +0200
@@ -4,7 +4,7 @@
 *)
 
 theory Quickcheck_Types
-imports Main
+imports "../Main"
 begin
 
 text {*
@@ -113,8 +113,7 @@
 
 definition "bot = Bot"
 
-instance proof
-qed (simp add: bot_bot_def)
+instance ..
 
 end
 
@@ -123,8 +122,7 @@
 
 definition "top = Value top"
 
-instance proof
-qed (simp add: top_bot_def less_eq_bot_def split: bot.split)
+instance ..
 
 end
 
@@ -152,7 +150,8 @@
 
 end
 
-instance bot :: (lattice) bounded_lattice_bot ..
+instance bot :: (lattice) bounded_lattice_bot
+by(intro_classes)(simp add: bot_bot_def)
 
 section {* Values extended by a top element *}
 
@@ -213,8 +212,7 @@
 
 definition "top = Top"
 
-instance proof
-qed (simp add: top_top_def)
+instance ..
 
 end
 
@@ -223,8 +221,7 @@
 
 definition "bot = Value bot"
 
-instance proof
-qed (simp add: bot_top_def less_eq_top_def split: top.split)
+instance ..
 
 end
 
@@ -252,7 +249,8 @@
 
 end
 
-instance top :: (lattice) bounded_lattice_top ..
+instance top :: (lattice) bounded_lattice_top
+by(intro_classes)(simp add: top_top_def)
 
 
 datatype 'a flat_complete_lattice = Value 'a | Bot | Top
@@ -294,8 +292,7 @@
 
 definition "bot = Bot"
 
-instance proof
-qed (simp add: bot_flat_complete_lattice_def)
+instance ..
 
 end
 
@@ -304,8 +301,7 @@
 
 definition "top = Top"
 
-instance proof
-qed (auto simp add: less_eq_flat_complete_lattice_def top_flat_complete_lattice_def split: flat_complete_lattice.splits)
+instance ..
 
 end
 
@@ -454,14 +450,28 @@
   ultimately show "Sup A <= z"
     unfolding Sup_flat_complete_lattice_def
     by auto
+next
+  show "Inf {} = (top :: 'a flat_complete_lattice)"
+    by(simp add: Inf_flat_complete_lattice_def top_flat_complete_lattice_def)
+next
+  show "Sup {} = (bot :: 'a flat_complete_lattice)"
+    by(simp add: Sup_flat_complete_lattice_def bot_flat_complete_lattice_def)
 qed
 
 end
 
 section {* Quickcheck configuration *}
 
-quickcheck_params[finite_types = false, default_type = ["int", "non_distrib_lattice", "int bot", "int top", "int flat_complete_lattice"]]
+quickcheck_params[finite_types = false, default_type = ["int", "non_distrib_lattice", "int bot", "int top", "Enum.finite_4 flat_complete_lattice"]]
 
 hide_type non_distrib_lattice flat_complete_lattice bot top
 
+lemma "\<lbrakk> inf x z = inf y z; sup x z = sup y z \<rbrakk> \<Longrightarrow> x = y" 
+quickcheck[exhaustive, expect=counterexample]
+oops
+
+lemma "Inf {} = bot"
+quickcheck[exhaustive, expect=counterexample]
+oops
+
 end
\ No newline at end of file
diff -r faa8b4486d5a -r 36041934e429 src/HOL/ROOT
--- a/src/HOL/ROOT	Fri Jul 11 00:55:46 2014 +0200
+++ b/src/HOL/ROOT	Fri Jul 11 15:35:11 2014 +0200
@@ -52,6 +52,7 @@
     (*legacy tools*)
     Refute
     Old_Recdef
+    Quickcheck_Types
   theories [condition = ISABELLE_FULL_TEST]
     Sum_of_Squares_Remote
   document_files "root.bib" "root.tex"