Invoke instruction gets fully qualified method name (class+name+sig) as in Sun's JVM spec

BV and LBV specified in terms of app and step functions

instantiated Cancel_Numerals for "nat" in ZF

more cterm operations: mk_implies, list_implies

prove_conv gets an extra argument, so the ZF instantiation can use hyps

tidied

added a dummy "thm list" argument to prove_conv for the new interface to Cancel_Numerals

new abstract syntax operations, used in ZF

ZF arith

*** empty log message ***

dummy_patterns moved to term.ML;

added goal_args('); added "cut_tac", "thin_tac", "rename_tac"; renamed inst tactics; inst syntax: include empty inst;

added int;

axioms: Term.no_dummy_patterns;

added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;

added rename_params_tac;

dummy_pattern moved to term.ML;

Term.no_dummy_patterns;

added rev_eq_reflection; export stac; proof method setup: subst, hypsubst;

val rev_eq_reflection = def_imp_eq;

val atomize = thms "atomize";

lemmas atomize = all_eq imp_eq; setup hypsubst_setup;

rev_eq_reflection = meta_eq_to_obj_eq;

removed stac (now exported by HypsubstFun);

setup hypsubst_setup;

lemmas atomize = all_eq imp_eq;

added rev_eq_reflection;

subgoals_tac: fixed spelling;

invoke isatool make in any dir containing an IsaMakefile;

updated;

targets for images, test, all;

updated;

tuned;

tuned version by Stephan Merz (unbatchified etc.);

tuned TLA;

added setmp_verbose;

tuned;

unknown_theory/proof/context;

added unknown_theory/proof/context;

new theorem neq_commute

new files Integ/IntPower.{thy.ML}; tidied

introduction of integer exponentiation

Chinese Remainder Theorem, Wilsons Theorem, etc., by T M Masmussen

GPLed;

export get_local_clasimpset, clasimp_modifiers;

improved output of space symbol;

typ_no_norm;

tuned;

adapted deriv;

derivations: maintain oracle flag;

use oracle flag from derivation;

rep_thm: 'der' field has additional bool for oracles;

minor corrections

isa: do not touch_all_thys on startup;

coercion "intify" to remove type constraints from integer algebraic laws

tidying and speeding up proofs

*** empty log message ***

*** empty log message ***

used natify with div and mod; also put in the divide-by-zero trick

natify, a coercion to reduce the number of type constraints in arithmetic

tuned msg;

* blast(_tac) now handles actual object-logic rules as assumptions; note that auto(_tac) uses blast(_tac) internally, too; tuned;

added all_eq, imp_eq (for blast);

improved comments; added all_eq, imp_eq (for blast); basic calculational rules;

handle actual object-logic rules by atomizing the goal;

added atomize_goal / atomize_tac;

(un)fold: CHANGED; added atomize_tac;

added has_meta_prems;

tuned;

tuned;

updated 'obtain';

Removed Quot

Never used and not relevant.

obtain;

added split_bind_asm, bind_splits;

adapted obtain; tuned;

removed equalityCE;

added atomic_Trueprop;

updated ObtainFun;

'def': no constraint on variable;

exporter setup for context elements;

export RANGE, hard_asm_tac, soft_asm_tac; export is_chain, assert_forward_or_chain; added the_fact; updated ProofContext.export_wrt;

turned into plain context element; exporter setup;

local_def(_i): no constraint on var; exporter setup;

local_def(_i): no constraint on var;

def: no constraint on var;

added is_judgment; removed atomic_thesis;

ObtainFun (generalized existence reasoning);

ThmDeps.enable;

added sign_of_cterm;

Logic.goal_const;

replaced "Sessions" by "Root";

apply. -> by

* HOL/While

added theory While;

export has_internal; tag some rules as internal;