src/ZF/ROOT.ML
 author clasohm Wed Oct 06 14:19:39 1993 +0100 (1993-10-06) changeset 32 a8f1cdbbc5b8 parent 14 1c0926788772 child 50 37e93ef9c756 permissions -rw-r--r--
changed "list-fn" to "listfn"
```     1 (*  Title: 	ZF/ROOT
```
```     2     ID:         \$Id\$
```
```     3     Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
```
```     4     Copyright   1993  University of Cambridge
```
```     5
```
```     6 Adds Zermelo-Fraenkel Set Theory to a database containing First-Order Logic.
```
```     7
```
```     8 This theory is the work of Martin Coen, Philippe Noel and Lawrence Paulson.
```
```     9 *)
```
```    10
```
```    11 val banner = "ZF Set Theory (in FOL)";
```
```    12 writeln banner;
```
```    13
```
```    14 (*For Pure/tactic??  A crude way of adding structure to rules*)
```
```    15 fun CHECK_SOLVED (Tactic tf) =
```
```    16   Tactic (fn state =>
```
```    17     case Sequence.pull (tf state) of
```
```    18 	None => error"DO_GOAL: tactic list failed"
```
```    19       | Some(x,_) =>
```
```    20 		if has_fewer_prems 1 x then
```
```    21 		    Sequence.cons(x, Sequence.null)
```
```    22 		else (writeln"DO_GOAL: unsolved goals!!";
```
```    23 		      writeln"Final proof state was ...";
```
```    24 		      print_goals (!goals_limit) x;
```
```    25 		      raise ERROR));
```
```    26
```
```    27 fun DO_GOAL tfs = SELECT_GOAL (CHECK_SOLVED (EVERY1 tfs));
```
```    28
```
```    29 print_depth 1;
```
```    30 use_thy "zf";
```
```    31
```
```    32 use     "upair.ML";
```
```    33 use     "subset.ML";
```
```    34 use     "pair.ML";
```
```    35 use     "domrange.ML";
```
```    36 use     "func.ML";
```
```    37 use     "equalities.ML";
```
```    38 use     "simpdata.ML";
```
```    39
```
```    40 (*further development*)
```
```    41 use_thy "bool";
```
```    42 use_thy "sum";
```
```    43 use_thy "qpair";
```
```    44 use     "mono.ML";
```
```    45 use_thy "fixedpt";
```
```    46
```
```    47 (*Inductive/co-inductive definitions*)
```
```    48 use     "ind-syntax.ML";
```
```    49 use     "intr-elim.ML";
```
```    50 use     "indrule.ML";
```
```    51 use     "inductive.ML";
```
```    52 use     "co-inductive.ML";
```
```    53
```
```    54 use_thy "perm";
```
```    55 use_thy "trancl";
```
```    56 use_thy "wf";
```
```    57 use_thy "ordinal";
```
```    58 use_thy "nat";
```
```    59 use_thy "epsilon";
```
```    60 use_thy "arith";
```
```    61
```
```    62 (*Datatype/co-datatype definitions*)
```
```    63 use_thy "univ";
```
```    64 use_thy "quniv";
```
```    65 use     "constructor.ML";
```
```    66 use     "datatype.ML";
```
```    67
```
```    68 use     "fin.ML";
```
```    69 use     "list.ML";
```
```    70 use_thy "listfn";
```
```    71
```
```    72 (*printing functions are inherited from FOL*)
```
```    73 print_depth 8;
```
```    74
```
```    75 val ZF_build_completed = ();	(*indicate successful build*)
```