I have modified the grammar for idts (sequences of identifiers with optional type annotations). idts are generally used as in abstractions, be it lambda-abstraction or quantifiers. It now has roughly the form idts = pttrn* pttrn = idt where pttrn is a new nonterminal (type) not used anywhere else. This means that the Pure syntax for idts is in fact unchanged. The point is that the new nontermianl pttrn allows later extensions of this syntax. (See, for example, HOL/Prod.thy). The name idts is not quite accurate any longer and may become downright confusing once pttrn has been extended. Something should be done about this, in particular wrt to the manual.

Simplified proofs thanks to addss.

Fixed old bug in the simplifier. Term to be simplified now carries around its maxidx. Needed for renaming rewrite or congruence rules. maxidx should be ~1 in most cases (ie no Vars), hence reasonable overhead.

Fixed bug.

Brought in line with new organization of IOA.

New examples directories Resid and AC

Definition of 'let' declarations, from HOL

In binders, the default body priority is now p instead of 0.

Now builds Resid as a test

Deleted comment

Renamed diff_sing_lepoll to Diff_sing_lepoll.

Renamed domain_diff_subset, range_diff_subset, field_diff_subset, converse_diff to domain_Diff_subset, range_Diff_subset, field_Diff_subset, converse_Diff for consistency. (Thanks to KG)

Renamed diff_sing_lepoll, lepoll_diff_sing and diff_sing_eqpoll to Diff_sing_lepoll, lepoll_Diff_sing and Diff_sing_eqpoll for consistency. Strengthened lepoll_Diff_sing. (Thanks to KG)

Updated CADE reference

Removes (obsolete) target if already present.

Olafs new version.

Directory example is now called NTP

ABP: Alternating bit protocol example

New ROOT file.

New example by Ole Rasmussen

Simplified some proofs and made them work for new hyp_subst_tac.

expandshort

Deleted some useless things and made proofs of refl_comp_subset and comp_equivI more like the versions in ZF/EquivClass.ML

Simplified using pattern replacements.

adjusted HOLCF for new hyp_subst_tac

Defined vv1 using let. Introduced gg1, gg2.

Deleted subset_imp_Un_Diff_eq, as it is identical to Diff_partition. Used split_tac (sometimes via simplifier) to apply expand_if. Replaced lt_oadd_disj1 by lt_oadd_odiff_disj, using ordinal difference instead of a description. Removed the outer quantifier from all_sum_lepoll_m, all_sum_lepoll_m_2. Changed all "lesspoll succ(m)" to "lepoll m" and simplified proofs. Changed definitions of vv1 and ww1 to use lepoll instead of lesspoll; therefore vv1(f,b,succ(m)) becomes vv1(f,b,m). Moved proof of vv1_not_0 into the body of the proof using this result. Renamed variable aa to s. Simplified lemma_iv using addss. Renamed some theorems; combined some proofs.

New root file