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
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 27 Jun 2011 08:42:02 +0900] rev 2906
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 27 Jun 2011 08:38:54 +0900] rev 2905
New-style fcb for multiple binders.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 27 Jun 2011 04:01:55 +0900] rev 2904
equality of lst_binder and a few helper lemmas
[l]lst. T = [l]lst. S <-> T = S
Christian Urban <urbanc@in.tum.de> [Sun, 26 Jun 2011 21:42:07 +0100] rev 2903
only one of the fcb precondistions are needed (probably the same with the perm-conditions)