Nominal/Ex/Classical.thy
Mon, 19 May 2014 16:45:46 +0100 Christian Urban changed nominal_primrec to nominal_function and termination to nominal_termination
Mon, 19 May 2014 12:45:26 +0100 Christian Urban changed nominal_primrec into the more appropriate nominal_function
Tue, 07 Aug 2012 18:54:52 +0100 Christian Urban definition of an auxiliary graph in nominal-primrec definitions
Sun, 15 Jul 2012 13:03:47 +0100 Christian Urban added a simproc for alpha-equivalence to the simplifier
Mon, 04 Jun 2012 21:39:51 +0100 Christian Urban added permutation simplification to the simplifier; this makes the simplifier more powerful, but it potentially loops more often
Sat, 17 Dec 2011 17:08:47 +0000 Christian Urban cleaned examples for stable branch Nominal2-Isabelle2011-1
Tue, 19 Jul 2011 02:30:05 +0100 Christian Urban preliminary version of automatically generation the eqvt-lemmas for functions defined with nominal_primrec
Mon, 18 Jul 2011 17:40:13 +0100 Christian Urban added a flag (eqvt) to termination proofs arising fron nominal_primrecs
Tue, 05 Jul 2011 18:42:34 +0200 Christian Urban changed bind to binds in specifications; bind will cause trouble with Monad_Syntax
Tue, 05 Jul 2011 15:01:10 +0200 Christian Urban added another example which seems difficult to define
Tue, 05 Jul 2011 04:18:45 +0200 Christian Urban exported various FCB-lemmas to a separate file
Wed, 29 Jun 2011 19:21:26 +0100 Christian Urban moved Classical and Let temporarily into a section where "sorry" is allowed; this makes all test go through
Tue, 28 Jun 2011 12:36:34 +0900 Cezary Kaliszyk Experiments with res
Tue, 28 Jun 2011 00:48:57 +0100 Christian Urban proved the fcb also for sets (no restriction yet)
Mon, 27 Jun 2011 22:51:42 +0100 Christian Urban streamlined the fcb-proof and made fcb1 a special case of fcb
Mon, 27 Jun 2011 19:22:10 +0100 Christian Urban completed proof in Classical; the fcb lemma works for any list of atoms (despite what was written earlier)
Mon, 27 Jun 2011 19:15:18 +0100 Christian Urban fcb for multible (list) binders; at the moment all of them have to have the same sort (at-class); this should also work for set binders, but not yet for restriction.
Mon, 27 Jun 2011 04:01:55 +0900 Cezary Kaliszyk equality of lst_binder and a few helper lemmas
Sun, 26 Jun 2011 21:42:07 +0100 Christian Urban only one of the fcb precondistions are needed (probably the same with the perm-conditions)
Sun, 26 Jun 2011 17:55:22 +0100 Christian Urban another change to the fcb2; this is needed in order to get all proofs through in Lambda.thy
Sat, 25 Jun 2011 22:51:43 +0100 Christian Urban did all cases, except the multiple binder case
Sat, 25 Jun 2011 21:28:24 +0100 Christian Urban an alternative FCB for Abs_lst1; seems simpler but not as simple as I thought; not sure whether it generalises to multiple binders.
Fri, 24 Jun 2011 09:42:44 +0100 Christian Urban except for the interated binder case, finished definition in Calssical.thy
Fri, 24 Jun 2011 10:12:47 +0900 Cezary Kaliszyk Speed-up the completeness proof.
Thu, 23 Jun 2011 22:21:43 +0100 Christian Urban the simplifier can simplify "sort (atom a)" if a is a concrete atom type declared with atom_decl
Thu, 23 Jun 2011 12:28:25 +0100 Christian Urban expanded the example
Wed, 22 Dec 2010 09:13:25 +0000 Christian Urban properly exported strong exhaust theorem; cleaned up some examples
Sun, 29 Aug 2010 13:36:03 +0800 Christian Urban renamed NewParser to Nominal2
Thu, 26 Aug 2010 02:08:00 +0800 Christian Urban cleaned up (almost completely) the examples
Wed, 25 Aug 2010 22:55:42 +0800 Christian Urban automatic lifting
less more (0) -30 tip