src/HOL/Bali/DefiniteAssignmentCorrect.thy
2009-10-17 wenzelm 2009-10-17 eliminated hard tabulators, guessing at each author's individual tab-width; tuned headers;
2009-09-21 haftmann 2009-09-21 tuned proofs
2008-05-17 wenzelm 2008-05-17 tuned proof;
2007-09-30 wenzelm 2007-09-30 avoid internal names;
2007-07-28 wenzelm 2007-07-28 tuned ML/simproc declarations;
2007-06-13 wenzelm 2007-06-13 tuned proofs: avoid implicit prems;
2006-12-11 berghofe 2006-12-11 Adapted to new inductive definition package.
2006-09-11 wenzelm 2006-09-11 induct method: renamed 'fixing' to 'arbitrary';
2006-08-02 wenzelm 2006-08-02 tuned proofs;
2006-08-02 wenzelm 2006-08-02 lemma da_good_approx: adapted induction (was exploting lifted obtain result);
2006-06-12 wenzelm 2006-06-12 avoid accidental binding of ?Jmp;
2006-01-04 nipkow 2006-01-04 Reversed Larry's option/iff change.
2005-12-22 wenzelm 2005-12-22 mutual induct with *.inducts;
2005-12-21 paulson 2005-12-21 removed or modified some instances of [iff]
2005-11-25 wenzelm 2005-11-25 removed obsolete dummy paragraphs;
2005-09-22 nipkow 2005-09-22 renamed rules to iprover
2005-06-17 haftmann 2005-06-17 migrated theory headers to new format
2004-02-19 ballarin 2004-02-19 Efficient, graph-based reasoner for linear and partial orders. + Setup as solver in the HOL simplifier.
2003-05-14 schirmer 2003-05-14 Adapted to changes in Map.thy
2003-02-08 nipkow 2003-02-08 adjusted dom rules
2002-11-01 schirmer 2002-11-01 Inserted some extra paragraphs in large proofs to make tex run...
2002-10-31 schirmer 2002-10-31 "Definite Assignment Analysis" included, with proof of correctness. Large adjustments of type safety proof and soundness proof of the axiomatic semantics were necessary. Completeness proof of the loop rule of the axiomatic semantic was altered. So the additional polymorphic variants of some rules could be removed.