src/HOL/Wellfounded.thy
Fri, 17 Apr 2020 20:55:53 +0100 paulson New theory Library/List_Lenlexorder.thy, a type class instantiation for well-ordering lists
Sat, 14 Mar 2020 15:58:51 +0000 paulson tidied up a few little proofs
Tue, 28 Jan 2020 14:59:54 +0000 paulson Tidied up some messy proofs
Mon, 27 Jan 2020 14:32:43 +0000 paulson A few lemmas connected with orderings
Fri, 04 Jan 2019 23:22:53 +0100 wenzelm isabelle update -u control_cartouches;
Sat, 10 Nov 2018 07:57:19 +0000 haftmann clarified status of legacy input abbreviations
Tue, 17 Jul 2018 22:18:27 +0100 paulson more de-applying
Thu, 24 May 2018 16:38:24 +0200 nipkow tuned
Thu, 24 May 2018 07:59:41 +0200 nipkow By Andrei Popescu based on an initial version by Kasper F. Brandt
Wed, 10 Jan 2018 15:25:09 +0100 nipkow ran isabelle update_op on all sources
Mon, 30 Oct 2017 21:52:31 +0100 blanchet added 'mlex_iff' lemma and simplified proof
Wed, 21 Dec 2016 21:26:26 +0100 haftmann dropped aliasses
Sat, 01 Oct 2016 19:30:21 +0200 wenzelm tuned;
Sun, 18 Sep 2016 20:33:48 +0200 wenzelm tuned proofs;
Fri, 05 Aug 2016 18:14:28 +0200 wenzelm misc tuning and modernization;
Sun, 31 Jul 2016 22:56:18 +0200 wenzelm misc tuning and modernization;
Mon, 23 May 2016 12:48:24 +0200 wenzelm proper document source;
Mon, 23 May 2016 12:18:16 +0200 wenzelm misc tuning and modernization;
Tue, 17 May 2016 17:05:35 +0200 eberlm Moved material from AFP/Randomised_Social_Choice to distribution
Thu, 12 May 2016 09:34:07 +0200 haftmann a quasi-recursive characterization of the multiset order (by Christian Sternagel)
Mon, 28 Dec 2015 17:43:30 +0100 wenzelm prefer symbols for "Union", "Inter";
Sun, 27 Dec 2015 22:07:17 +0100 wenzelm discontinued ASCII replacement syntax <*>;
Mon, 07 Dec 2015 10:38:04 +0100 wenzelm isabelle update_cartouches -c -t;
Tue, 13 Oct 2015 09:21:15 +0200 haftmann prod_case as canonical name for product type eliminator
Tue, 06 Oct 2015 15:14:28 +0200 wenzelm fewer aliases for toplevel theorem statements;
Sat, 18 Jul 2015 22:58:50 +0200 wenzelm isabelle update_cartouches;
Wed, 17 Jun 2015 14:35:50 +0100 paulson New WF theorem by Tjark Weber. Replaced the proof of the subsequent theorem.
Mon, 27 Apr 2015 15:02:51 +0200 nipkow new lemma
Wed, 25 Mar 2015 10:44:57 +0100 wenzelm prefer local fixes;
Sun, 02 Nov 2014 18:21:45 +0100 wenzelm modernized header uniformly as section;
Tue, 07 Oct 2014 23:29:43 +0200 wenzelm more bibtex entries;
Wed, 23 Apr 2014 10:23:27 +0200 blanchet move size hooks together, with new one preceding old one and sharing same theory data
Thu, 03 Apr 2014 10:51:22 +0200 blanchet use same idiom as used for datatype 'size' function to name constants and theorems emerging from various type interpretations -- reduces the chances of name clashes on theory merges
Wed, 19 Mar 2014 18:47:22 +0100 haftmann elongated INFI and SUPR, to reduced risk of confusing theorems names in the future while still being consistent with INTER and UNION
Sun, 16 Mar 2014 18:09:04 +0100 haftmann normalising simp rules for compound operators
Thu, 06 Mar 2014 13:36:48 +0100 blanchet renamed 'map_pair' to 'map_prod'
Fri, 17 Jan 2014 10:02:50 +0100 blanchet folded 'Wellfounded_More_FP' into 'Wellfounded'
Sun, 10 Nov 2013 15:05:06 +0100 haftmann qualifed popular user space names
Sat, 20 Oct 2012 09:09:34 +0200 bulwahn adjusting proofs
Wed, 22 Aug 2012 22:55:41 +0200 wenzelm prefer ML_file over old uses;
Tue, 03 Apr 2012 17:26:30 +0900 griff renamed "rel_comp" to "relcomp" (to be consistent with, e.g., "relpow")
Mon, 12 Mar 2012 15:12:22 +0100 noschinl tuned pred_set_conv lemmas. Skipped lemmas changing the lemmas generated by inductive_set
Mon, 12 Mar 2012 15:11:24 +0100 noschinl tuned simpset
Fri, 24 Feb 2012 22:46:44 +0100 haftmann moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
Fri, 24 Feb 2012 09:40:02 +0100 haftmann given up disfruitful branch
Thu, 23 Feb 2012 21:25:59 +0100 haftmann moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
Mon, 30 Jan 2012 13:55:19 +0100 bulwahn adding code_unfold to make measure executable
Sat, 28 Jan 2012 06:13:03 +0100 bulwahn reverting 46c2c96f5d92 as it only provides mostly non-terminating executions for generated code
Wed, 25 Jan 2012 16:07:48 +0100 bulwahn adding very basic code generation to Wellfounded theory
Tue, 10 Jan 2012 18:12:55 +0100 berghofe pred_subset_eq and SUP_UN_eq2 are now standard pred_set_conv rules
Sat, 24 Dec 2011 15:53:10 +0100 haftmann adjusted to set/pred distinction by means of type constructor `set`
Thu, 13 Oct 2011 23:02:59 +0200 haftmann moved acyclic predicate up in hierarchy
Thu, 13 Oct 2011 22:56:19 +0200 haftmann modernized definitions
Tue, 20 Sep 2011 21:47:52 +0200 haftmann tuned specification and lemma distribution among theories; tuned proofs
Thu, 15 Sep 2011 12:40:08 -0400 hoelzl removed further legacy rules from Complete_Lattices
Tue, 13 Sep 2011 17:07:33 -0700 huffman tuned proofs
Thu, 11 Aug 2011 09:15:45 +0200 krauss removed unused material, which does not really belong here
Wed, 01 Jun 2011 15:53:47 +0200 nipkow tuned lemmas
Wed, 01 Jun 2011 11:51:25 +0200 nipkow new lemmas
Tue, 08 Feb 2011 07:42:08 +0100 nipkow added termination lemmas
less more (0) -60 tip