src/ZF/ex/ROOT.ML
author lcp
Wed Dec 01 17:40:27 1993 +0100 (1993-12-01)
changeset 180 8962c2b0dc2b
parent 125 bba27d15d76e
child 365 796c5e305b31
permissions -rw-r--r--
ZF/ex/ROOT: changed many time_use calls to time_use_thy or else deleted
them, to make the most of the load-path mechanism. (use_thy adds the new
theory to the list of loaded theories.)
clasohm@0
     1
(*  Title: 	ZF/ex/ROOT
clasohm@0
     2
    ID:         $Id$
clasohm@0
     3
    Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   1993  University of Cambridge
clasohm@0
     5
clasohm@0
     6
Executes all examples for Zermelo-Fraenkel Set Theory
clasohm@0
     7
*)
clasohm@0
     8
lcp@16
     9
ZF_build_completed;	(*Make examples fail if ZF did*)
clasohm@0
    10
clasohm@0
    11
writeln"Root file for ZF Set Theory examples";
clasohm@0
    12
proof_timing := true;
clasohm@0
    13
clasohm@125
    14
loadpath := [".", "ex"];
clasohm@125
    15
clasohm@0
    16
time_use     "ex/misc.ML";
clasohm@125
    17
time_use_thy "ex/Ramsey";
clasohm@0
    18
clasohm@0
    19
(*Equivalence classes and integers*)
clasohm@125
    20
time_use_thy "ex/Equiv";
clasohm@125
    21
time_use_thy "ex/Integ";
clasohm@0
    22
(*Binary integer arithmetic*)
clasohm@91
    23
use          "ex/twos_compl.ML";
clasohm@125
    24
time_use_thy "ex/BinFn";
clasohm@0
    25
clasohm@0
    26
(** Datatypes **)
lcp@180
    27
time_use_thy "ex/BT_Fn";	(*binary trees*)
lcp@180
    28
time_use_thy "ex/TermFn";	(*terms: recursion over the list functor*)
lcp@180
    29
time_use_thy "ex/TF_Fn";	(*trees/forests: mutual recursion*)
lcp@180
    30
time_use_thy "ex/Data";		(*Sample datatype*)
lcp@180
    31
time_use_thy "ex/Enum";		(*Enormous enumeration type*)
clasohm@0
    32
clasohm@0
    33
(** Inductive definitions **)
lcp@180
    34
time_use_thy "ex/Rmap";		(*mapping a relation over a list*)
lcp@180
    35
time_use_thy "ex/PropLog";	(*completeness of propositional logic*)
clasohm@0
    36
(*two Coq examples by Ch. Paulin-Mohring*)
lcp@180
    37
time_use_thy "ex/ListN";
lcp@180
    38
time_use_thy "ex/Acc";
lcp@180
    39
time_use_thy "ex/Contract0";	(*Contraction relation for combinatory logic*)
lcp@180
    40
time_use_thy "ex/ParContract";	(*Diamond property for combinatory logic*)
clasohm@125
    41
time_use_thy "ex/Primrec0";
clasohm@0
    42
lcp@120
    43
(** CoDatatypes **)
clasohm@76
    44
time_use_thy "ex/LList";
clasohm@125
    45
time_use_thy "ex/LListFn";
lcp@95
    46
time_use     "ex/counit.ML";
clasohm@0
    47
clasohm@0
    48
maketest"END: Root file for ZF Set Theory examples";