Allows more backtracking in proof reconstruction, making it slower but more
robust (avoiding PROOF FAILED)
Record type of branches, better tracing, etc.
(* Title: LCF/ROOT
ID: $Id$
Author: Tobias Nipkow
Copyright 1992 University of Cambridge
Adds LCF to a database containing First-Order Logic.
This theory is based on Lawrence Paulson's book Logic and Computation.
*)
val banner = "Logic for Computable Functions (in FOL)";
writeln banner;
print_depth 1;
use_thy "LCF";
use"simpdata.ML";
use_thy"pair";
use_thy"fix";
val LCF_build_completed = (); (*indicate successful build*)