renamed subclass to classrel; tune type checking error msgs;

Sorts.str_of_sort;

Sorts.str_of_arity;

added sorts.ML, type_infer.ML;

tuned type of eq_ix, mem_ix;

improved inc, dec; added set_ap;

Type inference (isolated from type.ML, completely reimplemented).

Type classes and sorts (isolated from type.ML).

improved;

Partially converted to call blast_tac

Addition of blast_tac benchmark

Changed penalty from log2 to log3

An extra call to blast_tac (illustrating a need for type instantiation)

Now puts basic rewrites for lappend & lmap into the simpset

Removed "AddSDs [Scons_inject];" because (a) IT WAS WRONG (should have been AddSEs) (b) It was redundant (due to the AddIffs [...,Scons_Scons_eq])

Moved expand_case_tac from Auth/Message.ML to simpdata.ML

no longer includes ~/.emacs;

fixed file name;

GENERATED TEXT;

tuned format;

GENERATED TEXT;

GENERATED TEXT;

fixencoding - fix references to isabelle font encoding;

tuned comments;

misc improvement;

Setup GNU Emacs for Isabelle environment.

tuned;

fixed { ... } shell syntax to accomodate bash 2.x;

Yet more fast_tac->blast_tac, and other tidying

tuned error msg;

Updated discussion and references for inductive definitions

Deleted stupid proof at the end not needed anywhere.

Mod because of "Turned Addsimps into AddIffs for datatype laws."

Turned Addsimps into AddIffs for datatype laws.

Changed some fast_tac to blast_tac

Added trace output and replaced fast_tac set_cs by Fast_tac.

replaced 'addwrapper' and 'addWrapper' by correct 'compwrapper' and 'compWrapper'

Thorough update.

Using Blast_tac

Control over excessive branching by applying a log2 penalty Incorporation of debugging features Allows backtracking over haz rules if alternatives exist Subsitution for equality may more a rule from the haz to the safe part

Explicit depth bounds seem necessary

Using Blast_tac

Dependency on Provers/nat_transitive

Couldn't solve n < n+1 because of missing -1

Dep. on Provers/nat_transitive

added -t (run tests) option;

added -g, -h options; replaced ISABELLE_HTML by ISABELLE_USEDIR_OPTIONS;

tuned xdvi invocation;

replaced ISABELLE_HTML by ISABELLE_USEDIR_OPTIONS;

improved messages;

fixed diagnostic output of print modes;

moved inj and surj from Set to Fun and Inv -> inv.

Inv -> inv

*** empty log message ***

Added Example Quot CVS ----------------------------------------------------------------------

Start Example

inv -> inverse

Example for higher order quotients: Fractionals

(higher-order) quotient constructor quot, based on PER

(partial) equivalecne relations. classes er<per

Inv -> inv

added -b option (batch mode);

renamed variable 'inv'

added Quot examples;

*** empty log message ***

Higher-order quotients.

Now calls blast_tac

Another blast_tac call

Simplified a proof

Re-organization of the order of haz rules

Calls Blast_tac. Tidied some proofs

Calls Blast_tac. Tidied some proofs

Calls Blast_tac

Adds image_eqI instead of imageI, as the former is more general

Added blast.ML as a dependency

Now calls Blast_tac and has some hard examples (Halting Problem

Only layout mods.

Now: unit = {True}

Two extra commands shorten the proof time by 800 seconds...

More List and ListPair utilities

Now exports declConsts! Temporarily erased target signature to aid debugging

Declares overloading for if-and-only-if

Declares overloading for set-theoretic constants

Removed (Unit) in Prod. Added test for ancestor Nat in datatype.

misc improvements;

changed signature of dummy goal from proto_pure to pure;

Converted to call blast_tac. Proves theorems in ZF.thy to make that theory usable again

Uses ZF.thy again, to make that theory usable

Mostly converted to blast_tac

Datatype declarations now require theory Datatype--NOT in quotes

Converted back from upair.thy to ZF.thy

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