added Isar_examples/NestedDatatype.thy;

added NestedDatatype.thy;

added NestedDatatype;

fixed goal selection;

Isar: simplified (more robust) goal selection of proof methods; Isar: tuned 'let' syntax: replace 'as' keyword by 'and';

induct/case_tac emulation: optional rule; add_cases_induct: fixed case names;

HEADGOAL;

tuned comment;

removed "as" keyword;

suppress warning;

print_simpset / print_claset command;

case_tac / induct_tac: optional rule;

case_tac, induct_tac;

'let': replaced 'as' by 'and';

tuned recover;

isapar, isamarkuptext, isamarkuptxt turned into environments;

markup_env_command 'text' / 'txt';

support markup environments;

tuned presentation;

proper naming of fib equations;

recdef: admit names/atts;

isatool document: tuned -c option;

recdef: admit name and atts;

tuned -c option;

recover: observe stopper;

presentation ignore stuff: swallow newline;

added is_newline;

'cd': diag;

more robust handling of explicit rules;

tuned mixfix syntax;

added ProofGeneral.undo;

isatool document: check output file (workaround PolyML problem with RC);

use cong_add_global att;

added cong atts;

added cong atts;

made SML/XL happy;

change_global/local_css move to Provers/clasimp.ML; fixed 'iff' att syntax; added 'cong' att;

setup cong_attrib_setup;

added change_global/local_css;

added 'cong' att; fixed 'iff' syntax;

tuned;

params: preserve case names;

fixed indexing of elim rules;

use Attrib.add_del_args;

added add_del_args;

fixed goal syntax;

comments modified

tuned

included new stanford mirror, mirror links now point to source directly

updated recdef

tuned;

recdef

If all termination conditions are proved automatically, the recusrion equations are added to the simpset automatically. recdef.rules -> recdef.simps

recdef.rules -> recdef.simps

mod in recdef allows to access the correct simpset via simpset().

the simplification rules returned from TFL are now paired with the row they came from.