src/HOLCF/Porder.ML
1998-07-24 berghofe 1998-07-24 Adapted to new datatype package.
1998-06-22 wenzelm 1998-06-22 isatool fixgoal;
1998-03-10 oheimb 1998-03-10 renamed is_chain to chain, is_tord to tord, replaced chain_finite by chfin
1997-11-03 wenzelm 1997-11-03 isatool fixclasimp;
1997-10-29 wenzelm 1997-10-29 fixed spaces in qed;
1997-10-10 wenzelm 1997-10-10 fixed dots;
1997-09-29 paulson 1997-09-29 Step_tac -> Safe_tac
1997-04-24 slotosch 1997-04-24 moved antisym_less_inverse,box_less from Porder.ML to Porder0.ML
1997-04-23 paulson 1997-04-23 Ran expandshort
1997-03-26 nipkow 1997-03-26 Added "discrete" CPOs and modified IMP to use those rather than "lift"
1997-02-17 slotosch 1997-02-17 Changes of HOLCF from Oscar Slotosch: 1. axclass instead of class * less instead of less_fun, less_cfun, less_sprod, less_cprod, less_ssum, less_up, less_lift * @x.!y.x<<y instead of UUU instead of UU_fun, UU_cfun, ... * no witness type void needed (eliminated Void.thy.Void.ML) * inst_<typ>_<class> derived as theorems 2. improved some proves on less_sprod and less_cprod * eliminated the following theorems Sprod1.ML: less_sprod1a Sprod1.ML: less_sprod1b Sprod1.ML: less_sprod2a Sprod1.ML: less_sprod2b Sprod1.ML: less_sprod2c Sprod2.ML: less_sprod3a Sprod2.ML: less_sprod3b Sprod2.ML: less_sprod4b Sprod2.ML: less_sprod4c Sprod3.ML: less_sprod5b Sprod3.ML: less_sprod5c Cprod1.ML: less_cprod1b Cprod1.ML: less_cprod2a Cprod1.ML: less_cprod2b Cprod1.ML: less_cprod2c Cprod2.ML: less_cprod3a Cprod2.ML: less_cprod3b 3. new classes: * cpo<po, * chfin<pcpo, * flat<pcpo, * derived: flat<chfin to do: show instances for lift 4. Data Type One * Used lift for the definition: one = unit lift * Changed the constant one into ONE 5. Data Type Tr * Used lift for the definition: tr = bool lift * adopted definitions of if,andalso,orelse,neg * only one theory Tr.thy,Tr.ML instead of Tr1.thy,Tr1.ML, Tr2.thy,Tr2.ML * reintroduced ceils for =TT,=FF 6. typedef * Using typedef instead of faking type definitions to do: change fapp, fabs from Cfun1 to Rep_Cfun, Abs_Cfun 7. adopted examples and domain construct to theses changes These changes eliminated all rules and arities from HOLCF
1996-09-26 paulson 1996-09-26 Ran expandshort; used stac instead of ssubst
1996-07-26 paulson 1996-07-26 Redefining "range" as a macro -- new proof needed
1996-05-31 oheimb 1996-05-31 introduced forgotten bind_thm calls
1996-04-23 oheimb 1996-04-23 adapted several proofs
1996-01-30 clasohm 1996-01-30 expanded tabs
1995-10-04 clasohm 1995-10-04 added local simpsets
1995-06-29 regensbu 1995-06-29 The curried version of HOLCF is now just called HOLCF. The old uncurried version is no longer supported
1995-04-13 regensbu 1995-04-13 adjusted HOLCF for new hyp_subst_tac
1995-02-07 clasohm 1995-02-07 added qed, qed_goal[w]
1994-10-06 nipkow 1994-10-06 New version
1994-06-29 clasohm 1994-06-29 added parentheses made necessary by change of constrain's precedence
1994-03-24 nipkow 1994-03-24 Franz fragen
1994-01-19 nipkow 1994-01-19 Franz Regensburger's Higher-Order Logic of Computable Functions embedding LCF in HOL.