author  wenzelm 
Wed, 29 Oct 2014 11:19:27 +0100  
changeset 58813  625d04d4fd2a 
parent 58400  d0d3c30806b4 
child 58826  2ed2eaabe3df 
permissions  rwrr 
41905  1 
(* Author: Lukas Bulwahn, TU Muenchen *) 
2 

43356  3 
header {* Counterexample generator performing narrowingbased testing *} 
41905  4 

41930
1e008cc4883a
renaming lazysmallcheck ML file to Quickcheck_Narrowing
bulwahn
parents:
41929
diff
changeset

5 
theory Quickcheck_Narrowing 
56047
1f283d0a4966
make it possible to load Quickcheck exhaustive & narrowing in parallel
blanchet
parents:
55676
diff
changeset

6 
imports Quickcheck_Random 
46950
d0181abdbdac
declare command keywords via theory header, including strict checking outside Pure;
wenzelm
parents:
46758
diff
changeset

7 
keywords "find_unused_assms" :: diag 
41905  8 
begin 
9 

10 
subsection {* Counterexample generator *} 

11 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

12 
subsubsection {* Code generation setup *} 
43308
fd6cc1378fec
compilation of Haskell in its own target for Quickcheck; passing options by arguments in Narrowing_Generators
bulwahn
parents:
43237
diff
changeset

13 

55147
bce3dbc11f95
prefer explicit code symbol type over adhoc name mangling
haftmann
parents:
52435
diff
changeset

14 
setup {* Code_Target.extend_target ("Haskell_Quickcheck", (Code_Haskell.target, I)) *} 
43308
fd6cc1378fec
compilation of Haskell in its own target for Quickcheck; passing options by arguments in Narrowing_Generators
bulwahn
parents:
43237
diff
changeset

15 

52435
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
51143
diff
changeset

16 
code_printing 
55676  17 
code_module Typerep \<rightharpoonup> (Haskell_Quickcheck) {* 
18 
data Typerep = Typerep String [Typerep] 

19 
*} 

20 
 type_constructor typerep \<rightharpoonup> (Haskell_Quickcheck) "Typerep.Typerep" 

21 
 constant Typerep.Typerep \<rightharpoonup> (Haskell_Quickcheck) "Typerep.Typerep" 

52435
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
51143
diff
changeset

22 
 type_constructor integer \<rightharpoonup> (Haskell_Quickcheck) "Prelude.Int" 
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

23 

43308
fd6cc1378fec
compilation of Haskell in its own target for Quickcheck; passing options by arguments in Narrowing_Generators
bulwahn
parents:
43237
diff
changeset

24 
code_reserved Haskell_Quickcheck Typerep 
41909
383bbdad1650
replacing strings in generated Code resolves the changing names of Typerep in lazysmallcheck prototype
bulwahn
parents:
41908
diff
changeset

25 

58400
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

26 
code_printing 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

27 
constant "0::integer" \<rightharpoonup> 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

28 
(Haskell_Quickcheck) "!(0/ ::/ Prelude.Int)" 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

29 

d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

30 
setup {* 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

31 
let 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

32 
val target = "Haskell_Quickcheck"; 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

33 
fun print _ = Code_Haskell.print_numeral "Prelude.Int"; 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

34 
in 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

35 
Numeral.add_code @{const_name Code_Numeral.Pos} I print target 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

36 
#> Numeral.add_code @{const_name Code_Numeral.Neg} (op ~) print target 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

37 
end 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

38 
*} 
d0d3c30806b4
always annotate potentially polymorphic Haskell numerals
haftmann
parents:
58350
diff
changeset

39 

42021
52551c0a3374
extending code_int type more; adding narrowing instance for type int; added test case for int instance
bulwahn
parents:
41965
diff
changeset

40 

41961
fdd37cfcd4a3
renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents:
41943
diff
changeset

41 
subsubsection {* Narrowing's deep representation of types and terms *} 
41905  42 

58350
919149921e46
added 'extraction' plugins  this might help 'HOLProofs'
blanchet
parents:
58334
diff
changeset

43 
datatype (plugins only: code extraction) narrowing_type = 
58152  44 
Narrowing_sum_of_products "narrowing_type list list" 
45 

58350
919149921e46
added 'extraction' plugins  this might help 'HOLProofs'
blanchet
parents:
58334
diff
changeset

46 
datatype (plugins only: code extraction) narrowing_term = 
58152  47 
Narrowing_variable "integer list" narrowing_type 
48 
 Narrowing_constructor integer "narrowing_term list" 

49 

58350
919149921e46
added 'extraction' plugins  this might help 'HOLProofs'
blanchet
parents:
58334
diff
changeset

50 
datatype (plugins only: code extraction) (dead 'a) narrowing_cons = 
58152  51 
Narrowing_cons narrowing_type "(narrowing_term list \<Rightarrow> 'a) list" 
41905  52 

46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

53 
primrec map_cons :: "('a => 'b) => 'a narrowing_cons => 'b narrowing_cons" 
43356  54 
where 
58152  55 
"map_cons f (Narrowing_cons ty cs) = Narrowing_cons ty (map (\<lambda>c. f o c) cs)" 
43356  56 

43341  57 
subsubsection {* From narrowing's deep representation of terms to @{theory Code_Evaluation}'s terms *} 
42980
859fe9cc0838
improving code_int setup in Quickcheck_Narrowing; adding partial_term_of class in Quickcheck_Narrowing
bulwahn
parents:
42024
diff
changeset

58 

859fe9cc0838
improving code_int setup in Quickcheck_Narrowing; adding partial_term_of class in Quickcheck_Narrowing
bulwahn
parents:
42024
diff
changeset

59 
class partial_term_of = typerep + 
43047
26774ccb1c74
automatic derivation of partial_term_of functions; renaming type and term to longer names narrowing_type and narrowing_term; hiding constant C; adding overlord option
bulwahn
parents:
42980
diff
changeset

60 
fixes partial_term_of :: "'a itself => narrowing_term => Code_Evaluation.term" 
26774ccb1c74
automatic derivation of partial_term_of functions; renaming type and term to longer names narrowing_type and narrowing_term; hiding constant C; adding overlord option
bulwahn
parents:
42980
diff
changeset

61 

26774ccb1c74
automatic derivation of partial_term_of functions; renaming type and term to longer names narrowing_type and narrowing_term; hiding constant C; adding overlord option
bulwahn
parents:
42980
diff
changeset

62 
lemma partial_term_of_anything: "partial_term_of x nt \<equiv> t" 
26774ccb1c74
automatic derivation of partial_term_of functions; renaming type and term to longer names narrowing_type and narrowing_term; hiding constant C; adding overlord option
bulwahn
parents:
42980
diff
changeset

63 
by (rule eq_reflection) (cases "partial_term_of x nt", cases t, simp) 
43356  64 

41964
13904699c859
tuned subsubsection names in Quickcheck_Narrowing
bulwahn
parents:
41962
diff
changeset

65 
subsubsection {* Auxilary functions for Narrowing *} 
41905  66 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

67 
consts nth :: "'a list => integer => 'a" 
41905  68 

52435
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
51143
diff
changeset

69 
code_printing constant nth \<rightharpoonup> (Haskell_Quickcheck) infixl 9 "!!" 
41905  70 

41908
3bd9a21366d2
changing invocation of ghc from interactive mode to compilation increases the performance of lazysmallcheck by a factor of twenty; changing Integer type to Int reduces by another 50 percent
bulwahn
parents:
41905
diff
changeset

71 
consts error :: "char list => 'a" 
41905  72 

52435
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
51143
diff
changeset

73 
code_printing constant error \<rightharpoonup> (Haskell_Quickcheck) "error" 
41905  74 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

75 
consts toEnum :: "integer => char" 
41908
3bd9a21366d2
changing invocation of ghc from interactive mode to compilation increases the performance of lazysmallcheck by a factor of twenty; changing Integer type to Int reduces by another 50 percent
bulwahn
parents:
41905
diff
changeset

76 

52435
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
51143
diff
changeset

77 
code_printing constant toEnum \<rightharpoonup> (Haskell_Quickcheck) "Prelude.toEnum" 
41905  78 

43316  79 
consts marker :: "char" 
41905  80 

52435
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
51143
diff
changeset

81 
code_printing constant marker \<rightharpoonup> (Haskell_Quickcheck) "''\\0'" 
43316  82 

41961
fdd37cfcd4a3
renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents:
41943
diff
changeset

83 
subsubsection {* Narrowing's basic operations *} 
41905  84 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

85 
type_synonym 'a narrowing = "integer => 'a narrowing_cons" 
41905  86 

41961
fdd37cfcd4a3
renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents:
41943
diff
changeset

87 
definition empty :: "'a narrowing" 
41905  88 
where 
46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

89 
"empty d = Narrowing_cons (Narrowing_sum_of_products []) []" 
41905  90 

41961
fdd37cfcd4a3
renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents:
41943
diff
changeset

91 
definition cons :: "'a => 'a narrowing" 
41905  92 
where 
58152  93 
"cons a d = (Narrowing_cons (Narrowing_sum_of_products [[]]) [(\<lambda>_. a)])" 
41905  94 

43047
26774ccb1c74
automatic derivation of partial_term_of functions; renaming type and term to longer names narrowing_type and narrowing_term; hiding constant C; adding overlord option
bulwahn
parents:
42980
diff
changeset

95 
fun conv :: "(narrowing_term list => 'a) list => narrowing_term => 'a" 
41905  96 
where 
46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

97 
"conv cs (Narrowing_variable p _) = error (marker # map toEnum p)" 
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

98 
 "conv cs (Narrowing_constructor i xs) = (nth cs i) xs" 
41905  99 

46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

100 
fun non_empty :: "narrowing_type => bool" 
41905  101 
where 
46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

102 
"non_empty (Narrowing_sum_of_products ps) = (\<not> (List.null ps))" 
41905  103 

41961
fdd37cfcd4a3
renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents:
41943
diff
changeset

104 
definition "apply" :: "('a => 'b) narrowing => 'a narrowing => 'b narrowing" 
41905  105 
where 
106 
"apply f a d = 

46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

107 
(case f d of Narrowing_cons (Narrowing_sum_of_products ps) cfs => 
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

108 
case a (d  1) of Narrowing_cons ta cas => 
41905  109 
let 
46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

110 
shallow = (d > 0 \<and> non_empty ta); 
58152  111 
cs = [(\<lambda>xs'. (case xs' of [] => undefined  x # xs => cf xs (conv cas x))). shallow, cf < cfs] 
46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

112 
in Narrowing_cons (Narrowing_sum_of_products [ta # p. shallow, p < ps]) cs)" 
41905  113 

41961
fdd37cfcd4a3
renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents:
41943
diff
changeset

114 
definition sum :: "'a narrowing => 'a narrowing => 'a narrowing" 
41905  115 
where 
116 
"sum a b d = 

46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

117 
(case a d of Narrowing_cons (Narrowing_sum_of_products ssa) ca => 
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

118 
case b d of Narrowing_cons (Narrowing_sum_of_products ssb) cb => 
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

119 
Narrowing_cons (Narrowing_sum_of_products (ssa @ ssb)) (ca @ cb))" 
41905  120 

41912
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

121 
lemma [fundef_cong]: 
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

122 
assumes "a d = a' d" "b d = b' d" "d = d'" 
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

123 
shows "sum a b d = sum a' b' d'" 
46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

124 
using assms unfolding sum_def by (auto split: narrowing_cons.split narrowing_type.split) 
41912
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

125 

1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

126 
lemma [fundef_cong]: 
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

127 
assumes "f d = f' d" "(\<And>d'. 0 \<le> d' \<and> d' < d \<Longrightarrow> a d' = a' d')" 
41912
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

128 
assumes "d = d'" 
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

129 
shows "apply f a d = apply f' a' d'" 
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

130 
proof  
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

131 
note assms 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

132 
moreover have "0 < d' \<Longrightarrow> 0 \<le> d'  1" 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

133 
by (simp add: less_integer_def less_eq_integer_def) 
41912
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

134 
ultimately show ?thesis 
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

135 
by (auto simp add: apply_def Let_def 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

136 
split: narrowing_cons.split narrowing_type.split) 
41912
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

137 
qed 
1848775589e5
adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents:
41910
diff
changeset

138 

41961
fdd37cfcd4a3
renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents:
41943
diff
changeset

139 
subsubsection {* Narrowing generator type class *} 
41905  140 

41961
fdd37cfcd4a3
renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents:
41943
diff
changeset

141 
class narrowing = 
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

142 
fixes narrowing :: "integer => 'a narrowing_cons" 
41905  143 

58350
919149921e46
added 'extraction' plugins  this might help 'HOLProofs'
blanchet
parents:
58334
diff
changeset

144 
datatype (plugins only: code extraction) property = 
58334  145 
Universal narrowing_type "(narrowing_term => property)" "narrowing_term => Code_Evaluation.term" 
146 
 Existential narrowing_type "(narrowing_term => property)" "narrowing_term => Code_Evaluation.term" 

147 
 Property bool 

43237
8f5c3c6c2909
adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents:
43047
diff
changeset

148 

8f5c3c6c2909
adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents:
43047
diff
changeset

149 
(* FIXME: hardwired maximal depth of 100 here *) 
43315
893de45ac28d
removing unneccessary manual instantiations and dead definitions; hiding more constants and facts
bulwahn
parents:
43314
diff
changeset

150 
definition exists :: "('a :: {narrowing, partial_term_of} => property) => property" 
43237
8f5c3c6c2909
adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents:
43047
diff
changeset

151 
where 
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

152 
"exists f = (case narrowing (100 :: integer) of Narrowing_cons ty cs => Existential ty (\<lambda> t. f (conv cs t)) (partial_term_of (TYPE('a))))" 
43237
8f5c3c6c2909
adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents:
43047
diff
changeset

153 

43315
893de45ac28d
removing unneccessary manual instantiations and dead definitions; hiding more constants and facts
bulwahn
parents:
43314
diff
changeset

154 
definition "all" :: "('a :: {narrowing, partial_term_of} => property) => property" 
43237
8f5c3c6c2909
adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents:
43047
diff
changeset

155 
where 
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

156 
"all f = (case narrowing (100 :: integer) of Narrowing_cons ty cs => Universal ty (\<lambda>t. f (conv cs t)) (partial_term_of (TYPE('a))))" 
43237
8f5c3c6c2909
adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents:
43047
diff
changeset

157 

41943  158 
subsubsection {* class @{text is_testable} *} 
41905  159 

41943  160 
text {* The class @{text is_testable} ensures that all necessary type instances are generated. *} 
41905  161 

162 
class is_testable 

163 

164 
instance bool :: is_testable .. 

165 

43047
26774ccb1c74
automatic derivation of partial_term_of functions; renaming type and term to longer names narrowing_type and narrowing_term; hiding constant C; adding overlord option
bulwahn
parents:
42980
diff
changeset

166 
instance "fun" :: ("{term_of, narrowing, partial_term_of}", is_testable) is_testable .. 
41905  167 

168 
definition ensure_testable :: "'a :: is_testable => 'a :: is_testable" 

169 
where 

170 
"ensure_testable f = f" 

171 

41910
709c04e7b703
adding serial instance of finite_4 in lazysmallcheck; changing code equations for implies
bulwahn
parents:
41909
diff
changeset

172 

42022
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

173 
subsubsection {* Defining a simple datatype to represent functions in an incomplete and redundant way *} 
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

174 

58350
919149921e46
added 'extraction' plugins  this might help 'HOLProofs'
blanchet
parents:
58334
diff
changeset

175 
datatype (plugins only: code quickcheck_narrowing extraction) (dead 'a, dead 'b) ffun = 
58334  176 
Constant 'b 
177 
 Update 'a 'b "('a, 'b) ffun" 

42022
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

178 

101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

179 
primrec eval_ffun :: "('a, 'b) ffun => 'a => 'b" 
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

180 
where 
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

181 
"eval_ffun (Constant c) x = c" 
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

182 
 "eval_ffun (Update x' y f) x = (if x = x' then y else eval_ffun f x)" 
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

183 

101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

184 
hide_type (open) ffun 
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

185 
hide_const (open) Constant Update eval_ffun 
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

186 

58350
919149921e46
added 'extraction' plugins  this might help 'HOLProofs'
blanchet
parents:
58334
diff
changeset

187 
datatype (plugins only: code quickcheck_narrowing extraction) (dead 'b) cfun = Constant 'b 
42024
51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

188 

51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

189 
primrec eval_cfun :: "'b cfun => 'a => 'b" 
51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

190 
where 
51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

191 
"eval_cfun (Constant c) y = c" 
51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

192 

51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

193 
hide_type (open) cfun 
45734
1024dd30da42
hide quickcheck constants Abs_cfun and Rep_cfun, to avoid clash with HOLCF
huffman
parents:
45001
diff
changeset

194 
hide_const (open) Constant eval_cfun Abs_cfun Rep_cfun 
42024
51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

195 

51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

196 
subsubsection {* Setting up the counterexample generator *} 
43237
8f5c3c6c2909
adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents:
43047
diff
changeset

197 

48891  198 
ML_file "Tools/Quickcheck/narrowing_generators.ML" 
42024
51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

199 

58813  200 
setup Narrowing_Generators.setup 
42024
51df23535105
handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents:
42022
diff
changeset

201 

45001
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

202 
definition narrowing_dummy_partial_term_of :: "('a :: partial_term_of) itself => narrowing_term => term" 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

203 
where 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

204 
"narrowing_dummy_partial_term_of = partial_term_of" 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

205 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

206 
definition narrowing_dummy_narrowing :: "integer => ('a :: narrowing) narrowing_cons" 
45001
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

207 
where 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

208 
"narrowing_dummy_narrowing = narrowing" 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

209 

5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

210 
lemma [code]: 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

211 
"ensure_testable f = 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

212 
(let 
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

213 
x = narrowing_dummy_narrowing :: integer => bool narrowing_cons; 
45001
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

214 
y = narrowing_dummy_partial_term_of :: bool itself => narrowing_term => term; 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

215 
z = (conv :: _ => _ => unit) in f)" 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

216 
unfolding Let_def ensure_testable_def .. 
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

217 

46308  218 
subsection {* Narrowing for sets *} 
219 

220 
instantiation set :: (narrowing) narrowing 

221 
begin 

222 

223 
definition "narrowing_set = Quickcheck_Narrowing.apply (Quickcheck_Narrowing.cons set) narrowing" 

224 

225 
instance .. 

226 

227 
end 

45001
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

228 

43356  229 
subsection {* Narrowing for integers *} 
230 

231 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

232 
definition drawn_from :: "'a list \<Rightarrow> 'a narrowing_cons" 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

233 
where 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

234 
"drawn_from xs = 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

235 
Narrowing_cons (Narrowing_sum_of_products (map (\<lambda>_. []) xs)) (map (\<lambda>x _. x) xs)" 
43356  236 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

237 
function around_zero :: "int \<Rightarrow> int list" 
43356  238 
where 
239 
"around_zero i = (if i < 0 then [] else (if i = 0 then [0] else around_zero (i  1) @ [i, i]))" 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

240 
by pat_completeness auto 
43356  241 
termination by (relation "measure nat") auto 
242 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

243 
declare around_zero.simps [simp del] 
43356  244 

245 
lemma length_around_zero: 

246 
assumes "i >= 0" 

247 
shows "length (around_zero i) = 2 * nat i + 1" 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

248 
proof (induct rule: int_ge_induct [OF assms]) 
43356  249 
case 1 
250 
from 1 show ?case by (simp add: around_zero.simps) 

251 
next 

252 
case (2 i) 

253 
from 2 show ?case 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

254 
by (simp add: around_zero.simps [of "i + 1"]) 
43356  255 
qed 
256 

257 
instantiation int :: narrowing 

258 
begin 

259 

260 
definition 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

261 
"narrowing_int d = (let (u :: _ \<Rightarrow> _ \<Rightarrow> unit) = conv; i = int_of_integer d 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

262 
in drawn_from (around_zero i))" 
43356  263 

264 
instance .. 

265 

266 
end 

267 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

268 
lemma [code, code del]: "partial_term_of (ty :: int itself) t \<equiv> undefined" 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

269 
by (rule partial_term_of_anything)+ 
43356  270 

271 
lemma [code]: 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

272 
"partial_term_of (ty :: int itself) (Narrowing_variable p t) \<equiv> 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

273 
Code_Evaluation.Free (STR ''_'') (Typerep.Typerep (STR ''Int.int'') [])" 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

274 
"partial_term_of (ty :: int itself) (Narrowing_constructor i []) \<equiv> 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

275 
(if i mod 2 = 0 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

276 
then Code_Evaluation.term_of ( (int_of_integer i) div 2) 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

277 
else Code_Evaluation.term_of ((int_of_integer i + 1) div 2))" 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

278 
by (rule partial_term_of_anything)+ 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

279 

0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

280 
instantiation integer :: narrowing 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

281 
begin 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

282 

0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

283 
definition 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

284 
"narrowing_integer d = (let (u :: _ \<Rightarrow> _ \<Rightarrow> unit) = conv; i = int_of_integer d 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

285 
in drawn_from (map integer_of_int (around_zero i)))" 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

286 

0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

287 
instance .. 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

288 

0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

289 
end 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

290 

0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

291 
lemma [code, code del]: "partial_term_of (ty :: integer itself) t \<equiv> undefined" 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

292 
by (rule partial_term_of_anything)+ 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

293 

0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

294 
lemma [code]: 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

295 
"partial_term_of (ty :: integer itself) (Narrowing_variable p t) \<equiv> 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

296 
Code_Evaluation.Free (STR ''_'') (Typerep.Typerep (STR ''Code_Numeral.integer'') [])" 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

297 
"partial_term_of (ty :: integer itself) (Narrowing_constructor i []) \<equiv> 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

298 
(if i mod 2 = 0 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

299 
then Code_Evaluation.term_of ( i div 2) 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

300 
else Code_Evaluation.term_of ((i + 1) div 2))" 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

301 
by (rule partial_term_of_anything)+ 
43356  302 

56401
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

303 
code_printing constant "Code_Evaluation.term_of :: integer \<Rightarrow> term" \<rightharpoonup> (Haskell_Quickcheck) 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

304 
"(let { t = Typerep.Typerep \"Code'_Numeral.integer\" []; 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

305 
mkFunT s t = Typerep.Typerep \"fun\" [s, t]; 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

306 
numT = Typerep.Typerep \"Num.num\" []; 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

307 
mkBit 0 = Generated'_Code.Const \"Num.num.Bit0\" (mkFunT numT numT); 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

308 
mkBit 1 = Generated'_Code.Const \"Num.num.Bit1\" (mkFunT numT numT); 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

309 
mkNumeral 1 = Generated'_Code.Const \"Num.num.One\" numT; 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

310 
mkNumeral i = let { q = i `Prelude.div` 2; r = i `Prelude.mod` 2 } 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

311 
in Generated'_Code.App (mkBit r) (mkNumeral q); 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

312 
mkNumber 0 = Generated'_Code.Const \"Groups.zero'_class.zero\" t; 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

313 
mkNumber 1 = Generated'_Code.Const \"Groups.one'_class.one\" t; 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

314 
mkNumber i = if i > 0 then 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

315 
Generated'_Code.App 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

316 
(Generated'_Code.Const \"Num.numeral'_class.numeral\" 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

317 
(mkFunT numT t)) 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

318 
(mkNumeral i) 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

319 
else 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

320 
Generated'_Code.App 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

321 
(Generated'_Code.Const \"Groups.uminus'_class.uminus\" (mkFunT t t)) 
3b2db6132bfd
add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents:
56047
diff
changeset

322 
(mkNumber ( i)); } in mkNumber)" 
43356  323 

46589  324 
subsection {* The @{text find_unused_assms} command *} 
325 

48891  326 
ML_file "Tools/Quickcheck/find_unused_assms.ML" 
46589  327 

328 
subsection {* Closing up *} 

329 

51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

330 
hide_type narrowing_type narrowing_term narrowing_cons property 
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
50046
diff
changeset

331 
hide_const map_cons nth error toEnum marker empty Narrowing_cons conv non_empty ensure_testable all exists drawn_from around_zero 
46758
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

332 
hide_const (open) Narrowing_variable Narrowing_constructor "apply" sum cons 
4106258260b3
choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in QuickcheckNarrowing
bulwahn
parents:
46589
diff
changeset

333 
hide_fact empty_def cons_def conv.simps non_empty.simps apply_def sum_def ensure_testable_def all_def exists_def 
42022
101ce92333f4
adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents:
42021
diff
changeset

334 

45001
5c8d7d6db682
ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents:
43887
diff
changeset

335 
end 