author | lcp |
Thu, 06 Apr 1995 11:27:54 +0200 | |
changeset 241 | b67c8e01ae04 |
parent 240 | 2209eb5bb56b |
child 251 | f04b33ce250f |
permissions | -rw-r--r-- |
163 | 1 |
(* Title: HOL/ROOT.ML |
0 | 2 |
ID: $Id$ |
163 | 3 |
Author: Tobias Nipkow |
0 | 4 |
Copyright 1993 University of Cambridge |
5 |
||
163 | 6 |
Adds Classical Higher-order Logic to a database containing Pure Isabelle. |
0 | 7 |
Should be executed in the subdirectory HOL. |
8 |
*) |
|
9 |
||
10 |
val banner = "Higher-Order Logic"; |
|
11 |
writeln banner; |
|
12 |
||
163 | 13 |
print_depth 1; |
14 |
set eta_contract; |
|
10 | 15 |
|
163 | 16 |
(* Add user sections *) |
17 |
use "../Pure/section_utils.ML"; |
|
18 |
use "thy_syntax.ML"; |
|
19 |
||
17 | 20 |
use_thy "HOL"; |
240 | 21 |
use "../Provers/simplifier.ML"; |
22 |
use "../Provers/splitter.ML"; |
|
0 | 23 |
use "../Provers/hypsubst.ML"; |
24 |
use "../Provers/classical.ML"; |
|
25 |
||
26 |
(** Applying HypsubstFun to generate hyp_subst_tac **) |
|
27 |
||
28 |
structure Hypsubst_Data = |
|
29 |
struct |
|
240 | 30 |
structure Simplifier = Simplifier |
0 | 31 |
(*Take apart an equality judgement; otherwise raise Match!*) |
32 |
fun dest_eq (Const("Trueprop",_) $ (Const("op =",_) $ t $ u)) = (t,u); |
|
240 | 33 |
val eq_reflection = eq_reflection |
0 | 34 |
val imp_intr = impI |
35 |
val rev_mp = rev_mp |
|
163 | 36 |
val subst = subst |
0 | 37 |
val sym = sym |
38 |
end; |
|
39 |
||
40 |
structure Hypsubst = HypsubstFun(Hypsubst_Data); |
|
41 |
open Hypsubst; |
|
42 |
||
166 | 43 |
(*** Applying ClassicalFun to create a classical prover ***) |
44 |
structure Classical_Data = |
|
0 | 45 |
struct |
166 | 46 |
val sizef = size_of_thm |
47 |
val mp = mp |
|
48 |
val not_elim = notE |
|
49 |
val classical = classical |
|
0 | 50 |
val hyp_subst_tacs=[hyp_subst_tac] |
51 |
end; |
|
52 |
||
53 |
structure Classical = ClassicalFun(Classical_Data); |
|
54 |
open Classical; |
|
55 |
||
56 |
(*Propositional rules*) |
|
57 |
val prop_cs = empty_cs addSIs [refl,TrueI,conjI,disjCI,impI,notI,iffI] |
|
58 |
addSEs [conjE,disjE,impCE,FalseE,iffE]; |
|
59 |
||
60 |
(*Quantifier rules*) |
|
163 | 61 |
val HOL_cs = prop_cs addSIs [allI] addIs [exI,ex1I] |
0 | 62 |
addSEs [exE,ex1E] addEs [allE]; |
63 |
||
64 |
use "simpdata.ML"; |
|
17 | 65 |
use_thy "Ord"; |
119 | 66 |
use_thy "subset"; |
67 |
use_thy "equalities"; |
|
163 | 68 |
use "hologic.ML"; |
69 |
use "subtype.ML"; |
|
17 | 70 |
use_thy "Prod"; |
71 |
use_thy "Sum"; |
|
128 | 72 |
use_thy "Gfp"; |
73 |
use_thy "Nat"; |
|
74 |
||
129 | 75 |
use "datatype.ML"; |
128 | 76 |
use "ind_syntax.ML"; |
77 |
use "add_ind_def.ML"; |
|
78 |
use "intr_elim.ML"; |
|
79 |
use "indrule.ML"; |
|
183 | 80 |
use_thy "Inductive"; |
128 | 81 |
|
82 |
use_thy "Finite"; |
|
196
61620d959717
Moved the old List to ex and replaced it by one defined via
nipkow
parents:
183
diff
changeset
|
83 |
use_thy "Sexp"; |
148 | 84 |
use_thy "List"; |
0 | 85 |
|
163 | 86 |
init_pps (); |
87 |
print_depth 8; |
|
0 | 88 |
|
163 | 89 |
val HOL_build_completed = (); (*indicate successful build*) |