low-level tuning of map, fold;

ctyp: added 'sorts' field; may_insert_typ/term/env_sorts: observe Sign.all_sorts_nonempty; may_insert_env_sorts: insert sorts of type subst only; instantiate: insert sorts of insts; tuned;

added all_sorts_nonempty;

low-level tuning of fold, fold_rev, foldl_map;

isatool install: removed KDE option;

Fixed bug: lookup' must use = instead of eq_type to compare types of variables, otherwise pattern matching algorithm may loop.

Changed interface of Envir.lookup'

Moved eq_type from envir.ML to type.ML

Implemented modular code generation.

Simplified proof (thanks to strengthened ball_cong).

Proof of wx_ex_prop must now use old bex_cong to prevent simplifier from looping.

Adapted to new interface of RecfunCodegen.add.

Adapted to modular code generation.

Corrected implementation of arbitrary on cname.

Added BasisLibrary prefix to List.concat to avoid problems with modular code generation.

Moved code generator setup from NatBin to IntDef.

Simplified some proofs (thanks to strong_setsum_cong).

Removed setsubgoaler hack (thanks to strong_setsum_cong).

Removed setsubgoaler hack (thanks to strengthened finsum_cong).

Removed setsubgoaler hack.

Tuned finsum_cong to allow that premises are simplified more eagerly.

Added strong_ball_cong and strong_bex_cong (these are now the standard congruence rules for Ball and Bex).

Moved some code lemmas from Main to Nat.

Adapted to new interface of code generator.

Implemented trick (due to Tobias Nipkow) for fine-tuning simplification of premises of congruence rules.

Added strong_setsum_cong and strong_setprod_cong.

defaultsort pcpo

added theorem lift_definedE; moved cont_if to Cont.thy

added tactic cont_tac

remove uses of sign_of

cleaned up

cleaned up

renamed flatdom2monofun to flatdom_strict2mono

cleaned up; reorganized and added section headings

cleaned up; added adm_less to adm_lemmas; added subsection headings

revert to 1.27 due to obscure performance issues (!??);

replace filter2 with List.partition

Proper treatment of beta-redexes in witness theorems.

minor corrections

test sml-dev on mac as well

use only 1 CPU on MacOS 10.4.1

use kleing@cse instead of kleing@in.tum.de

use global settings for isatest-doc

export no_type_brackets; accomodate advanced trfuns; tuned;

proper treatment of advanced trfuns: pass thy argument; tuned warning;

transform_failure in translation functions: TRANSLATION_FAIL; proper treatment of advanced trfuns: pass thy argument; tuned bigimpl_ast_tr, impl_ast_tr';

proper treatment of advanced trfuns: pass thy argument; transform_failure in translation functions: TRANSLATION_FAIL; removed obsolete '*** INSUFFICIENT SYNTAX FOR PREFIX APPLICATION ***';

accomodate advanced trfuns;

removed obsolete (un)fold_ast2;

Drule.implies_intr_hyps;

added print': print depending on print_mode;

no Syntax.internal on thesis;

added print_mode three_buffersN and corresponding cond_print;

cond_print for end-of-proof and calculational commands;

added eq; improved copy/copy_dir: only copy if non-eq;

pass thy as explicit argument (the old ref was not safe in conjunction with lazy evaluation -- the unify code could be fooled about the present theory context);

more efficient treatment of shyps and hyps (use ordered lists); added 'sorts' field to cterm; removed obsolete fix_shyps; moved implies_intr_hyps to drule.ML;

Syntax.read thy;

tuned sort_ord: pointer_eq; tuned size_of_term: less stack usage;

removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort; added efficient operations on ordered lists: eq_set, union, subtract, insert_sort/typ(s)/term(s);