src/HOL/Main.thy
author nipkow
Mon Aug 16 14:22:27 2004 +0200 (2004-08-16)
changeset 15131 c69542757a4d
parent 15063 a43d771c18ac
child 15140 322485b816ac
permissions -rw-r--r--
New theory header syntax.
nipkow@10519
     1
(*  Title:      HOL/Main.thy
nipkow@10519
     2
    ID:         $Id$
webertj@14350
     3
    Author:     Stefan Berghofer, Tobias Nipkow, Tjark Weber, Markus Wenzel (TU Muenchen)
nipkow@10519
     4
*)
wenzelm@9619
     5
wenzelm@12024
     6
header {* Main HOL *}
wenzelm@12024
     7
nipkow@15131
     8
theory Main
nipkow@15131
     9
import Map Infinite_Set Extraction Refute
nipkow@15131
    10
begin
wenzelm@9650
    11
wenzelm@12024
    12
text {*
wenzelm@12024
    13
  Theory @{text Main} includes everything.  Note that theory @{text
wenzelm@12024
    14
  PreList} already includes most HOL theories.
wenzelm@12024
    15
*}
wenzelm@12024
    16
wenzelm@12024
    17
subsection {* Configuration of the code generator *}
berghofe@11533
    18
berghofe@11533
    19
types_code
berghofe@11533
    20
  "bool"  ("bool")
berghofe@12439
    21
  "*"     ("(_ */ _)")
berghofe@11533
    22
berghofe@11533
    23
consts_code
berghofe@11533
    24
  "True"    ("true")
berghofe@11533
    25
  "False"   ("false")
berghofe@11533
    26
  "Not"     ("not")
berghofe@11533
    27
  "op |"    ("(_ orelse/ _)")
berghofe@11533
    28
  "op &"    ("(_ andalso/ _)")
berghofe@11533
    29
  "If"      ("(if _/ then _/ else _)")
berghofe@11533
    30
berghofe@11533
    31
  "Pair"    ("(_,/ _)")
berghofe@11533
    32
  "fst"     ("fst")
berghofe@11533
    33
  "snd"     ("snd")
berghofe@11533
    34
berghofe@13093
    35
  "wfrec"   ("wf'_rec?")
berghofe@13093
    36
berghofe@14102
    37
quickcheck_params [default_type = int]
berghofe@14102
    38
berghofe@13755
    39
ML {*
berghofe@13755
    40
fun wf_rec f x = f (wf_rec f) x;
berghofe@13755
    41
berghofe@14102
    42
fun term_of_bool b = if b then HOLogic.true_const else HOLogic.false_const;
berghofe@13755
    43
val term_of_int = HOLogic.mk_int;
berghofe@14049
    44
fun term_of_id_42 f T g U (x, y) = HOLogic.pair_const T U $ f x $ g y;
berghofe@14102
    45
fun term_of_fun_type _ T _ U _ = Free ("<function>", T --> U);
berghofe@14102
    46
berghofe@14102
    47
val eq_codegen_setup = [Codegen.add_codegen "eq_codegen"
berghofe@14102
    48
  (fn thy => fn gr => fn dep => fn b => fn t =>
berghofe@14102
    49
    (case strip_comb t of
berghofe@14102
    50
       (Const ("op =", Type (_, [Type ("fun", _), _])), _) => None
berghofe@14102
    51
     | (Const ("op =", _), [t, u]) =>
berghofe@14102
    52
          let
berghofe@14102
    53
            val (gr', pt) = Codegen.invoke_codegen thy dep false (gr, t);
berghofe@14102
    54
            val (gr'', pu) = Codegen.invoke_codegen thy dep false (gr', u)
berghofe@14102
    55
          in
berghofe@14102
    56
            Some (gr'', Codegen.parens
berghofe@14102
    57
              (Pretty.block [pt, Pretty.str " =", Pretty.brk 1, pu]))
berghofe@14102
    58
          end
berghofe@14102
    59
     | (t as Const ("op =", _), ts) => Some (Codegen.invoke_codegen
berghofe@14102
    60
         thy dep b (gr, Codegen.eta_expand t ts 2))
berghofe@14102
    61
     | _ => None))];
berghofe@14102
    62
berghofe@14102
    63
fun gen_bool i = one_of [false, true];
berghofe@14102
    64
berghofe@14102
    65
fun gen_int i = one_of [~1, 1] * random_range 0 i;
berghofe@14102
    66
berghofe@14102
    67
fun gen_id_42 aG bG i = (aG i, bG i);
berghofe@14102
    68
berghofe@14102
    69
fun gen_fun_type _ G i =
berghofe@14102
    70
  let
berghofe@14102
    71
    val f = ref (fn x => raise ERROR);
berghofe@14102
    72
    val _ = (f := (fn x =>
berghofe@14102
    73
      let
berghofe@14102
    74
        val y = G i;
berghofe@14102
    75
        val f' = !f
berghofe@14102
    76
      in (f := (fn x' => if x = x' then y else f' x'); y) end))
berghofe@14102
    77
  in (fn x => !f x) end;
berghofe@13755
    78
*}
berghofe@13093
    79
berghofe@14102
    80
setup eq_codegen_setup
berghofe@14102
    81
berghofe@12554
    82
lemma [code]: "((n::nat) < 0) = False" by simp
berghofe@14192
    83
lemma [code]: "(0 < Suc n) = True" by simp
berghofe@14192
    84
lemmas [code] = Suc_less_eq imp_conv_disj
berghofe@12554
    85
webertj@14350
    86
subsection {* Configuration of the 'refute' command *}
webertj@14350
    87
webertj@14350
    88
text {*
webertj@14458
    89
  The following are fairly reasonable default values.  For an
webertj@14458
    90
  explanation of these parameters, see 'HOL/Refute.thy'.
webertj@14350
    91
*}
webertj@14350
    92
webertj@14350
    93
refute_params [minsize=1,
webertj@14350
    94
               maxsize=8,
webertj@14806
    95
               maxvars=10000,
webertj@14806
    96
               maxtime=60,
webertj@14806
    97
               satsolver="auto"]
webertj@14350
    98
wenzelm@9650
    99
end