src/HOL/ex/ROOT.ML
author paulson
Wed Nov 05 13:23:46 1997 +0100 (1997-11-05)
changeset 4153 e534c4c32d54
parent 3404 91a91790899a
child 4449 df30e75f670f
permissions -rw-r--r--
Ran expandshort, especially to introduce Safe_tac
clasohm@1465
     1
(*  Title:      HOL/ex/ROOT
clasohm@969
     2
    ID:         $Id$
clasohm@1465
     3
    Author:     Tobias Nipkow, Cambridge University Computer Laboratory
clasohm@969
     4
    Copyright   1991  University of Cambridge
clasohm@969
     5
clasohm@969
     6
Executes miscellaneous examples for Higher-Order Logic. 
clasohm@969
     7
*)
clasohm@969
     8
clasohm@1165
     9
HOL_build_completed;    (*Cause examples to fail if HOL did*)
clasohm@969
    10
clasohm@1165
    11
writeln "Root file for HOL examples";
nipkow@1026
    12
proof_timing := true;
paulson@3294
    13
paulson@3294
    14
(**Some examples of recursive function definitions: the TFL package**)
paulson@3404
    15
time_use_thy "Recdef";
paulson@3294
    16
time_use_thy "Fib";
paulson@3294
    17
time_use_thy "Primes";
paulson@3337
    18
time_use_thy "Primrec";
paulson@3294
    19
paulson@3294
    20
time_use_thy "NatSum";
clasohm@1351
    21
time_use     "cla.ML";
clasohm@1351
    22
time_use     "meson.ML";
clasohm@1351
    23
time_use     "mesontest.ML";
paulson@1719
    24
(** time_use "mesontest2.ML";  ULTRA SLOW **)
nipkow@1026
    25
time_use_thy "String";
lcp@1174
    26
time_use_thy "BT";
nipkow@1026
    27
time_use_thy "InSort";
nipkow@1026
    28
time_use_thy "Qsort";
nipkow@1026
    29
time_use_thy "Puzzle";
paulson@3294
    30
clasohm@1351
    31
time_use     "set.ML";
nipkow@1026
    32
time_use_thy "MT";
clasohm@1296
    33
clasohm@1165
    34
writeln "END: Root file for HOL examples";