retired Ben Porter's DenumRat in favour of the shorter proof in
Real/Rational.thy
(* Title: HOL/ex/ROOT.ML
ID: $Id$
Miscellaneous examples for Higher-Order Logic.
*)
no_document use_thys [
"Parity",
"Eval",
"State_Monad",
"Efficient_Nat_examples",
"ExecutableContent",
"FuncSet",
"Word",
"Eval_Examples",
"Quickcheck"
];
no_document use_thy "Codegenerator";
no_document use_thy "Codegenerator_Pretty";
use_thys [
"Numeral",
"ImperativeQuicksort",
"Higher_Order_Logic",
"Abstract_NAT",
"Guess",
"Binary",
"Recdefs",
"Fundefs",
"Induction_Scheme",
"InductiveInvariant_examples",
"Locales",
"LocaleTest2",
"Records",
"MonoidGroup",
"BinEx",
"Hex_Bin_Examples",
"Antiquote",
"Multiquote",
"PER",
"NatSum",
"ThreeDivides",
"Intuitionistic",
"CTL",
"Arith_Examples",
"BT",
"MergeSort",
"Puzzle",
"Lagrange",
"Groebner_Examples",
"MT",
"Unification",
"Commutative_RingEx",
"Commutative_Ring_Complete",
"Primrec",
"Tarski",
"Adder",
"Classical",
"set",
"Meson_Test",
"Code_Antiq",
"LexOrds"
];
setmp Proofterm.proofs 2 time_use_thy "Hilbert_Classical";
time_use_thy "Dense_Linear_Order_Ex";
time_use_thy "PresburgerEx";
time_use_thy "Reflected_Presburger";
time_use_thy "Reflection";
time_use_thy "SVC_Oracle";
if_svc_enabled time_use_thy "svc_test";
(* requires a proof-generating SAT solver (zChaff or MiniSAT) to be *)
(* installed: *)
try time_use_thy "SAT_Examples";
(* requires zChaff (or some other reasonably fast SAT solver) to be *)
(* installed: *)
if getenv "ZCHAFF_HOME" <> "" then
time_use_thy "Sudoku"
else ();
time_use_thy "Refute_Examples";
time_use_thy "Quickcheck_Examples";
no_document time_use_thy "NormalForm";
HTML.with_charset "utf-8" (no_document use_thys) ["Hebrew", "Chinese"];
no_document use_thys [
"../NumberTheory/Factorization",
"../Library/BigO"
];
use_thys [
"../Complex/ex/BinEx",
"../Complex/ex/Sqrt",
"../Complex/ex/Sqrt_Script",
"../Complex/ex/BigO_Complex",
"../Complex/ex/Arithmetic_Series_Complex",
"../Complex/ex/HarmonicSeries",
"../Complex/ex/MIR",
"../Complex/ex/ReflectedFerrack"
];