proper context for prove_cont/adm_tac;

with_attributes: canonical capture/release scheme (potentially iron out race condition);

considerable speedup of benchmarks by using minimal simpset;

allow non-printable symbols within string tokens;

merged

add lemma det_diagonal; remove wellorder requirement on several lemmas

merged

tuned some theorem and attribute bindings

proper spacing before ML antiquotations -- note that @ may be part of symbolic ML identifiers;

eval_antiquotes: joint scanning of ML tokens and antiquotations;

added scan_antiq; more robust scan_ml: plain scanning without cut, regular Symbol_Pos.content instead of Symbol_Pos.implode (which contains spurious Symbol.DEL is used with proper positions);

RAW: provide dummy Isar.main to make tty work gracefully (with ML toplevel);

added tokenize; internal scan_str: ensure Symbol.is_regular, otherwise it might swallow the stopper and crash!

parameterized datatype antiquote and read operation;

Antiquote.Text: keep full position information;

OuterLex.read_antiq;

moved Isar/antiquote.ML to General/antiquote.ML, which is loaded early;

moved basic change_prompt, scan_string, scan_alt_string, scan_quoted to symbol_pos.ML; scan_comment: recovered change_prompt; moved read_antiq to outer_lex.ML;

use Name.of_binding for basic logical entities without name space (fixes, case names etc.);

Name.of_binding: proper full_name (with checks) before projecting base name;

merged

imported patch euclidean

Merged.

Updated chapters 1-5 to locale reimplementation.

command 'use', 'ML': apply ML environment to theory and target as well; tuned command descriptions;

added map_contexts (cf. Proof.map_contexts);

tuned;

generalized ML_Context.inherit_env;

more precise type Symbol_Pos.text;

more precise type Symbol_Pos.text; geralized ML_Context.inherit_env;

de-camelized Symbol_Pos;

Library.merge/OrdList.union: optimize the important special case where the tables coincide -- NOTE: this changes both the operational behaviour and the result for non-standard eq/ord notion;

reduced verbosity;

made SML/NJ happy

tuned interpunctation

strip_abss: always strip abstractions as far as possible, without keeping alternatives (which appear to be redundant anyway, but cause significant slowdown since discrimination nets collapse abstractions);

close/all_assm_tac: finish all subgoals from left to right (cf. Proof.goal_tac a28d83e903ce) -- NB: ALLGOALS/THEN_ALL_NEW operate from right to left;

reverted abbreviations: improved performance via Item_Net.T;

export match_rew -- useful for implementing "procs" for rewrite_term;

tuned comment;

merged

document new additions to HOL/Library

clean up proofs

adapted to general Item_Net;

turned structure NetRules into general Item_Net, which is loaded earlier;

renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);

goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;

eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly; tuned;

tuned aeconv: test plain aconv before expensive eta_contract;

substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);

refined is_norm_hhf: reject beta-redexes (rules based on term nets or could_unify assume normal form), also potentially faster by avoiding expensive Envir.beta_eta_contract;

provide Simplifier.norm_hhf(_protect) as regular simplifier operation;

method parser: pass proper context;

merged

simplified method setup;

updated generated file;

simplifief 'method_setup' command;

spelling;

export method parser;

adapted 'method_setup' command to Method.setup;