src/ZF/ROOT.ML
author lcp
Wed Jul 27 15:33:42 1994 +0200 (1994-07-27)
changeset 488 52f7447d4f1b
parent 484 70b789956bd3
child 516 1957113f0d7d
permissions -rw-r--r--
Addition of infinite branching datatypes
     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 
    31 use_thy "InfDatatype";
    32 use_thy "ListFn";
    33 
    34 (*printing functions are inherited from FOL*)
    35 print_depth 8;
    36 
    37 val ZF_build_completed = ();	(*indicate successful build*)