src/HOL/Nominal/Nominal.thy
Tue, 07 Sep 2010 10:05:19 +0200 nipkow expand_fun_eq -> ext_iff
Mon, 01 Mar 2010 13:42:31 +0100 haftmann merged
Mon, 01 Mar 2010 13:40:23 +0100 haftmann replaced a couple of constsdefs by definitions (also some old primrecs by modern ones)
Wed, 24 Feb 2010 21:59:21 +0100 wenzelm proper type syntax (cf. 7425aece4ee3);
Sat, 17 Oct 2009 14:43:18 +0200 wenzelm eliminated hard tabulators, guessing at each author's individual tab-width;
Mon, 21 Sep 2009 15:02:23 +0200 Christian Urban tuned some proofs
Fri, 03 Jul 2009 16:51:08 +0200 haftmann nominal.ML is nominal_datatype.ML
Fri, 19 Jun 2009 17:23:21 +0200 haftmann discontinued ancient tradition to suffix certain ML module names with "_package"
Sun, 26 Apr 2009 23:16:24 +0200 Christian Urban reorganised the section about fresh_star and added lemma pt_fresh_star_pi
Sat, 25 Apr 2009 21:42:05 +0200 Christian Urban adapted permutation functions to new overloading syntax (the functions are still "unchecked" because they are used in conjunction with type-classes)
Wed, 04 Mar 2009 11:05:29 +0100 blanchet Merge.
Wed, 04 Mar 2009 10:45:52 +0100 blanchet Merge.
Thu, 26 Feb 2009 16:34:03 +0100 berghofe Added postprocessing rules for fresh_star.
Wed, 25 Feb 2009 19:34:00 +0100 berghofe Added lemmas for normalizing freshness results involving fresh_star.
Wed, 25 Feb 2009 11:02:25 +0100 berghofe Added equivariance lemmas for fresh_star.
Sat, 14 Feb 2009 08:45:16 +0100 nipkow more finiteness changes
Tue, 16 Dec 2008 20:32:41 +0000 Christian Urban changed the names of insert_eqvt and set_eqvt so that it is clear that they have preconditions
Thu, 04 Dec 2008 14:43:33 +0100 haftmann cleaned up binding module and related code
Tue, 21 Oct 2008 21:18:54 +0200 berghofe Added nominal_inductive2.ML
Fri, 26 Sep 2008 14:51:27 +0200 berghofe Added some more lemmas that are useful in proof of strong induction rule.
Mon, 22 Sep 2008 19:46:24 +0200 urbanc made the perm_simp tactic to understand options such as (no_asm)
Wed, 27 Aug 2008 04:47:30 +0200 urbanc added equivariance lemmas for ex1 and the
Sun, 27 Jul 2008 20:08:16 +0200 urbanc simplified a proof
Fri, 27 Jun 2008 00:37:30 +0200 urbanc added a lemma to at_swap_simps
Mon, 16 Jun 2008 17:54:39 +0200 wenzelm allE_Nil: only one copy, proven in regular theory source;
Thu, 08 May 2008 04:20:08 +0200 urbanc added at_set_avoiding lemmas
Wed, 07 May 2008 10:57:19 +0200 berghofe Adapted to encoding of sets as predicates
Fri, 02 May 2008 22:43:14 +0200 urbanc added more infrastructure for fresh_star
Fri, 02 May 2008 16:32:51 +0200 urbanc polished the proof for atm_prm_fresh and more lemmas for fresh_star
Thu, 03 Apr 2008 11:48:48 +0200 urbanc added generalised definitions for freshness of sets of atoms
Wed, 19 Mar 2008 22:50:42 +0100 wenzelm more antiquotations;
Mon, 18 Feb 2008 03:12:08 +0100 urbanc added eqvt-flag to subseteq-lemma
Thu, 24 Jan 2008 11:23:11 +0100 berghofe Added lemma at_fin_set_fresh.
Fri, 14 Sep 2007 13:32:07 +0200 urbanc reverted back to the old version of the equivariance lemma for ALL
Thu, 13 Sep 2007 23:58:38 +0200 urbanc some cleaning up to do with contexts
Thu, 13 Sep 2007 18:06:50 +0200 berghofe Added equivariance lemma for induct_implies.
Thu, 06 Sep 2007 16:28:42 +0200 urbanc trivial cleaning up
Wed, 11 Jul 2007 11:28:13 +0200 berghofe Adapted to new inductive definition package.
Thu, 14 Jun 2007 23:04:36 +0200 wenzelm tuned proofs: avoid implicit prems;
Thu, 31 May 2007 15:23:35 +0200 urbanc tuned the proof
Thu, 31 May 2007 14:47:20 +0200 urbanc introduced symmetric variants of the lemmas for alpha-equivalence
Sun, 20 May 2007 13:39:46 +0200 urbanc added lemma for permutations on strings
Mon, 07 May 2007 00:49:59 +0200 wenzelm simplified DataFun interfaces;
Thu, 03 May 2007 17:54:36 +0200 urbanc tuned some of the proofs and added the lemma fresh_bool
Wed, 02 May 2007 01:42:23 +0200 urbanc tuned some proofs and changed variable names in some definitions of Nominal.thy
Thu, 26 Apr 2007 14:24:08 +0200 wenzelm eliminated unnamed infixes, tuned syntax;
Tue, 24 Apr 2007 17:16:55 +0200 narboux fixes last commit
Tue, 24 Apr 2007 16:44:11 +0200 narboux add two lemmas dealing with freshness on permutations.
Tue, 24 Apr 2007 14:02:16 +0200 narboux oups : wrong commit
Tue, 24 Apr 2007 14:01:23 +0200 narboux adds op in front of an infix to fix SML compilation
Mon, 23 Apr 2007 18:38:42 +0200 urbanc simplified the proof of pt_set_eqvt (as suggested by Randy Pollack)
Sat, 21 Apr 2007 01:34:15 +0200 urbanc tuned the setup of fresh_fun
Fri, 20 Apr 2007 00:28:07 +0200 urbanc declared lemmas true_eqvt and false_eqvt to be equivariant (suggested by samth at ccs.neu.edu)
Thu, 19 Apr 2007 16:27:53 +0200 narboux add a tactic to generate fresh names
Mon, 16 Apr 2007 07:32:23 +0200 urbanc improved the equivariance lemmas for the quantifiers; had to export the lemma eqvt_force_add and eqvt_force_del in the thmdecls
Mon, 16 Apr 2007 06:45:22 +0200 urbanc added a more usuable lemma for dealing with fresh_fun
Thu, 12 Apr 2007 15:46:12 +0200 urbanc tuned the proof of lemma pt_list_set_fresh (as suggested by Randy Pollack) and tuned the syntax for sub_contexts
Sat, 07 Apr 2007 11:36:35 +0200 urbanc tuned slightly the previous commit
Sat, 07 Apr 2007 11:05:25 +0200 narboux perm_simp can now simplify using the rules (a,b) o a = b and (a,b) o b = a
Tue, 03 Apr 2007 17:05:52 +0200 narboux remove the lemma swap_fun which was not needed
less more (0) -100 -60 tip