Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 04 Jul 2011 14:47:21 +0900] rev 2936
Let with a different invariant; not true.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 03 Jul 2011 21:04:46 +0900] rev 2935
Add non-working Lambda_F_T using FCB2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 03 Jul 2011 21:04:06 +0900] rev 2934
Added non-working CPS3 using FCB2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 03 Jul 2011 21:01:07 +0900] rev 2933
Change CPS1 to FCB2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 02 Jul 2011 12:40:59 +0900] rev 2932
Did the proofs of height and subst for Let with list-like binders. Having apply_assns allows proving things by alpha_bn
Christian Urban <urbanc@in.tum.de> [Sat, 02 Jul 2011 00:27:47 +0100] rev 2931
side-by-side tests of lets with single assignment; deep-binder case works if the recursion is avoided using an auxiliary function
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 01 Jul 2011 17:46:15 +0900] rev 2930
Exhaust Issue
Christian Urban <urbanc@in.tum.de> [Thu, 30 Jun 2011 11:05:25 +0100] rev 2929
clarified a sentence
Christian Urban <urbanc@in.tum.de> [Thu, 30 Jun 2011 02:19:59 +0100] rev 2928
more code refactoring
Christian Urban <urbanc@in.tum.de> [Wed, 29 Jun 2011 23:08:44 +0100] rev 2927
combined distributed data for alpha in alpha_result (partially done)
Christian Urban <urbanc@in.tum.de> [Wed, 29 Jun 2011 19:21:26 +0100] rev 2926
moved Classical and Let temporarily into a section where "sorry" is allowed; this makes all test go through
Christian Urban <urbanc@in.tum.de> [Wed, 29 Jun 2011 17:01:09 +0100] rev 2925
added a warning if a theorem is already declared as equivariant
Christian Urban <urbanc@in.tum.de> [Wed, 29 Jun 2011 16:44:54 +0100] rev 2924
merged
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 29 Jun 2011 13:04:24 +0900] rev 2923
Prove bn injectivity and experiment more with Let
Christian Urban <urbanc@in.tum.de> [Wed, 29 Jun 2011 00:48:50 +0100] rev 2922
some experiments
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:45:30 +0900] rev 2921
trying new fcb in let/subst
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:30:30 +0900] rev 2920
Leftover only inj and eqvt
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:18:26 +0900] rev 2919
eapply fcb ok
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:01:15 +0900] rev 2918
Removed Inl and Inr
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 14:49:48 +0100] rev 2917
relaxed type in fcb
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 14:34:07 +0100] rev 2916
fcb with explicit bn function
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 14:01:52 +0100] rev 2915
added let-rec example
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 12:36:34 +0900] rev 2914
Experiments with res
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 00:48:57 +0100] rev 2913
proved the fcb also for sets (no restriction yet)
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 00:30:30 +0100] rev 2912
copied all work to Lambda.thy; had to derive a special version of fcb1 for concrete atom
Christian Urban <urbanc@in.tum.de> [Mon, 27 Jun 2011 22:51:42 +0100] rev 2911
streamlined the fcb-proof and made fcb1 a special case of fcb
Christian Urban <urbanc@in.tum.de> [Mon, 27 Jun 2011 19:22:10 +0100] rev 2910
completed proof in Classical; the fcb lemma works for any list of atoms (despite what was written earlier)
Christian Urban <urbanc@in.tum.de> [Mon, 27 Jun 2011 19:15:18 +0100] rev 2909
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.
Christian Urban <urbanc@in.tum.de> [Mon, 27 Jun 2011 19:13:55 +0100] rev 2908
renamed ds to dset (disagreement set)
Christian Urban <urbanc@in.tum.de> [Mon, 27 Jun 2011 12:15:21 +0100] rev 2907
added small lemma about disagreement set