2001-10-31 wenzelm [Wed, 31 Oct 2001 01:27:04 +0100] rev 11995
- 'induct' may now use elim-style induction rules without chaining
facts, using ``missing'' premises from the goal state; this allows
rules stemming from inductive sets to be applied in unstructured
scripts, while still benefitting from proper handling of non-atomic
statements; NB: major inductive premises need to be put first, all the
rest of the goal is passed through the induction;
NEWS

2001-10-31 wenzelm [Wed, 31 Oct 2001 01:26:42 +0100] rev 11994
(induct set: ...);
src/HOL/Lambda/Type.thy

2001-10-31 wenzelm [Wed, 31 Oct 2001 01:22:27 +0100] rev 11993
put_consumes: really overwrite existing tag;
src/Pure/Isar/rule_cases.ML

2001-10-31 wenzelm [Wed, 31 Oct 2001 01:21:56 +0100] rev 11992
finish_global: Tactic.norm_hhf;
src/Pure/Isar/proof.ML

2001-10-31 wenzelm [Wed, 31 Oct 2001 01:21:31 +0100] rev 11991
use HOL.induct_XXX;
src/HOL/Tools/inductive_package.ML

2001-10-31 wenzelm [Wed, 31 Oct 2001 01:21:01 +0100] rev 11990
use induct_rulify2;
src/HOL/Inductive.thy

2001-10-31 wenzelm [Wed, 31 Oct 2001 01:20:42 +0100] rev 11989
renamed inductive_XXX to induct_XXX;
added induct_impliesI;
src/HOL/HOL.thy

2001-10-31 wenzelm [Wed, 31 Oct 2001 01:19:58 +0100] rev 11988
induct_impliesI;
src/FOL/FOL.thy

2001-10-30 wenzelm [Tue, 30 Oct 2001 17:37:25 +0100] rev 11987
tuned induct proofs;
src/HOL/Isar_examples/Hoare.thy src/HOL/Isar_examples/MutilatedCheckerboard.thy src/HOL/Isar_examples/W_correct.thy src/HOL/Lambda/Type.thy src/HOL/Library/List_Prefix.thy src/HOL/MicroJava/J/TypeRel.thy

2001-10-30 wenzelm [Tue, 30 Oct 2001 17:33:56 +0100] rev 11986
- 'induct' method now derives symbolic cases from the *rulified* rule
(before it used to rulify cases stemming from the internal atomized
version); this means that the context of a non-atomic statement
becomes is included in the hypothesis, avoiding the slightly
cumbersome show "PROP ?case" form;
NEWS