tuned document;

tuned;

improved induction proof: local defs/fixes;

tuned Pattern.match/unify; tuned fold;

added deskolem;

added THEN_ALL_NEW_CASES; Syntax.deskolem;

added revert_skolem, mk_def, add_def; export: Goal.norm_hhf'; tuned;

ProofContext.mk_def;

Term.betapplys;

tuned Pattern.match/unify;

added betapplys;

tuned interfaces to support incremental match/unify (cf. versions in type.ML);

tuned;

norm_hhf: no normalization of protected props;

added protect_cong, cong_mono_thm; outer_params: Syntax.deskolem;

induct: support local definitions to be passed through the induction; deprecate open rule cases; misc cleanup;

Trueprop: use ObjectLogic.judgment etc.; uniform Const of name * typargs, removed TConst;

Term.betapply;

new version of "tryres" allowing multiple unifiers (apparently needed for Skolemization of higher-order theorems)

pgmlsymbolson: append Symbol.xsymbolsN at end!

better no -d option;

added generic transformators

removal of is_hol

added module system

added modules for code generator generation two, not operational yet

class_package - operational view on type classes

string_of_alist - convenient q'n'd printout function

support for polyml-4.2.0;

new syntax for class_package

added const_instance;

added instance;

added ML-Systems/polyml-4.1.4-patch.ML, ML-Systems/polyml-4.2.0.ML;

Compatibility wrapper for Poly/ML 4.2.0.

tuned;

added a few equivariance lemmas (they need to be automated eventually)

changed the HOL_basic_ss back and selectively added simp_thms and triv_forall_equality. (Otherwise the goals would have been simplified too much)

exchanged HOL_ss for HOL_basic_ss in the simplification part. Otherwise the case where the context is instantiated with unit leads to vacuous quantifiers, such as ALL a. A

a proof step corrected due to the changement in the presburger method.

old argument "abs" is replaced by "no_abs". Abstraction is turned on by default.

add header

tuned proofs;

moved find_free to term.ML;

guess: Seq.hd; Term.find_free;

guess: Toplevel.proof;

added find_free (from Isar/proof_context.ML);

curried multiply;

induct method: fixes; tuned;

uncurried Consts.typargs;

renamed Thm.cgoal_of to Thm.cprem_of;

duplicate axioms in ATP linkup, and general fixes

tidying

called the induction principle "unsafe" instead of "test".

Skolemization by inference, but not quite finished

Explicit data structures for some Isar language elements.

tuned;

tvars_intr_list: natural argument order;

moved datatype elem to element.ML; removed unused imports function;

P.context_element, P.locale_element;

Element.context;

use existing exeption Empty;

avoid code redundancy; tuned comments;

tuned comments;

removed obsolete term set operations;

P.locale_element;

added fold_terms; added tfrees_of, frees_of; tvars_intr_list: natural argument order;

added Isar/element.ML;

Thm.varifyT': natural argument order;

added join function

allowing indentation of 'theory' keyword

simplified after_qed;

avoid prove_plain, export_plain, simplified after_qed; witness = term * thm, i.e. the original proposition with a protected fact (this achieves reliable discharge and allows facts to be slightly more general/normalized); internal assume/prove/conclude/satisfy_protected handle witness pairs accordingly; ObjectLogic.ensure_propT;

removed export_plain; (some_)fact_tac: Drule.incr_indexes;

renamed assert_prop to ensure_prop;

renamed goals.ML to old_goals.ML; inline Drule.impose_hyps;

export compose_hhf; removed obsolete norm_hhf_plain; tuned;

removed impose_hyps, satisfy_hyps; tuned;

const args: do not store variable names (unused);

renamed goals.ML to old_goals.ML;

(fix for accidental commit)

(codegen)

generate pattern combinators for new datatypes

reimplemented Case syntax using print/parse translations; moved as-patterns to separate section

add case syntax for type one

remove syntax for as-patterns

avoid 'as' as identifier;

avoid 'as' as identifier;

Added strong induction theorem (currently only axiomatized!).

Initial commit.

Initial commit of the theory "Weakening".

added thms perm, distinct and fresh to the simplifier. One would liket to add also inject, but this causes problems with "congruences" like Lam [a].t1 = Lam [b].t2 P (Lam [a].t1) ----------------------- P (Lam [b].t2) because the equation "Lam [a].t1 = Lam [b].t2" would simplify to "[a].t1 = [b].t2" and then the goal is not true just by simplification.

added proper fillin_mixfix

added fillin_mixfix, replace_quote

New function store_thmss_atts.

used the function Library.product for the cprod from Stefan

fixed bug with nominal induct - the bug occured in rule inductions when the goal did not use all variables from the relation over which the induction was done

added fillin_mixfix' needed by serializer

add case syntax stuff

use consts for infix syntax

add proof of Bekic's theorem: fix_cprod

simplify definitions

put iterate and fix in separate sections; added Letrec

renamed and added ch2ch, cont2cont, mono2mono theorems ending in _fun, _lambda, _LAM

add line breaks to Rep_CFun syntax

moved adm_chfindom from Fix.thy to Cfun.thy; moved admw-related stuff to its own section

moved adm_chfindom from Fix.thy to Cfun.thy

cleaned up

add print translation: Abs_CFun f => LAM x. f x

Changed the way additional lemmas are passed to ATP methods for proof of a goal: now only list them after the methods' names. Also removed some functions that are not used any more.

improve support for mutual recursion: now generates correct copy constant and induction theorem for mutually-recursive types; initial support for indirect recursion

reimplement copy_def to use data constructor constants

cleaned up; renamed library function mk_cRep_CFun to list_ccomb; replaced rep_TFree with dest_TFree; added functions spair, mk_stuple

generate lambda pattern syntax for new data constructors

changed order of arguments for constant behind If-then-else-fi syntax; added LAM patterns for TT, FF

add constant one_when; LAM pattern for ONE

add translation for wildcard pattern

change syntax for LAM to use expressions as patterns; define LAM pattern syntax for cpair, spair, sinl, sinr, up

make cpair_less, cpair_defined_iff into iff rules; add lemma csplit1

cleaned up; ch2ch_Rep_CFun is a simp rule

changed iterate to a continuous type

reorganized; removed intermediate constant Ifix; changed iterate to a continuous type; added theorem fix_least_less