Moved definitions (binary intersection, etc.) from upair.thy back to ZF.thy

Now checks for existence of theory Inductive (Fixedpt was too small)

Now a non-trivial theory so that require_thy can find it

DEEPEN now takes an upper bound for terminating searches

New DEEPEN allows giving an upper bound for deepen_tac

Now builds blast_tac

Now loads blast.ML

ZF.thy is again usable

The isabelle-0 encoding table.

Made the error message more explicit

Now declares Basis Library version of type option Also function mapPartial

Replaced Best_tac by the one rule needed for the proof

Installation of blast_tac

Now tests for essential ancestors (Lfp or Gfp)

Re-ordering of rules to assist blast_tac Powerset rules must not be the most recent

Now loads blast_tac

Reorganization of how classical rules are installed

Now calls require_thy to ensure ancestors are present

Implementation of blast_tac: fast tableau prover

replaced by usedir;

eliminated references to old 8bit fonts;

improved messages;

removed useless symbol font syntax;

fixed -s option;

simple_ast_of: fixed handling of loose Bounds;

Replaced (s,t) : id by s=t.

Optimized proofs.

Changes made necessary by the new ex1 rules

Now uses the alternative (safe!) rules for ex1

Updated comment

Cleaned up a little.

Added "discrete" CPOs and modified IMP to use those rather than "lift"

generalized theorems and class instances for Cprod. Now "*"::(cpo,cpo)cpo and "*"::(pcpo,pcpo)pcpo

changed some theorems from pcpo to cpo

changed continuous functions from pcpo to cpo (including instances)

Trivial renamings (for consistency with CSFW papers)

Toby's better treatment of eta-contraction

Deleted needless parentheses

Deleted unnecessary rules

fixed font names;

exit_use_dir; tuning;

isatool usedir;

exit_use_dir;

remove empty dirs;

isatool usedir;

improved session names;

isatool usedir;

*** empty log message ***

tuned;

isatool usedir;

exit_use_dir;

isatool usedir;

replaced ex.ML by ex/ROOT.ML, ex/ex.ML;

isatool usedir;

added ex dir;

replaced ex.ML by ex/ROOT.ML, ex/ex.ML;

replaced ex.ML by ex/ROOT.ml, ex/ex.ML;

Improved intersection rule InterI: now truly safe, since the unsafeness is delegated to exI.

delete_tagged_brl just ignores non-elimination rules instead of complaining

delrules now deletes ALL occurrences of a rule, since it may appear in any of the four lists.

added quit();

asserts $ISABELLE_OUTPUT_DIR;

Added wp_while.

added dummy set_session;

usedir -- build object-logic or run examples;

A more explicit prefix because gensym now generates easily predicatable identifiers

gensym no longer generates random identifiers, but just enumerates them starting from A. The random number generator was needlessly slow and caused portability problems.

Made the indentation rational

fixed Tools path;

Conducted the IFOL proofs using intuitionistic tools

Stopped giving Introduction rules as Elimination rules

Added P&P&Q <-> P&Q and P|P|Q <-> P|Q

Added P&P&Q = P&Q and P|P|Q = P|Q.

*** empty log message ***

The HOLCF-based den. sem. of IMP.

Added the HOLCF-based den. sem. of IMP.

Added link to HOLCF/IMP

fixed perl path;

uncommented chown / chmod (again);

Modified proofs because simplifier does not eta-contract any longer.

Avoid eta-contraction in the simplifier. Instead the net needs to eta-contract the object. Also added a special function loose_bvar1(i,t) in term.ML.

tuned glyphs;

tuned Sigma glyph;

major tuning;

tuned comments; added -h option;

tuned comments; added ISABELLE_TOOLS support;

tuned comments;

tuned;

tuned comment; more robust check;

Note on fonts and remote X11;

tr is (again) type abbrev;

added THIS_IS_ISABELLE_BUILD;

added THIS_IS_ISABELLE_BUILD discrimination;

The contr_tac, which replaces a fast_tac, is needed only because eq_assume_tac does not recognize eta-equality. But making it do so is costly

renamed;

fixed;