src/HOLCF/IOA/meta_theory/Sequence.ML
2001-01-09 nipkow 2001-01-09 ` -> $
2000-09-06 nipkow 2000-09-06 less_induct -> nat_less_induct
2000-03-13 wenzelm 2000-03-13 renamed cases_tac to case_tac;
2000-03-13 nipkow 2000-03-13 exhaust->cases
1999-08-17 wenzelm 1999-08-17 renamed Cons to Consq in order to avoid clash with List.Cons;
1999-01-29 paulson 1999-01-29 tidied
1998-11-26 mueller 1998-11-26 tuning to assimiliate it with PhD;
1998-08-12 slotosch 1998-08-12 eliminated fabs,fapp. changed all theorem names and functions into Rep_CFun, Abs_CFun
1998-07-24 berghofe 1998-07-24 Adapted to new datatype package.
1998-06-22 wenzelm 1998-06-22 isatool fixgoal;
1998-04-27 nipkow 1998-04-27 Renamed expand_const -> split_const
1998-03-10 oheimb 1998-03-10 renamed is_chain to chain, is_tord to tord, replaced chain_finite by chfin
1998-03-10 nipkow 1998-03-10 Asm_full_simp_tac now reorients asm c = t to t = c.
1998-03-06 nipkow 1998-03-06 expand_if is now by default part of the simpset.
1997-12-24 paulson 1997-12-24 New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
1997-11-03 wenzelm 1997-11-03 isatool fixclasimp;
1997-10-30 oheimb 1997-10-30 domain package: * minor changes to some names and values (for consistency), e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas
1997-10-30 nipkow 1997-10-30 Removed spurious blank. Updated proof because of HOL change.
1997-10-16 nipkow 1997-10-16 Simplified proof.
1997-10-10 wenzelm 1997-10-10 fixed dots;
1997-09-09 mueller 1997-09-09 adm_tac extended
1997-09-03 mueller 1997-09-03 some minor changes;
1997-07-17 mueller 1997-07-17 changes needed for adding fairness
1997-06-26 nipkow 1997-06-26 amdI -> admI2
1997-06-23 paulson 1997-06-23 Ran expandshort
1997-06-12 mueller 1997-06-12 added deadlock freedom, polished definitions and proofs
1997-05-27 mueller 1997-05-27 Last changes for new release 94-8
1997-05-21 mueller 1997-05-21 changes for release 94-8
1997-04-30 mueller 1997-04-30 New meta theory for IOA based on HOLCF.