added singleton check_typ/term/prop;

removed obsolete read/cert variations (cf. Syntax.read/check);

replaced ProofContext.cert_term/prop by general Syntax.check_term/prop (which also includes type-inference);

replaced ProofContext.read_term/prop by general Syntax.read_term/prop; replaced ProofContext.cert_term/prop by general Syntax.check_term/prop (which also includes type-inference);

replaced ProofContext.read_term/prop by general Syntax.read_term/prop;

*** empty log message ***

final(?) iteration of sgn saga.

reject_vars: accept type-inference params; standard_term_check: include prepare_pattern; infer_type: mode_schematic; tuned;

exported is_param;

legacy_infer_term: ProofContext.mode_schematic;

prove: setmp quick_and_dirty (avoids race condition);

export various inner syntax modes; Syntax.add_term_check: include expand_abbrevs (consts and var bindings);

type_infer: mode_pattern;

do not touch quick_and_dirty;

tuned multithreading entry -- no longer experimental;

explained \isatstyle(minor)

added short_names explanation

added join_mode; expand_binds: mode dependent; removed infer_types(_pat) -- use general Syntax.check_terms instead;

replaced ProofContext.infer_types by general Syntax.check_terms; use Variable.polymorphic to get schematic type variables;

replaced ProofContext.infer_types by general Syntax.check_terms;

*** empty log message ***

added constant sgn

added lemma

added some more entries;

turned type_check into separate typ/term_check; tuned sifnature;

tuned;

moved type_mode to type.ML; Syntax.add_typ_check;

infer_types: general check_typs instead of Type.cert_typ_mode;

maintain mode in context (get/set/restore_mode);

added burrow_types;

- tuned section about inductive predicates - fixed broken railroad diagram in section about executable code

ported div/mod simprocs from HOL/ex/Binary.thy

renamed POLYML_LINK_OPTIONS to POLY_LINK_OPTIONS;

added POLYML_LINK_OPTIONS, which is required for unusual platforms (notably cygwin);

some simultaneous use_thys;

Updated section about inductive definitions.

turned list comprehension translations into ML to optimize base case

added Hoare/hoare_tac.ML (code from Hoare/Hoare.thy, also required in Isar_examples/Hoare.thy);

added x86-solaris;

fixed Proofs

added Hoare/hoare_tac.ML (code from Hoare/Hoare.thy, also required in Isar_examples/Hoare.thy);

removed unused theorems ; added lifting properties for foldr and foldl

removed Hoare/hoare.ML, Hoare/hoareAbort.ML, ex/svc_oracle.ML (which can be mistaken as attached ML script on case-insensitive file-system);

Deleted unused fillin_mixfix function.

mark all parallel sessions as experimental

atbroy99 is 64bit

fixed pattern comnpletion; untabified

revert to Word library version from 2007/08/20

TheoremHook: fixed copy-paste mistake;

Smaller size and fewer iterations for quickcheck.

codegen.ML is now loaded in Pure again.

Changed "code" attribute of concat_map_singleton to "code unfold".

Code generator now uses sequences with depth limit.

Got rid of large simpset in proof of characteristic equations for freshness.

Added sequences with recursion depth limit.

Adapted to changes in interface of Specification.theorem_i

- restored old setup - new infrastructure for auto quickcheck - fixed bug in eta_expand that caused argument types to get mixed up

codegen.ML is now loaded in Pure again.

- new auto-quickcheck flag - repaired and inserted proof_pref again

Added local_theory_to_proof'