src/HOL/Nominal/Examples/Crary.thy
Fri, 19 Oct 2007 23:21:08 +0200 wenzelm tuned proofs: avoid implicit prems;
Sun, 12 Aug 2007 18:53:03 +0200 wenzelm added type constraints to resolve syntax ambiguities;
Tue, 31 Jul 2007 14:45:36 +0200 narboux undo a change in last commit : give a single name to the inversion lemmas for the same inductive type
Mon, 30 Jul 2007 10:39:12 +0200 urbanc updated some of the definitions and proofs
Wed, 11 Jul 2007 11:36:06 +0200 berghofe Renamed inductive2 to inductive.
Thu, 21 Jun 2007 13:49:27 +0200 narboux fine tune automatic generation of inversion lemmas
Thu, 14 Jun 2007 23:04:36 +0200 wenzelm tuned proofs: avoid implicit prems;
Wed, 13 Jun 2007 12:22:02 +0200 urbanc added the Q_Unit rule (was missing) and adjusted the proof accordingly
Wed, 02 May 2007 01:42:23 +0200 urbanc tuned some proofs and changed variable names in some definitions of Nominal.thy
Thu, 19 Apr 2007 16:38:59 +0200 berghofe nominal_inductive no longer proves equivariance.
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:05:25 +0200 narboux perm_simp can now simplify using the rules (a,b) o a = b and (a,b) o b = a
Wed, 04 Apr 2007 19:56:25 +0200 narboux add a few details in the Fst and Snd cases of unicity proof
Wed, 28 Mar 2007 19:16:11 +0200 berghofe - Renamed <predicate>_eqvt to <predicate>.eqvt
Wed, 28 Mar 2007 01:55:18 +0200 urbanc tuned proofs (taking full advantage of nominal_inductive)
Tue, 27 Mar 2007 17:57:05 +0200 berghofe Adapted to changes in nominal_inductive.
Thu, 22 Mar 2007 16:34:03 +0100 krauss fixed function syntax
Thu, 22 Mar 2007 10:35:12 +0100 urbanc tuned some proofs
Wed, 21 Mar 2007 16:06:15 +0100 krauss Unified function syntax
Tue, 06 Mar 2007 16:40:32 +0100 narboux correct typo in latex output
Tue, 06 Mar 2007 15:28:22 +0100 urbanc major update of the nominal package; there is now an infrastructure
Fri, 02 Feb 2007 17:16:16 +0100 urbanc added an infrastructure that allows the user to declare lemmas to be equivariance lemmas; the intention is to use these lemmas in automated tools but also can be employed by the user
Wed, 17 Jan 2007 19:29:55 +0100 urbanc tuned a bit the proofs
Tue, 16 Jan 2007 13:59:08 +0100 urbanc formalisation of Crary's chapter on logical relations
less more (0) tip