src/HOL/Quickcheck_Narrowing.thy
author Andreas Lochbihler
Fri, 04 Apr 2014 13:22:15 +0200
changeset 56401 3b2db6132bfd
parent 56047 1f283d0a4966
child 58152 6fe60a9a5bad
permissions -rw-r--r--
add missing adaptation for narrowing to work with variables of type integer => integer
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
     1
(* Author: Lukas Bulwahn, TU Muenchen *)
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
     2
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
     3
header {* Counterexample generator performing narrowing-based testing *}
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
     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
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
     8
begin
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
     9
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    10
subsection {* Counterexample generator *}
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    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 ad-hoc 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_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents: 51143
diff changeset
    16
code_printing
55676
fb46f1c379b5 avoid ad-hoc patching of generated code
haftmann
parents: 55147
diff changeset
    17
  code_module Typerep \<rightharpoonup> (Haskell_Quickcheck) {*
fb46f1c379b5 avoid ad-hoc patching of generated code
haftmann
parents: 55147
diff changeset
    18
data Typerep = Typerep String [Typerep]
fb46f1c379b5 avoid ad-hoc patching of generated code
haftmann
parents: 55147
diff changeset
    19
*}
fb46f1c379b5 avoid ad-hoc patching of generated code
haftmann
parents: 55147
diff changeset
    20
| type_constructor typerep \<rightharpoonup> (Haskell_Quickcheck) "Typerep.Typerep"
fb46f1c379b5 avoid ad-hoc patching of generated code
haftmann
parents: 55147
diff changeset
    21
| constant Typerep.Typerep \<rightharpoonup> (Haskell_Quickcheck) "Typerep.Typerep"
52435
6646bb548c6b migration from code_(const|type|class|instance) 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
42021
52551c0a3374 extending code_int type more; adding narrowing instance for type int; added test case for int instance
bulwahn
parents: 41965
diff changeset
    26
41961
fdd37cfcd4a3 renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents: 41943
diff changeset
    27
subsubsection {* Narrowing's deep representation of types and terms *}
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    28
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    29
datatype narrowing_type = Narrowing_sum_of_products "narrowing_type list list"
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
    30
datatype narrowing_term = Narrowing_variable "integer list" narrowing_type | Narrowing_constructor integer "narrowing_term list"
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    31
datatype 'a narrowing_cons = Narrowing_cons narrowing_type "(narrowing_term list => 'a) list"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    32
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    33
primrec map_cons :: "('a => 'b) => 'a narrowing_cons => 'b narrowing_cons"
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
    34
where
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    35
  "map_cons f (Narrowing_cons ty cs) = Narrowing_cons ty (map (%c. f o c) cs)"
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
    36
43341
acdac535c7fa fixed document generation for HOL
hoelzl
parents: 43317
diff changeset
    37
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
    38
859fe9cc0838 improving code_int setup in Quickcheck_Narrowing; adding partial_term_of class in Quickcheck_Narrowing
bulwahn
parents: 42024
diff changeset
    39
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
    40
  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
    41
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
    42
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
    43
  by (rule eq_reflection) (cases "partial_term_of x nt", cases t, simp)
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
    44
 
41964
13904699c859 tuned subsubsection names in Quickcheck_Narrowing
bulwahn
parents: 41962
diff changeset
    45
subsubsection {* Auxilary functions for Narrowing *}
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    46
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
    47
consts nth :: "'a list => integer => 'a"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    48
52435
6646bb548c6b migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents: 51143
diff changeset
    49
code_printing constant nth \<rightharpoonup> (Haskell_Quickcheck) infixl 9 "!!"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    50
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
    51
consts error :: "char list => 'a"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    52
52435
6646bb548c6b migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents: 51143
diff changeset
    53
code_printing constant error \<rightharpoonup> (Haskell_Quickcheck) "error"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    54
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
    55
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
    56
52435
6646bb548c6b migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents: 51143
diff changeset
    57
code_printing constant toEnum \<rightharpoonup> (Haskell_Quickcheck) "Prelude.toEnum"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    58
43316
3e274608f06b removing char setup
bulwahn
parents: 43315
diff changeset
    59
consts marker :: "char"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    60
52435
6646bb548c6b migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
haftmann
parents: 51143
diff changeset
    61
code_printing constant marker \<rightharpoonup> (Haskell_Quickcheck) "''\\0'"
43316
3e274608f06b removing char setup
bulwahn
parents: 43315
diff changeset
    62
41961
fdd37cfcd4a3 renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents: 41943
diff changeset
    63
subsubsection {* Narrowing's basic operations *}
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    64
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
    65
type_synonym 'a narrowing = "integer => 'a narrowing_cons"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    66
41961
fdd37cfcd4a3 renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents: 41943
diff changeset
    67
definition empty :: "'a narrowing"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    68
where
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    69
  "empty d = Narrowing_cons (Narrowing_sum_of_products []) []"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    70
  
41961
fdd37cfcd4a3 renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents: 41943
diff changeset
    71
definition cons :: "'a => 'a narrowing"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    72
where
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    73
  "cons a d = (Narrowing_cons (Narrowing_sum_of_products [[]]) [(%_. a)])"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    74
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
    75
fun conv :: "(narrowing_term list => 'a) list => narrowing_term => 'a"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    76
where
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    77
  "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 Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    78
| "conv cs (Narrowing_constructor i xs) = (nth cs i) xs"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    79
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    80
fun non_empty :: "narrowing_type => bool"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    81
where
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    82
  "non_empty (Narrowing_sum_of_products ps) = (\<not> (List.null ps))"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    83
41961
fdd37cfcd4a3 renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents: 41943
diff changeset
    84
definition "apply" :: "('a => 'b) narrowing => 'a narrowing => 'b narrowing"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    85
where
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    86
  "apply f a d =
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    87
     (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 Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    88
       case a (d - 1) of Narrowing_cons ta cas =>
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    89
       let
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    90
         shallow = (d > 0 \<and> non_empty ta);
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    91
         cs = [(%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 Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    92
       in Narrowing_cons (Narrowing_sum_of_products [ta # p. shallow, p <- ps]) cs)"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    93
41961
fdd37cfcd4a3 renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents: 41943
diff changeset
    94
definition sum :: "'a narrowing => 'a narrowing => 'a narrowing"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    95
where
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
    96
  "sum a b d =
46758
4106258260b3 choosing longer constant names in Quickcheck_Narrowing to reduce the chances of name clashes in Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    97
    (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 Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    98
      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 Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
    99
      Narrowing_cons (Narrowing_sum_of_products (ssa @ ssb)) (ca @ cb))"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   100
41912
1848775589e5 adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents: 41910
diff changeset
   101
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
   102
  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
   103
  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 Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
   104
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
   105
1848775589e5 adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents: 41910
diff changeset
   106
lemma [fundef_cong]:
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   107
  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
   108
  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
   109
  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
   110
proof -
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   111
  note assms
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   112
  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
   113
    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
   114
  ultimately show ?thesis
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   115
    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
   116
      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
   117
qed
1848775589e5 adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC
bulwahn
parents: 41910
diff changeset
   118
41961
fdd37cfcd4a3 renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents: 41943
diff changeset
   119
subsubsection {* Narrowing generator type class *}
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   120
41961
fdd37cfcd4a3 renaming series and serial to narrowing in Quickcheck_Narrowing
bulwahn
parents: 41943
diff changeset
   121
class narrowing =
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   122
  fixes narrowing :: "integer => 'a narrowing_cons"
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   123
43237
8f5c3c6c2909 adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents: 43047
diff changeset
   124
datatype property = Universal narrowing_type "(narrowing_term => property)" "narrowing_term => Code_Evaluation.term" | Existential narrowing_type "(narrowing_term => property)" "narrowing_term => Code_Evaluation.term" | Property bool
8f5c3c6c2909 adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents: 43047
diff changeset
   125
8f5c3c6c2909 adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents: 43047
diff changeset
   126
(* FIXME: hard-wired maximal depth of 100 here *)
43315
893de45ac28d removing unneccessary manual instantiations and dead definitions; hiding more constants and facts
bulwahn
parents: 43314
diff changeset
   127
definition exists :: "('a :: {narrowing, partial_term_of} => property) => property"
43237
8f5c3c6c2909 adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents: 43047
diff changeset
   128
where
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   129
  "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
   130
43315
893de45ac28d removing unneccessary manual instantiations and dead definitions; hiding more constants and facts
bulwahn
parents: 43314
diff changeset
   131
definition "all" :: "('a :: {narrowing, partial_term_of} => property) => property"
43237
8f5c3c6c2909 adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents: 43047
diff changeset
   132
where
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   133
  "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
   134
41943
12f24ad566ea fixed document;
wenzelm
parents: 41930
diff changeset
   135
subsubsection {* class @{text is_testable} *}
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   136
41943
12f24ad566ea fixed document;
wenzelm
parents: 41930
diff changeset
   137
text {* The class @{text is_testable} ensures that all necessary type instances are generated. *}
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   138
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   139
class is_testable
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   140
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   141
instance bool :: is_testable ..
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   142
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
   143
instance "fun" :: ("{term_of, narrowing, partial_term_of}", is_testable) is_testable ..
41905
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   144
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   145
definition ensure_testable :: "'a :: is_testable => 'a :: is_testable"
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   146
where
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   147
  "ensure_testable f = f"
e2611bc96022 adding files for prototype of lazysmallcheck
bulwahn
parents:
diff changeset
   148
41910
709c04e7b703 adding serial instance of finite_4 in lazysmallcheck; changing code equations for implies
bulwahn
parents: 41909
diff changeset
   149
42022
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   150
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
   151
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   152
datatype ('a, 'b) ffun = Constant 'b | Update 'a 'b "('a, 'b) ffun"
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   153
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   154
primrec eval_ffun :: "('a, 'b) ffun => 'a => 'b"
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   155
where
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   156
  "eval_ffun (Constant c) x = c"
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   157
| "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
   158
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   159
hide_type (open) ffun
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   160
hide_const (open) Constant Update eval_ffun
101ce92333f4 adding a simple datatype for representing functions in Quickcheck_Narrowing
bulwahn
parents: 42021
diff changeset
   161
42024
51df23535105 handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents: 42022
diff changeset
   162
datatype 'b cfun = Constant 'b
51df23535105 handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents: 42022
diff changeset
   163
51df23535105 handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents: 42022
diff changeset
   164
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
   165
where
51df23535105 handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents: 42022
diff changeset
   166
  "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
   167
51df23535105 handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents: 42022
diff changeset
   168
hide_type (open) cfun
45734
1024dd30da42 hide quickcheck constants Abs_cfun and Rep_cfun, to avoid clash with HOLCF
huffman
parents: 45001
diff changeset
   169
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
   170
51df23535105 handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents: 42022
diff changeset
   171
subsubsection {* Setting up the counterexample generator *}
43237
8f5c3c6c2909 adding compilation that allows existentials in Quickcheck_Narrowing
bulwahn
parents: 43047
diff changeset
   172
48891
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48565
diff changeset
   173
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
   174
51df23535105 handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents: 42022
diff changeset
   175
setup {* Narrowing_Generators.setup *}
51df23535105 handling a quite restricted set of functions in Quickcheck_Narrowing by an easy transformation
bulwahn
parents: 42022
diff changeset
   176
45001
5c8d7d6db682 ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents: 43887
diff changeset
   177
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
   178
where
5c8d7d6db682 ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents: 43887
diff changeset
   179
  "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
   180
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   181
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
   182
where
5c8d7d6db682 ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents: 43887
diff changeset
   183
  "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
   184
5c8d7d6db682 ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents: 43887
diff changeset
   185
lemma [code]:
5c8d7d6db682 ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents: 43887
diff changeset
   186
  "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
   187
    (let
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   188
      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
   189
      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
   190
      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
   191
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
   192
46308
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   193
subsection {* Narrowing for sets *}
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   194
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   195
instantiation set :: (narrowing) narrowing
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   196
begin
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   197
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   198
definition "narrowing_set = Quickcheck_Narrowing.apply (Quickcheck_Narrowing.cons set) narrowing"
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   199
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   200
instance ..
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   201
e5abbec2697a adding narrowing instance for sets
bulwahn
parents: 46032
diff changeset
   202
end
45001
5c8d7d6db682 ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents: 43887
diff changeset
   203
  
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   204
subsection {* Narrowing for integers *}
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   205
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   206
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   207
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
   208
where
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   209
  "drawn_from xs =
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   210
    Narrowing_cons (Narrowing_sum_of_products (map (\<lambda>_. []) xs)) (map (\<lambda>x _. x) xs)"
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   211
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   212
function around_zero :: "int \<Rightarrow> int list"
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   213
where
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   214
  "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
   215
  by pat_completeness auto
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   216
termination by (relation "measure nat") auto
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   217
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   218
declare around_zero.simps [simp del]
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   219
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   220
lemma length_around_zero:
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   221
  assumes "i >= 0" 
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   222
  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
   223
proof (induct rule: int_ge_induct [OF assms])
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   224
  case 1
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   225
  from 1 show ?case by (simp add: around_zero.simps)
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   226
next
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   227
  case (2 i)
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   228
  from 2 show ?case
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   229
    by (simp add: around_zero.simps [of "i + 1"])
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   230
qed
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   231
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   232
instantiation int :: narrowing
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   233
begin
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   234
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   235
definition
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   236
  "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
   237
    in drawn_from (around_zero i))"
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   238
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   239
instance ..
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   240
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   241
end
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   242
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   243
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
   244
  by (rule partial_term_of_anything)+
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   245
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   246
lemma [code]:
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   247
  "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
   248
    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
   249
  "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
   250
    (if i mod 2 = 0
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   251
     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
   252
     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
   253
  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
   254
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   255
instantiation integer :: narrowing
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   256
begin
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   257
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   258
definition
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   259
  "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
   260
    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
   261
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   262
instance ..
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   263
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   264
end
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   265
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   266
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
   267
  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
   268
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   269
lemma [code]:
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   270
  "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
   271
    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
   272
  "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
   273
    (if i mod 2 = 0
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   274
     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
   275
     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
   276
  by (rule partial_term_of_anything)+
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   277
56401
3b2db6132bfd add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents: 56047
diff changeset
   278
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
   279
  "(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
   280
     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
   281
     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
   282
     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
   283
     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
   284
     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
   285
     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
   286
       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
   287
     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
   288
     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
   289
     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
   290
         Generated'_Code.App
3b2db6132bfd add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents: 56047
diff changeset
   291
           (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
   292
              (mkFunT numT t))
3b2db6132bfd add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents: 56047
diff changeset
   293
           (mkNumeral i)
3b2db6132bfd add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents: 56047
diff changeset
   294
       else
3b2db6132bfd add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents: 56047
diff changeset
   295
         Generated'_Code.App
3b2db6132bfd add missing adaptation for narrowing to work with variables of type integer => integer
Andreas Lochbihler
parents: 56047
diff changeset
   296
           (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
   297
           (mkNumber (- i)); } in mkNumber)"
43356
2dee03f192b7 adding another narrowing strategy for integers
bulwahn
parents: 43341
diff changeset
   298
46589
689311986778 adding new command "find_unused_assms"
bulwahn
parents: 46308
diff changeset
   299
subsection {* The @{text find_unused_assms} command *}
689311986778 adding new command "find_unused_assms"
bulwahn
parents: 46308
diff changeset
   300
48891
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48565
diff changeset
   301
ML_file "Tools/Quickcheck/find_unused_assms.ML"
46589
689311986778 adding new command "find_unused_assms"
bulwahn
parents: 46308
diff changeset
   302
689311986778 adding new command "find_unused_assms"
bulwahn
parents: 46308
diff changeset
   303
subsection {* Closing up *}
689311986778 adding new command "find_unused_assms"
bulwahn
parents: 46308
diff changeset
   304
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   305
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
   306
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 Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
   307
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 Quickcheck-Narrowing
bulwahn
parents: 46589
diff changeset
   308
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
   309
45001
5c8d7d6db682 ensuring that some constants are generated in the source code by adding calls in ensure_testable
bulwahn
parents: 43887
diff changeset
   310
end
51143
0a2371e7ced3 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents: 50046
diff changeset
   311