Christian Urban <urbanc@in.tum.de> [Thu, 07 Jul 2011 16:17:03 +0200] rev 2958
merged
Christian Urban <urbanc@in.tum.de> [Thu, 07 Jul 2011 16:16:42 +0200] rev 2957
code refactoring; introduced a record for raw_dt_info
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 23:11:30 +0200] rev 2956
more on NBE
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 15:59:11 +0200] rev 2955
more on the NBE function
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 01:04:09 +0200] rev 2954
a little further with NBE
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 06 Jul 2011 07:42:12 +0900] rev 2953
Setup eqvt_at for first goal
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 00:34:42 +0200] rev 2952
attempt for NBE
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 23:47:20 +0200] rev 2951
added some relatively simple examples from paper by Norrish
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 18:42:34 +0200] rev 2950
changed bind to binds in specifications; bind will cause trouble with Monad_Syntax
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 18:01:54 +0200] rev 2949
side commment for future use
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 16:22:18 +0200] rev 2948
made the tests go through again
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 15:01:10 +0200] rev 2947
added another example which seems difficult to define
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 15:00:41 +0200] rev 2946
added a tactic "all_trivials" which simplifies all trivial constructor cases and leaves the others untouched.
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 04:23:33 +0200] rev 2945
merged
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 04:19:02 +0200] rev 2944
all FCB lemmas
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 04:18:45 +0200] rev 2943
exported various FCB-lemmas to a separate file
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 05 Jul 2011 10:13:34 +0900] rev 2942
Express trans_db with Option.map and Option.bind. Possibly mbind is a copy of bind?
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 05 Jul 2011 09:28:16 +0900] rev 2941
Define a version of aux only for same binders. Completeness is fine.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 05 Jul 2011 09:26:20 +0900] rev 2940
Move If / Let with 'True' to the end of Lambda
Christian Urban <urbanc@in.tum.de> [Mon, 04 Jul 2011 23:56:19 +0200] rev 2939
merged
Christian Urban <urbanc@in.tum.de> [Mon, 04 Jul 2011 23:55:46 +0200] rev 2938
tuned
Christian Urban <urbanc@in.tum.de> [Mon, 04 Jul 2011 23:54:05 +0200] rev 2937
added an example that recurses over two arguments; the interesting proof-obligation is not yet done
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
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)
Christian Urban <urbanc@in.tum.de> [Sun, 26 Jun 2011 17:55:22 +0100] rev 2902
another change to the fcb2; this is needed in order to get all proofs through in Lambda.thy
Christian Urban <urbanc@in.tum.de> [Sat, 25 Jun 2011 22:51:43 +0100] rev 2901
did all cases, except the multiple binder case
Christian Urban <urbanc@in.tum.de> [Sat, 25 Jun 2011 21:28:24 +0100] rev 2900
an alternative FCB for Abs_lst1; seems simpler but not as simple as I thought; not sure whether it generalises to multiple binders.
Christian Urban <urbanc@in.tum.de> [Fri, 24 Jun 2011 09:42:44 +0100] rev 2899
except for the interated binder case, finished definition in Calssical.thy