Tue, 28 Jun 2011 14:45:30 +0900 trying new fcb in let/subst
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:45:30 +0900] rev 2921
trying new fcb in let/subst
Tue, 28 Jun 2011 14:30:30 +0900 Leftover only inj and eqvt
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:30:30 +0900] rev 2920
Leftover only inj and eqvt
Tue, 28 Jun 2011 14:18:26 +0900 eapply fcb ok
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:18:26 +0900] rev 2919
eapply fcb ok
Tue, 28 Jun 2011 14:01:15 +0900 Removed Inl and Inr
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:01:15 +0900] rev 2918
Removed Inl and Inr
Tue, 28 Jun 2011 14:49:48 +0100 relaxed type in fcb
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 14:49:48 +0100] rev 2917
relaxed type in fcb
Tue, 28 Jun 2011 14:34:07 +0100 fcb with explicit bn function
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 14:34:07 +0100] rev 2916
fcb with explicit bn function
Tue, 28 Jun 2011 14:01:52 +0100 added let-rec example
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 14:01:52 +0100] rev 2915
added let-rec example
Tue, 28 Jun 2011 12:36:34 +0900 Experiments with res
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 12:36:34 +0900] rev 2914
Experiments with res
Tue, 28 Jun 2011 00:48:57 +0100 proved the fcb also for sets (no restriction yet)
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)
Tue, 28 Jun 2011 00:30:30 +0100 copied all work to Lambda.thy; had to derive a special version of fcb1 for concrete atom
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
Mon, 27 Jun 2011 22:51:42 +0100 streamlined the fcb-proof and made fcb1 a special case of fcb
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
Mon, 27 Jun 2011 19:22:10 +0100 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:22:10 +0100] rev 2910
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 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: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.
Mon, 27 Jun 2011 19:13:55 +0100 renamed ds to dset (disagreement set)
Christian Urban <urbanc@in.tum.de> [Mon, 27 Jun 2011 19:13:55 +0100] rev 2908
renamed ds to dset (disagreement set)
Mon, 27 Jun 2011 12:15:21 +0100 added small lemma about disagreement set
Christian Urban <urbanc@in.tum.de> [Mon, 27 Jun 2011 12:15:21 +0100] rev 2907
added small lemma about disagreement set
Mon, 27 Jun 2011 08:42:02 +0900 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 27 Jun 2011 08:42:02 +0900] rev 2906
merge
Mon, 27 Jun 2011 08:38:54 +0900 New-style fcb for multiple binders.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 27 Jun 2011 08:38:54 +0900] rev 2905
New-style fcb for multiple binders.
Mon, 27 Jun 2011 04:01:55 +0900 equality of lst_binder and a few helper lemmas
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
Sun, 26 Jun 2011 21:42:07 +0100 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 21:42:07 +0100] rev 2903
only one of the fcb precondistions are needed (probably the same with the perm-conditions)
Sun, 26 Jun 2011 17:55:22 +0100 another change to the fcb2; this is needed in order to get all proofs through in Lambda.thy
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
Sat, 25 Jun 2011 22:51:43 +0100 did all cases, except the multiple binder case
Christian Urban <urbanc@in.tum.de> [Sat, 25 Jun 2011 22:51:43 +0100] rev 2901
did all cases, except the multiple binder case
Sat, 25 Jun 2011 21:28:24 +0100 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> [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.
Fri, 24 Jun 2011 09:42:44 +0100 except for the interated binder case, finished definition in Calssical.thy
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
Fri, 24 Jun 2011 11:18:18 +0900 Make examples work with non-precompiled image
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 24 Jun 2011 11:18:18 +0900] rev 2898
Make examples work with non-precompiled image
Fri, 24 Jun 2011 11:15:22 +0900 Remove Lambda_add.thy
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 24 Jun 2011 11:15:22 +0900] rev 2897
Remove Lambda_add.thy
Fri, 24 Jun 2011 11:14:58 +0900 The examples in Lambda_add can be defined by nominal_function directly
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 24 Jun 2011 11:14:58 +0900] rev 2896
The examples in Lambda_add can be defined by nominal_function directly
Fri, 24 Jun 2011 11:03:53 +0900 Theory name changes for JEdit
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 24 Jun 2011 11:03:53 +0900] rev 2895
Theory name changes for JEdit
Fri, 24 Jun 2011 10:54:31 +0900 More usual names for substitution properties
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 24 Jun 2011 10:54:31 +0900] rev 2894
More usual names for substitution properties
Fri, 24 Jun 2011 10:30:06 +0900 Second Fixed Point Theorem
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 24 Jun 2011 10:30:06 +0900] rev 2893
Second Fixed Point Theorem
Fri, 24 Jun 2011 10:12:47 +0900 Speed-up the completeness proof.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 24 Jun 2011 10:12:47 +0900] rev 2892
Speed-up the completeness proof.
Thu, 23 Jun 2011 22:21:43 +0100 the simplifier can simplify "sort (atom a)" if a is a concrete atom type declared with atom_decl
Christian Urban <urbanc@in.tum.de> [Thu, 23 Jun 2011 22:21:43 +0100] rev 2891
the simplifier can simplify "sort (atom a)" if a is a concrete atom type declared with atom_decl
Thu, 23 Jun 2011 13:09:17 +0100 added file
Christian Urban <urbanc@in.tum.de> [Thu, 23 Jun 2011 13:09:17 +0100] rev 2890
added file
Thu, 23 Jun 2011 12:28:25 +0100 expanded the example
Christian Urban <urbanc@in.tum.de> [Thu, 23 Jun 2011 12:28:25 +0100] rev 2889
expanded the example
Thu, 23 Jun 2011 11:30:39 +0100 fixed nasty bug with type variables in nominal_datatypes; this included to be careful with the output of the inductive and function package
Christian Urban <urbanc@in.tum.de> [Thu, 23 Jun 2011 11:30:39 +0100] rev 2888
fixed nasty bug with type variables in nominal_datatypes; this included to be careful with the output of the inductive and function package
Wed, 22 Jun 2011 14:14:54 +0100 tuned
Christian Urban <urbanc@in.tum.de> [Wed, 22 Jun 2011 14:14:54 +0100] rev 2887
tuned
Wed, 22 Jun 2011 13:40:25 +0100 deleted some dead code
Christian Urban <urbanc@in.tum.de> [Wed, 22 Jun 2011 13:40:25 +0100] rev 2886
deleted some dead code
Wed, 22 Jun 2011 12:18:22 +0100 some rudimentary infrastructure for storing data about nominal datatypes
Christian Urban <urbanc@in.tum.de> [Wed, 22 Jun 2011 12:18:22 +0100] rev 2885
some rudimentary infrastructure for storing data about nominal datatypes
Wed, 22 Jun 2011 17:57:15 +0900 constants with the same names
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 22 Jun 2011 17:57:15 +0900] rev 2884
constants with the same names
Wed, 22 Jun 2011 04:49:56 +0900 Quotients/TODO addtion
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 22 Jun 2011 04:49:56 +0900] rev 2883
Quotients/TODO addtion
Tue, 21 Jun 2011 23:59:36 +0900 Minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 21 Jun 2011 23:59:36 +0900] rev 2882
Minor
Tue, 21 Jun 2011 10:39:25 +0900 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 21 Jun 2011 10:39:25 +0900] rev 2881
merge
Tue, 21 Jun 2011 10:37:43 +0900 spelling
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 21 Jun 2011 10:37:43 +0900] rev 2880
spelling
Mon, 20 Jun 2011 20:09:51 +0900 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 20:09:51 +0900] rev 2879
merge
Mon, 20 Jun 2011 20:08:16 +0900 Abs_set_fcb
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 20:08:16 +0900] rev 2878
Abs_set_fcb
Mon, 20 Jun 2011 20:09:30 +0900 function for let-rec
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 20:09:30 +0900] rev 2877
function for let-rec
Mon, 20 Jun 2011 10:16:12 +0900 TODO/minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 10:16:12 +0900] rev 2876
TODO/minor
Mon, 20 Jun 2011 09:59:18 +0900 Move lst_fcb to Nominal2_Abs
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 09:59:18 +0900] rev 2875
Move lst_fcb to Nominal2_Abs
Mon, 20 Jun 2011 09:38:57 +0900 More minor TODOs
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 09:38:57 +0900] rev 2874
More minor TODOs
Mon, 20 Jun 2011 09:36:16 +0900 Update TODO
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 09:36:16 +0900] rev 2873
Update TODO
Mon, 20 Jun 2011 09:29:42 +0900 Let/minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 09:29:42 +0900] rev 2872
Let/minor
Mon, 20 Jun 2011 08:50:13 +0900 Update Quotient/TODO and remove some attic code
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 08:50:13 +0900] rev 2871
Update Quotient/TODO and remove some attic code
Sun, 19 Jun 2011 13:14:37 +0900 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 19 Jun 2011 13:14:37 +0900] rev 2870
merge
Sun, 19 Jun 2011 13:10:15 +0900 little on cps2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 19 Jun 2011 13:10:15 +0900] rev 2869
little on cps2
Thu, 16 Jun 2011 20:07:03 +0100 got rid of the boolean flag in the raw_equivariance function
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 20:07:03 +0100] rev 2868
got rid of the boolean flag in the raw_equivariance function
Thu, 16 Jun 2011 23:11:50 +0900 Fix
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 23:11:50 +0900] rev 2867
Fix
Thu, 16 Jun 2011 22:00:52 +0900 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 22:00:52 +0900] rev 2866
merge
Thu, 16 Jun 2011 21:23:38 +0900 CPS3 can be defined with eqvt_rhs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 21:23:38 +0900] rev 2865
CPS3 can be defined with eqvt_rhs.
Thu, 16 Jun 2011 13:32:36 +0100 moved for the moment CPS translations into the example directory
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 13:32:36 +0100] rev 2864
moved for the moment CPS translations into the example directory
Thu, 16 Jun 2011 13:14:53 +0100 merged
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 13:14:53 +0100] rev 2863
merged
Thu, 16 Jun 2011 13:14:16 +0100 added eqvt_at and invariant for boths sides of the equations
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 13:14:16 +0100] rev 2862
added eqvt_at and invariant for boths sides of the equations
(0) -1000 -300 -100 -60 +60 +100 +300 tip