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;

tuned signature;

have remote script interrupted like the other provers

simplified method setup;

export section, sections; tuned signature;

merged

updated NEWS

use goal instead of Proof State

split relevance-filter and writing of problem-files; perform relevance-filtering for only one subgoal; added additional explicit timeout to provers

show certain errors to the user

removed connection check; adapted times

merged

merged

reverted to old version of Set.thy -- strange effects have to be traced first

simplified attribute and method setup;

simplified attribute setup; replaced add_args by add parser;

simplified attribute setup;

updated generated files;

added 'attribute_setup' command;

added setup and attribute_setup -- expect plain parser instead of syntax function; aded add_del parser;

ML_Syntax.make_binding;

added make_binding;

removed obsolete no_base_names naming policy;

merged

merged

coherent binding policy with primitive target operations

moved some generic nonsense to arith_data.ML

tuned ML code

remove legacy ML bindings

simplified method setup;

simplified goal_spec: default to first goal;

eliminated type Args.T; pervasive types 'a parser and 'a context_parser;

added simplified setup; eliminated type Args.T; pervasive types 'a parser and 'a context_parser;

pervasive types 'a parser and 'a context_parser;

unified type Proof.method and pervasive METHOD combinators;

more regular method setup via SIMPLE_METHOD;

tuned Method exports: non-pervasive type method (cf. Proof.method), pervasive METHOD combinators;

merged

fix typed print translation for CARD('a)

introduce new helper functions; clean up proofs

merged

added comment

hiding numeric coercions in LaTeX

merged

dropped spurious `quote` tags

merged

tuned

strippd Id

vague cleanup in arith proof tools setup: deleted dead code, more proper structures, clearer arrangement

tuned

consider exit status of code generation direcitve

provide regular ML interfaces for Isar source language elements;

get data from plain Proof.context;

more user aliases;

merged

remove trailing spaces

remove trailing spaces

simplified preparation and outer parsing of specification; export extern cmd interfaces as well;

simplified preparation and outer parsing of specification;

removed legacy_infer_term, legacy_infer_prop; modernized naming conventions: foo vs. foo_cmd; simplified preparation and outer parsing of specification; simplified command syntax setup;

old name_spec for 'axioms' and 'defs' (from spec_parse.ML);

added legacy type inference (from fixrec_package.ML);

simplified versions check_spec, read_spec, check_free_spec, read_free_spec: operate on list of singleton statements; simplified check_specification, read_specification: operate on a single list of simultaneous statements; tuned;

removed old named_spec, spec_name, spec_opt_name; clarified spec vs. specs; added alt_specs, where_alt_specs -- try to be robust against malformed input;

keep dead code fresh;

tuned;

merged

merged

added div lemmas

merged

optional latex sugar

Assumption.all_prems_of, Assumption.all_assms_of;

Assumption.local_prems_of;

renamed assms_of to all_assms_of, and prems_of to all_prems_of; added local_assms_of, local_prems_of; removed unused add_view;

axiomatization: more precise treatment of binding;

renamed sticky_prefix to mandatory_path;

replaced old-style add_path/no_base_names by sticky_prefix;

updated according to actual manual title;

renamed NameSpace.bind to NameSpace.define;

renamed bind to define; misc tuning and polishing;

tuned signature;