src/HOLCF/Porder.thy
2010-10-11 huffman 2010-10-11 remove unused constant 'directed'
2010-10-04 huffman 2010-10-04 new lemmas about lub
2010-10-04 huffman 2010-10-04 define is_ub predicate using bounded quantifier
2009-05-08 huffman 2009-05-08 rename constant sq_le to below; rename class sq_ord to below; less->below in many lemma names
2009-05-08 haftmann 2009-05-08 localized (complete) partial order classes
2009-01-21 haftmann 2009-01-21 no base sort in class import
2008-12-16 huffman 2008-12-16 remove cvs Id tags
2008-06-22 huffman 2008-06-22 cleaned up some proofs; removed unused stuff about totally-ordered sets; import Main
2008-06-20 huffman 2008-06-20 tuned
2008-06-18 huffman 2008-06-18 replace preorder class with locale
2008-03-27 huffman 2008-03-27 make preorder locale into a superclass of class po
2008-01-17 huffman 2008-01-17 rename lemma chain_mono3 -> chain_mono, chain_mono -> chain_mono_less
2008-01-14 huffman 2008-01-14 use new-style class for po
2008-01-10 huffman 2008-01-10 new lemmas max_in_chainI, max_in_chainD
2008-01-04 huffman 2008-01-04 cleaned up some proofs
2008-01-04 huffman 2008-01-04 add new is_ub lemmas; clean up directed_finite proofs
2008-01-03 huffman 2008-01-03 add lub_maximal lemmas; modify conclusion of directed_finiteD; declare not_directed_empty [simp]
2008-01-02 huffman 2008-01-02 added new lemmas
2008-01-02 huffman 2008-01-02 new is_ub lemmas; new lub syntax for set image
2008-01-02 huffman 2008-01-02 new section for directed sets
2007-12-18 huffman 2007-12-18 rearrange into subsections
2007-10-21 wenzelm 2007-10-21 modernized specifications ('definition', 'abbreviation', 'notation');
2007-09-26 haftmann 2007-09-26 moved Finite_Set before Datatype
2007-06-06 huffman 2007-06-06 use new-style class for sq_ord; rename op << to sq_le
2006-11-26 wenzelm 2006-11-26 updated (binder) syntax/notation;
2006-09-28 wenzelm 2006-09-28 fixed translations: CONST;
2006-05-12 huffman 2006-05-12 add new finite chain theorems
2006-02-19 huffman 2006-02-19 use minimal imports
2006-01-11 huffman 2006-01-11 add transitivity rules
2005-11-04 huffman 2005-11-04 cleaned up
2005-11-03 huffman 2005-11-03 cleaned up; chain_const and thelub_const are simp rules
2005-10-10 huffman 2005-10-10 cleaned up; renamed "Porder.op <<" to "Porder.<<"
2005-09-13 huffman 2005-09-13 add theorem chain_const
2005-06-08 huffman 2005-06-08 added theorems is_ub_range_shift and is_lub_range_shift
2005-05-27 huffman 2005-05-27 added lemma thelub_const
2005-05-25 wenzelm 2005-05-25 removed LICENCE note -- everything is subject to Isabelle licence as stated in COPYRIGHT file;
2005-05-06 huffman 2005-05-06 Replaced all unnecessary uses of SOME with THE or LEAST
2005-03-10 huffman 2005-03-10 fixed filename in header
2005-03-07 huffman 2005-03-07 added subsections and text for document generation
2005-03-04 huffman 2005-03-04 fix headers
2005-03-04 huffman 2005-03-04 converted to new-style theories, and combined numbered files
2005-03-02 huffman 2005-03-02 converted to new-style theory
2004-06-21 kleing 2004-06-21 Merged in license change from Isabelle2004
2001-12-01 wenzelm 2001-12-01 renamed class "term" to "type" (actually "HOL.type");
2001-11-09 wenzelm 2001-11-09 eliminated old "symbols" syntax, use "xsymbols" instead;
2001-11-03 wenzelm 2001-11-03 GPLed;
2001-05-31 oheimb 2001-05-31 corrected ML names of definitions
1998-03-10 oheimb 1998-03-10 renamed is_chain to chain, is_tord to tord, replaced chain_finite by chfin
1997-10-10 wenzelm 1997-10-10 fixed dots;
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-12-13 oheimb 1996-12-13 adaptions for symbol font
1996-12-02 oheimb 1996-12-02 removed 8bit sections
1996-11-29 oheimb 1996-11-29 *** empty log message ***
1996-02-06 clasohm 1996-02-06 expanded tabs
1995-10-06 regensbu 1995-10-06 added 8bit pragmas added directory ax_ops for sections axioms and ops added directory domain for sections domain and generated this is the type definition package of David Oheimb
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
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.