2011-08-15 updated for new Isabelle (11. Aug.)
Christian Urban <urbanc@in.tum.de> [Mon, 15 Aug 2011 10:43:22 +0200] rev 2987
updated for new Isabelle (11. Aug.)
2011-08-14 merged
Christian Urban <urbanc@in.tum.de> [Sun, 14 Aug 2011 08:52:03 +0200] rev 2986
merged
2011-08-12 started lmcs paper (isabelle make lmcs)
Christian Urban <urbanc@in.tum.de> [Fri, 12 Aug 2011 22:37:41 +0200] rev 2985
started lmcs paper (isabelle make lmcs)
2011-07-24 update to 'termination (eqvt)'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 24 Jul 2011 07:54:54 +0200] rev 2984
update to 'termination (eqvt)'.
2011-07-22 tuned
Christian Urban <urbanc@in.tum.de> [Fri, 22 Jul 2011 11:52:12 +0100] rev 2983
tuned
2011-07-22 completed the eqvt-proofs for functions; they are stored under the name function_name.eqvt and added to the eqvt-list
Christian Urban <urbanc@in.tum.de> [Fri, 22 Jul 2011 11:37:16 +0100] rev 2982
completed the eqvt-proofs for functions; they are stored under the name function_name.eqvt and added to the eqvt-list
2011-07-19 temporary fix
Christian Urban <urbanc@in.tum.de> [Tue, 19 Jul 2011 19:09:06 +0100] rev 2981
temporary fix
2011-07-19 Add an ".hgignore" file
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 19 Jul 2011 10:43:43 +0200] rev 2980
Add an ".hgignore" file
2011-07-19 merged
Christian Urban <urbanc@in.tum.de> [Tue, 19 Jul 2011 09:41:33 +0100] rev 2979
merged
2011-07-19 merged
Christian Urban <urbanc@in.tum.de> [Tue, 19 Jul 2011 09:40:46 +0100] rev 2978
merged
2011-07-19 merged
Christian Urban <urbanc@in.tum.de> [Tue, 19 Jul 2011 08:34:54 +0100] rev 2977
merged
2011-07-19 added termination file
Christian Urban <urbanc@in.tum.de> [Tue, 19 Jul 2011 09:35:24 +0100] rev 2976
added termination file
2011-07-19 preliminary version of automatically generation the eqvt-lemmas for functions defined with nominal_primrec
Christian Urban <urbanc@in.tum.de> [Tue, 19 Jul 2011 02:30:05 +0100] rev 2975
preliminary version of automatically generation the eqvt-lemmas for functions defined with nominal_primrec
2011-07-19 generated the partial eqvt-theorem for functions
Christian Urban <urbanc@in.tum.de> [Tue, 19 Jul 2011 01:40:36 +0100] rev 2974
generated the partial eqvt-theorem for functions
2011-07-18 added a flag (eqvt) to termination proofs arising fron nominal_primrecs
Christian Urban <urbanc@in.tum.de> [Mon, 18 Jul 2011 17:40:13 +0100] rev 2973
added a flag (eqvt) to termination proofs arising fron nominal_primrecs
2011-07-18 moved eqvt for Option.map
Christian Urban <urbanc@in.tum.de> [Mon, 18 Jul 2011 10:50:21 +0100] rev 2972
moved eqvt for Option.map
2011-07-17 some tuning
Christian Urban <urbanc@in.tum.de> [Mon, 18 Jul 2011 00:21:51 +0100] rev 2971
some tuning
2011-07-17 direct definition of height using bn
Christian Urban <urbanc@in.tum.de> [Sun, 17 Jul 2011 11:33:09 +0100] rev 2970
direct definition of height using bn
2011-07-17 defined a function directly over a nominal datatype with bn
Christian Urban <urbanc@in.tum.de> [Sun, 17 Jul 2011 04:04:17 +0100] rev 2969
defined a function directly over a nominal datatype with bn
2011-07-16 more one the NBE example
Christian Urban <urbanc@in.tum.de> [Sat, 16 Jul 2011 21:36:43 +0100] rev 2968
more one the NBE example
2011-07-15 some improvements to the NBE example
Christian Urban <urbanc@in.tum.de> [Fri, 15 Jul 2011 22:48:37 +0100] rev 2967
some improvements to the NBE example
2011-07-13 slight tuning
Christian Urban <urbanc@in.tum.de> [Wed, 13 Jul 2011 09:47:58 +0100] rev 2966
slight tuning
2011-07-11 use eqvt_at_perm
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 12 Jul 2011 03:12:32 +0900] rev 2965
use eqvt_at_perm
2011-07-11 Remove copy of FCB and cleanup
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 11 Jul 2011 23:42:52 +0900] rev 2964
Remove copy of FCB and cleanup
2011-07-11 Experiment with permuting eqvt_at
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 11 Jul 2011 23:42:22 +0900] rev 2963
Experiment with permuting eqvt_at
2011-07-11 combinators for local theories and lists
Christian Urban <urbanc@in.tum.de> [Mon, 11 Jul 2011 14:02:13 +0200] rev 2962
combinators for local theories and lists
2011-07-11 merged
Christian Urban <urbanc@in.tum.de> [Mon, 11 Jul 2011 12:23:44 +0100] rev 2961
merged
2011-07-11 some more experiments with let and bns
Christian Urban <urbanc@in.tum.de> [Mon, 11 Jul 2011 12:23:24 +0100] rev 2960
some more experiments with let and bns
2011-07-08 some code refactoring
Christian Urban <urbanc@in.tum.de> [Fri, 08 Jul 2011 05:04:23 +0200] rev 2959
some code refactoring
2011-07-07 merged
Christian Urban <urbanc@in.tum.de> [Thu, 07 Jul 2011 16:17:03 +0200] rev 2958
merged
2011-07-07 code refactoring; introduced a record for raw_dt_info
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
2011-07-06 more on NBE
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 23:11:30 +0200] rev 2956
more on NBE
2011-07-06 more on the NBE function
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 15:59:11 +0200] rev 2955
more on the NBE function
2011-07-05 a little further with NBE
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 01:04:09 +0200] rev 2954
a little further with NBE
2011-07-05 Setup eqvt_at for first goal
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 06 Jul 2011 07:42:12 +0900] rev 2953
Setup eqvt_at for first goal
2011-07-05 attempt for NBE
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 00:34:42 +0200] rev 2952
attempt for NBE
2011-07-05 added some relatively simple examples from paper by Norrish
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
2011-07-05 changed bind to binds in specifications; bind will cause trouble with Monad_Syntax
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
2011-07-05 side commment for future use
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 18:01:54 +0200] rev 2949
side commment for future use
2011-07-05 made the tests go through again
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 16:22:18 +0200] rev 2948
made the tests go through again
2011-07-05 added another example which seems difficult to define
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 15:01:10 +0200] rev 2947
added another example which seems difficult to define
2011-07-05 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 15:00:41 +0200] rev 2946
added a tactic "all_trivials" which simplifies all trivial constructor cases and leaves the others untouched.
2011-07-05 merged
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 04:23:33 +0200] rev 2945
merged
2011-07-05 all FCB lemmas
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 04:19:02 +0200] rev 2944
all FCB lemmas
2011-07-05 exported various FCB-lemmas to a separate file
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 04:18:45 +0200] rev 2943
exported various FCB-lemmas to a separate file
2011-07-05 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 10:13:34 +0900] rev 2942
Express trans_db with Option.map and Option.bind. Possibly mbind is a copy of bind?
2011-07-05 Define a version of aux only for same binders. Completeness is fine.
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.
2011-07-05 Move If / Let with 'True' to the end of Lambda
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
2011-07-04 merged
Christian Urban <urbanc@in.tum.de> [Mon, 04 Jul 2011 23:56:19 +0200] rev 2939
merged
2011-07-04 tuned
Christian Urban <urbanc@in.tum.de> [Mon, 04 Jul 2011 23:55:46 +0200] rev 2938
tuned
2011-07-04 added an example that recurses over two arguments; the interesting proof-obligation is not yet done
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
2011-07-04 Let with a different invariant; not true.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 04 Jul 2011 14:47:21 +0900] rev 2936
Let with a different invariant; not true.
2011-07-03 Add non-working Lambda_F_T using FCB2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 03 Jul 2011 21:04:46 +0900] rev 2935
Add non-working Lambda_F_T using FCB2
2011-07-03 Added non-working CPS3 using FCB2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 03 Jul 2011 21:04:06 +0900] rev 2934
Added non-working CPS3 using FCB2
2011-07-03 Change CPS1 to FCB2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 03 Jul 2011 21:01:07 +0900] rev 2933
Change CPS1 to FCB2
2011-07-02 Did the proofs of height and subst for Let with list-like binders. Having apply_assns allows proving things by alpha_bn
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
2011-07-01 side-by-side tests of lets with single assignment; deep-binder case works if the recursion is avoided using an auxiliary function
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
2011-07-01 Exhaust Issue
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 01 Jul 2011 17:46:15 +0900] rev 2930
Exhaust Issue
2011-06-30 clarified a sentence
Christian Urban <urbanc@in.tum.de> [Thu, 30 Jun 2011 11:05:25 +0100] rev 2929
clarified a sentence
2011-06-30 more code refactoring
Christian Urban <urbanc@in.tum.de> [Thu, 30 Jun 2011 02:19:59 +0100] rev 2928
more code refactoring
2011-06-29 combined distributed data for alpha in alpha_result (partially done)
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)
2011-06-29 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 19:21:26 +0100] rev 2926
moved Classical and Let temporarily into a section where "sorry" is allowed; this makes all test go through
2011-06-29 added a warning if a theorem is already declared as equivariant
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
2011-06-29 merged
Christian Urban <urbanc@in.tum.de> [Wed, 29 Jun 2011 16:44:54 +0100] rev 2924
merged
2011-06-29 Prove bn injectivity and experiment more with Let
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 29 Jun 2011 13:04:24 +0900] rev 2923
Prove bn injectivity and experiment more with Let
2011-06-28 some experiments
Christian Urban <urbanc@in.tum.de> [Wed, 29 Jun 2011 00:48:50 +0100] rev 2922
some experiments
2011-06-28 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
2011-06-28 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
2011-06-28 eapply fcb ok
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:18:26 +0900] rev 2919
eapply fcb ok
2011-06-28 Removed Inl and Inr
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 14:01:15 +0900] rev 2918
Removed Inl and Inr
2011-06-28 relaxed type in fcb
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 14:49:48 +0100] rev 2917
relaxed type in fcb
2011-06-28 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
2011-06-28 added let-rec example
Christian Urban <urbanc@in.tum.de> [Tue, 28 Jun 2011 14:01:52 +0100] rev 2915
added let-rec example
2011-06-28 Experiments with res
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 28 Jun 2011 12:36:34 +0900] rev 2914
Experiments with res
2011-06-27 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)
2011-06-27 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
2011-06-27 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
2011-06-27 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)
2011-06-27 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.
2011-06-27 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)
2011-06-27 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
2011-06-26 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 27 Jun 2011 08:42:02 +0900] rev 2906
merge
2011-06-26 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.
2011-06-26 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
2011-06-26 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)
2011-06-26 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
2011-06-25 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
2011-06-25 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.
2011-06-24 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
2011-06-24 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
2011-06-24 Remove Lambda_add.thy
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 24 Jun 2011 11:15:22 +0900] rev 2897
Remove Lambda_add.thy
2011-06-24 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
2011-06-24 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
2011-06-24 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
2011-06-24 Second Fixed Point Theorem
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 24 Jun 2011 10:30:06 +0900] rev 2893
Second Fixed Point Theorem
2011-06-24 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.
2011-06-23 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
2011-06-23 added file
Christian Urban <urbanc@in.tum.de> [Thu, 23 Jun 2011 13:09:17 +0100] rev 2890
added file
2011-06-23 expanded the example
Christian Urban <urbanc@in.tum.de> [Thu, 23 Jun 2011 12:28:25 +0100] rev 2889
expanded the example
2011-06-23 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
2011-06-22 tuned
Christian Urban <urbanc@in.tum.de> [Wed, 22 Jun 2011 14:14:54 +0100] rev 2887
tuned
2011-06-22 deleted some dead code
Christian Urban <urbanc@in.tum.de> [Wed, 22 Jun 2011 13:40:25 +0100] rev 2886
deleted some dead code
2011-06-22 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
2011-06-22 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
2011-06-21 Quotients/TODO addtion
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 22 Jun 2011 04:49:56 +0900] rev 2883
Quotients/TODO addtion
2011-06-21 Minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 21 Jun 2011 23:59:36 +0900] rev 2882
Minor
2011-06-21 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 21 Jun 2011 10:39:25 +0900] rev 2881
merge
2011-06-21 spelling
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 21 Jun 2011 10:37:43 +0900] rev 2880
spelling
2011-06-20 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 20:09:51 +0900] rev 2879
merge
2011-06-20 Abs_set_fcb
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 20:08:16 +0900] rev 2878
Abs_set_fcb
2011-06-20 function for let-rec
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 20:09:30 +0900] rev 2877
function for let-rec
2011-06-20 TODO/minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 10:16:12 +0900] rev 2876
TODO/minor
2011-06-20 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
2011-06-20 More minor TODOs
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 09:38:57 +0900] rev 2874
More minor TODOs
2011-06-20 Update TODO
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 09:36:16 +0900] rev 2873
Update TODO
2011-06-20 Let/minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 09:29:42 +0900] rev 2872
Let/minor
2011-06-19 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
2011-06-19 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 19 Jun 2011 13:14:37 +0900] rev 2870
merge
2011-06-19 little on cps2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 19 Jun 2011 13:10:15 +0900] rev 2869
little on cps2
2011-06-16 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
2011-06-16 Fix
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 23:11:50 +0900] rev 2867
Fix
2011-06-16 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 22:00:52 +0900] rev 2866
merge
2011-06-16 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.
2011-06-16 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
2011-06-16 merged
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 13:14:53 +0100] rev 2863
merged
2011-06-16 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
2011-06-16 Added the CPS translation experiments. CPS1 comes with all the proofs, CPS2,3 just have the function and need eqvt_rhs to finish the obligations.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 20:56:30 +0900] rev 2861
Added the CPS translation experiments. CPS1 comes with all the proofs, CPS2,3 just have the function and need eqvt_rhs to finish the obligations.
2011-06-16 added a test that every function must be of pt-sort
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 12:12:25 +0100] rev 2860
added a test that every function must be of pt-sort
2011-06-16 all tests work again
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 11:03:01 +0100] rev 2859
all tests work again
2011-06-15 added size-lemmas to simplifier; as a result termination can be proved by the standard lexicographic_order method
Christian Urban <urbanc@in.tum.de> [Wed, 15 Jun 2011 22:36:59 +0100] rev 2858
added size-lemmas to simplifier; as a result termination can be proved by the standard lexicographic_order method
2011-06-15 added an abstract
Christian Urban <urbanc@in.tum.de> [Wed, 15 Jun 2011 12:52:48 +0100] rev 2857
added an abstract
2011-06-15 added a stub for function paper; "isabelle make fnpaper"
Christian Urban <urbanc@in.tum.de> [Wed, 15 Jun 2011 12:32:40 +0100] rev 2856
added a stub for function paper; "isabelle make fnpaper"
2011-06-15 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 11:06:48 +0900] rev 2855
merge
2011-06-15 one TODO and one Problem?
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 11:06:31 +0900] rev 2854
one TODO and one Problem?
2011-06-15 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 09:51:26 +0900] rev 2853
merge
2011-06-15 Some TODOs
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 09:50:53 +0900] rev 2852
Some TODOs
2011-06-15 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 09:31:59 +0900] rev 2851
merge
2011-06-15 TypeSchemes work with 'default'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 09:25:36 +0900] rev 2850
TypeSchemes work with 'default'.
2011-06-14 tuned some proofs
Christian Urban <urbanc@in.tum.de> [Tue, 14 Jun 2011 19:11:44 +0100] rev 2849
tuned some proofs
2011-06-14 fixed the problem when giving a complex default-term; the fundef lemmas in Nominal_Base were not general enough
Christian Urban <urbanc@in.tum.de> [Tue, 14 Jun 2011 14:07:07 +0100] rev 2848
fixed the problem when giving a complex default-term; the fundef lemmas in Nominal_Base were not general enough
2011-06-14 tuned
Christian Urban <urbanc@in.tum.de> [Tue, 14 Jun 2011 11:43:06 +0100] rev 2847
tuned
2011-06-10 Move working examples before non-working ones
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 15:52:17 +0900] rev 2846
Move working examples before non-working ones
2011-06-10 Optimized proofs and removed some garbage.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 15:45:49 +0900] rev 2845
Optimized proofs and removed some garbage.
2011-06-10 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 15:31:14 +0900] rev 2844
merge
2011-06-10 Slightly modify fcb for list1 and put in common place.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 15:30:09 +0900] rev 2843
Slightly modify fcb for list1 and put in common place.
2011-06-10 Experiments with Let
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 09:00:24 +0900] rev 2842
Experiments with Let
2011-06-09 Eval can be defined with additional freshness
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 09 Jun 2011 15:34:51 +0900] rev 2841
Eval can be defined with additional freshness
2011-06-09 Minor simplification
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 09 Jun 2011 15:03:58 +0900] rev 2840
Minor simplification
2011-06-09 abs_res_fcb will be enough to finish the multiple-recursive proof, if we have a working 'default'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 09 Jun 2011 11:10:41 +0900] rev 2839
abs_res_fcb will be enough to finish the multiple-recursive proof, if we have a working 'default'.
2011-06-09 More experiments with 'default'
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 09 Jun 2011 09:44:51 +0900] rev 2838
More experiments with 'default'
2011-06-08 Finished the proof with the invariant
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 21:44:03 +0900] rev 2837
Finished the proof with the invariant
2011-06-08 Issue with 'default'
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 21:32:35 +0900] rev 2836
Issue with 'default'
2011-06-08 merged
Christian Urban <urbanc@in.tum.de> [Wed, 08 Jun 2011 12:30:56 +0100] rev 2835
merged
2011-06-08 merged
Christian Urban <urbanc@in.tum.de> [Wed, 08 Jun 2011 12:30:46 +0100] rev 2834
merged
2011-06-08 using the option "default" the function package allows one to give an explicit default value
Christian Urban <urbanc@in.tum.de> [Wed, 08 Jun 2011 08:44:01 +0100] rev 2833
using the option "default" the function package allows one to give an explicit default value
2011-06-08 Simpler proof of TypeSchemes/substs
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 17:52:06 +0900] rev 2832
Simpler proof of TypeSchemes/substs
2011-06-08 Simplify fcb_res
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 17:25:54 +0900] rev 2831
Simplify fcb_res
2011-06-08 FCB for res binding and simplified proof of subst for type schemes
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 09:56:39 +0900] rev 2830
FCB for res binding and simplified proof of subst for type schemes
2011-06-07 Simplify ln-trans proof
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 07:06:20 +0900] rev 2829
Simplify ln-trans proof
2011-06-07 cbvs can be easily defined without an invariant
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 07:02:52 +0900] rev 2828
cbvs can be easily defined without an invariant
2011-06-07 defined the "count-bound-variables-occurences" function which has an accumulator like trans
Christian Urban <urbanc@in.tum.de> [Tue, 07 Jun 2011 20:58:00 +0100] rev 2827
defined the "count-bound-variables-occurences" function which has an accumulator like trans
2011-06-07 merged
Christian Urban <urbanc@in.tum.de> [Tue, 07 Jun 2011 17:45:38 +0100] rev 2826
merged
2011-06-07 remove garbage (proofs that assumes the invariant outside function)
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 07 Jun 2011 23:42:12 +0900] rev 2825
remove garbage (proofs that assumes the invariant outside function)
2011-06-07 Proof of trans with invariant
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 07 Jun 2011 23:38:39 +0900] rev 2824
Proof of trans with invariant
2011-06-07 Testing invariant in Lambda_F_T
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 07 Jun 2011 23:22:58 +0900] rev 2823
Testing invariant in Lambda_F_T
2011-06-07 cleaned ups a bit the examples with the invariant framework; exported nominal_function_config datatype into separate structure and file
Christian Urban <urbanc@in.tum.de> [Tue, 07 Jun 2011 10:40:06 +0100] rev 2822
cleaned ups a bit the examples with the invariant framework; exported nominal_function_config datatype into separate structure and file
2011-06-07 fixed problem with earlier commit about nominal_function_common; added facility for specifying an invariant - added a definition of frees_set which need a finiteness invariant
Christian Urban <urbanc@in.tum.de> [Tue, 07 Jun 2011 08:52:59 +0100] rev 2821
fixed problem with earlier commit about nominal_function_common; added facility for specifying an invariant - added a definition of frees_set which need a finiteness invariant
2011-06-06 slightly stronger property in fundef_ex_prop
Christian Urban <urbanc@in.tum.de> [Mon, 06 Jun 2011 13:11:04 +0100] rev 2820
slightly stronger property in fundef_ex_prop
2011-06-05 added an option for an invariant (at the moment only a stub)
Christian Urban <urbanc@in.tum.de> [Sun, 05 Jun 2011 21:14:23 +0100] rev 2819
added an option for an invariant (at the moment only a stub)
2011-06-05 added a more general lemma fro fundef_ex1
Christian Urban <urbanc@in.tum.de> [Sun, 05 Jun 2011 16:58:18 +0100] rev 2818
added a more general lemma fro fundef_ex1
2011-06-04 Trying the induction on the graph
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 04 Jun 2011 14:50:57 +0900] rev 2817
Trying the induction on the graph
2011-06-04 Finish and test the locale approach
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 04 Jun 2011 09:07:50 +0900] rev 2816
Finish and test the locale approach
2011-06-03 FiniteSupp precondition in the function is enough to get rid of completeness obligationss
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 03 Jun 2011 22:31:44 +0900] rev 2815
FiniteSupp precondition in the function is enough to get rid of completeness obligationss
2011-06-03 recursion combinator inside a locale
Christian Urban <urbanc@in.tum.de> [Fri, 03 Jun 2011 12:46:23 +0100] rev 2814
recursion combinator inside a locale
2011-06-03 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 03 Jun 2011 18:33:11 +0900] rev 2813
merge
2011-06-03 F for lambda used to define translation to locally nameless
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 03 Jun 2011 18:32:22 +0900] rev 2812
F for lambda used to define translation to locally nameless
2011-06-02 typo
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 16:15:18 +0100] rev 2811
typo
2011-06-02 removed dead code
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 15:35:33 +0100] rev 2810
removed dead code
2011-06-02 finished the missing obligations
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 22:24:33 +0900] rev 2809
finished the missing obligations
2011-06-02 merged
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 12:14:03 +0100] rev 2808
merged
2011-06-02 a test with a recursion combinator defined on top of nominal_primrec
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 12:09:31 +0100] rev 2807
a test with a recursion combinator defined on top of nominal_primrec
2011-06-02 Use FCB to simplify proof
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 16:41:09 +0900] rev 2806
Use FCB to simplify proof
2011-06-02 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 10:11:50 +0900] rev 2805
merge
2011-06-02 Remove SMT
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 10:09:23 +0900] rev 2804
Remove SMT
2011-06-01 hopefully final fix for ho-functions
Christian Urban <urbanc@in.tum.de> [Wed, 01 Jun 2011 22:55:14 +0100] rev 2803
hopefully final fix for ho-functions
2011-06-01 first test to fix the problem with free variables
Christian Urban <urbanc@in.tum.de> [Wed, 01 Jun 2011 21:03:30 +0100] rev 2802
first test to fix the problem with free variables
2011-06-01 proved subst for All constructor in type schemes.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 16:13:42 +0900] rev 2801
proved subst for All constructor in type schemes.
2011-06-01 DB translation using index; easier to reason about.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 13:41:30 +0900] rev 2800
DB translation using index; easier to reason about.
2011-06-01 Problem: free variables in the goal
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 13:35:37 +0900] rev 2799
Problem: free variables in the goal
2011-06-01 fixed previous commit
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 11:01:39 +0900] rev 2798
fixed previous commit
2011-06-01 equivariance of db_trans
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 10:59:07 +0900] rev 2797
equivariance of db_trans
2011-05-31 fixed the problem with cps-like functions
Christian Urban <urbanc@in.tum.de> [Tue, 31 May 2011 12:22:28 +0100] rev 2796
fixed the problem with cps-like functions
2011-05-31 DeBruijn translation in a simplifier friendly way
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 14:12:31 +0900] rev 2795
DeBruijn translation in a simplifier friendly way
2011-05-31 map_term can be defined when equivariance is assumed
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 13:25:35 +0900] rev 2794
map_term can be defined when equivariance is assumed
2011-05-31 map_term is not a function the way it is defined
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 13:21:00 +0900] rev 2793
map_term is not a function the way it is defined
2011-05-31 Defined translation from nominal to de-Bruijn; with a freshness condition for the lambda case.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 12:59:10 +0900] rev 2792
Defined translation from nominal to de-Bruijn; with a freshness condition for the lambda case.
2011-05-31 Simple eqvt proofs with perm_simps for clarity
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 12:54:21 +0900] rev 2791
Simple eqvt proofs with perm_simps for clarity
2011-05-30 tuned last commit
Christian Urban <urbanc@in.tum.de> [Tue, 31 May 2011 00:36:16 +0100] rev 2790
tuned last commit
2011-05-30 functions involving if and case do not throw exceptions anymore; but eqvt_at assumption has now a precondition
Christian Urban <urbanc@in.tum.de> [Tue, 31 May 2011 00:17:22 +0100] rev 2789
functions involving if and case do not throw exceptions anymore; but eqvt_at assumption has now a precondition
2011-05-26 updated to new Isabelle
Christian Urban <urbanc@in.tum.de> [Thu, 26 May 2011 06:36:29 +0200] rev 2788
updated to new Isabelle
2011-05-25 added eq_iff and distinct lemmas of nominal datatypes to the simplifier
Christian Urban <urbanc@in.tum.de> [Wed, 25 May 2011 21:38:50 +0200] rev 2787
added eq_iff and distinct lemmas of nominal datatypes to the simplifier
2011-05-24 more on slides
Christian Urban <urbanc@in.tum.de> [Tue, 24 May 2011 19:39:38 +0200] rev 2786
more on slides
2011-05-22 added slides for copenhagen
Christian Urban <urbanc@in.tum.de> [Sun, 22 May 2011 10:20:18 +0200] rev 2785
added slides for copenhagen
2011-05-14 added a problem with inductive_cases (reported by Randy)
Christian Urban <urbanc@in.tum.de> [Sat, 14 May 2011 10:16:16 +0100] rev 2784
added a problem with inductive_cases (reported by Randy)
2011-05-13 misc
Christian Urban <urbanc@in.tum.de> [Fri, 13 May 2011 14:50:17 +0100] rev 2783
misc
2011-05-10 made the subtyping work again
Christian Urban <urbanc@in.tum.de> [Tue, 10 May 2011 17:10:22 +0100] rev 2782
made the subtyping work again
2011-05-10 updated to new Isabelle (> 9 May)
Christian Urban <urbanc@in.tum.de> [Tue, 10 May 2011 07:47:06 +0100] rev 2781
updated to new Isabelle (> 9 May)
2011-05-09 merged
Christian Urban <urbanc@in.tum.de> [Mon, 09 May 2011 04:49:58 +0100] rev 2780
merged
2011-05-03 added two mutual recursive inductive definitions
Christian Urban <urbanc@in.tum.de> [Tue, 03 May 2011 15:39:30 +0100] rev 2779
added two mutual recursive inductive definitions
2011-05-03 deleted two functions from the API
Christian Urban <urbanc@in.tum.de> [Tue, 03 May 2011 13:25:02 +0100] rev 2778
deleted two functions from the API
2011-05-03 proved that lfp is equivariant (that simplifies equivariance proofs of inductively defined predicates)
Christian Urban <urbanc@in.tum.de> [Tue, 03 May 2011 13:09:08 +0100] rev 2777
proved that lfp is equivariant (that simplifies equivariance proofs of inductively defined predicates)
2011-05-09 more on pearl-paper
Christian Urban <urbanc@in.tum.de> [Mon, 09 May 2011 04:46:43 +0100] rev 2776
more on pearl-paper
2011-05-04 more on pearl-paper
Christian Urban <urbanc@in.tum.de> [Wed, 04 May 2011 15:27:04 +0800] rev 2775
more on pearl-paper
2011-05-02 updated Quotient paper so that it compiles again
Christian Urban <urbanc@in.tum.de> [Mon, 02 May 2011 13:01:02 +0800] rev 2774
updated Quotient paper so that it compiles again
2011-04-28 merged
Christian Urban <urbanc@in.tum.de> [Thu, 28 Apr 2011 11:51:01 +0800] rev 2773
merged
2011-04-28 added slides for beijing
Christian Urban <urbanc@in.tum.de> [Thu, 28 Apr 2011 11:44:36 +0800] rev 2772
added slides for beijing
2011-04-21 more to the pearl paper
Christian Urban <urbanc@in.tum.de> [Fri, 22 Apr 2011 00:18:25 +0800] rev 2771
more to the pearl paper
2011-04-19 updated to snapshot Isabelle 19 April
Christian Urban <urbanc@in.tum.de> [Tue, 19 Apr 2011 13:03:08 +0100] rev 2770
updated to snapshot Isabelle 19 April
2011-04-18 merged
Christian Urban <urbanc@in.tum.de> [Mon, 18 Apr 2011 15:57:45 +0100] rev 2769
merged
2011-04-18 added permute_pure back into the nominal_inductive procedure; updated to Isabelle 17 April
Christian Urban <urbanc@in.tum.de> [Mon, 18 Apr 2011 15:56:07 +0100] rev 2768
added permute_pure back into the nominal_inductive procedure; updated to Isabelle 17 April
2011-04-15 New way of forward elimination of Abs1_eq and simplifications of the function obligation proofs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 15 Apr 2011 15:20:56 +0900] rev 2767
New way of forward elimination of Abs1_eq and simplifications of the function obligation proofs.
2011-04-13 merged
Christian Urban <urbanc@in.tum.de> [Wed, 13 Apr 2011 13:44:25 +0100] rev 2766
merged
2011-04-13 introduced framework for finetuning eqvt-rules; this solves problem with permute_pure called in nominal_inductive
Christian Urban <urbanc@in.tum.de> [Wed, 13 Apr 2011 13:41:52 +0100] rev 2765
introduced framework for finetuning eqvt-rules; this solves problem with permute_pure called in nominal_inductive
2011-04-12 shanghai slides
Christian Urban <urbanc@in.tum.de> [Tue, 12 Apr 2011 15:46:35 +0800] rev 2764
shanghai slides
2011-04-11 pictures for slides
Christian Urban <urbanc@in.tum.de> [Mon, 11 Apr 2011 02:25:25 +0100] rev 2763
pictures for slides
2011-04-11 Shanghai slides
Christian Urban <urbanc@in.tum.de> [Mon, 11 Apr 2011 02:04:11 +0100] rev 2762
Shanghai slides
2011-04-10 more paper
Christian Urban <urbanc@in.tum.de> [Sun, 10 Apr 2011 14:13:55 +0800] rev 2761
more paper
2011-04-09 eqvt of supp and fresh is proved using equivariance infrastructure
Christian Urban <urbanc@in.tum.de> [Sun, 10 Apr 2011 07:41:52 +0800] rev 2760
eqvt of supp and fresh is proved using equivariance infrastructure
2011-04-09 more paper
Christian Urban <urbanc@in.tum.de> [Sun, 10 Apr 2011 04:07:15 +0800] rev 2759
more paper
2011-04-09 more on the paper
Christian Urban <urbanc@in.tum.de> [Sat, 09 Apr 2011 13:44:49 +0800] rev 2758
more on the paper
2011-04-08 tuned paper
Christian Urban <urbanc@in.tum.de> [Sat, 09 Apr 2011 00:29:40 +0100] rev 2757
tuned paper
2011-04-08 tuned paper
Christian Urban <urbanc@in.tum.de> [Sat, 09 Apr 2011 00:28:53 +0100] rev 2756
tuned paper
2011-04-08 typo
Christian Urban <urbanc@in.tum.de> [Sat, 09 Apr 2011 02:10:49 +0800] rev 2755
typo
2011-04-08 more on paper
Christian Urban <urbanc@in.tum.de> [Fri, 08 Apr 2011 14:23:28 +0800] rev 2754
more on paper
2011-04-07 eqvt_lambda without eta-expansion
Christian Urban <urbanc@in.tum.de> [Fri, 08 Apr 2011 03:47:50 +0800] rev 2753
eqvt_lambda without eta-expansion
2011-04-06 changed default preprocessor that does not catch variables only occuring on the right
Christian Urban <urbanc@in.tum.de> [Wed, 06 Apr 2011 13:47:08 +0100] rev 2752
changed default preprocessor that does not catch variables only occuring on the right
2011-03-31 final version of slides
Christian Urban <urbanc@in.tum.de> [Thu, 31 Mar 2011 15:25:35 +0200] rev 2751
final version of slides
2011-03-30 more on the slides
Christian Urban <urbanc@in.tum.de> [Wed, 30 Mar 2011 22:27:26 +0200] rev 2750
more on the slides
2011-03-30 tuned IsaMakefile
Christian Urban <urbanc@in.tum.de> [Wed, 30 Mar 2011 08:11:36 +0200] rev 2749
tuned IsaMakefile
2011-03-29 rearranged directories and updated to new Isabelle
Christian Urban <urbanc@in.tum.de> [Tue, 29 Mar 2011 23:52:14 +0200] rev 2748
rearranged directories and updated to new Isabelle
2011-03-16 precise path to LaTeXsugar
Christian Urban <urbanc@in.tum.de> [Wed, 16 Mar 2011 21:14:43 +0100] rev 2747
precise path to LaTeXsugar
2011-03-16 a lit bit more on the pearl-jv paper
Christian Urban <urbanc@in.tum.de> [Wed, 16 Mar 2011 21:07:50 +0100] rev 2746
a lit bit more on the pearl-jv paper
2011-03-16 ported changes from function package....needs Isabelle 16 March or above
Christian Urban <urbanc@in.tum.de> [Wed, 16 Mar 2011 20:42:14 +0100] rev 2745
ported changes from function package....needs Isabelle 16 March or above
2011-03-14 more on the pearl paper
Christian Urban <urbanc@in.tum.de> [Tue, 15 Mar 2011 00:40:39 +0100] rev 2744
more on the pearl paper
2011-03-14 equivariance for All and Ex can be proved in terms of their definition
Christian Urban <urbanc@in.tum.de> [Mon, 14 Mar 2011 16:35:59 +0100] rev 2743
equivariance for All and Ex can be proved in terms of their definition
2011-03-11 more on the paper
Christian Urban <urbanc@in.tum.de> [Fri, 11 Mar 2011 08:51:39 +0000] rev 2742
more on the paper
2011-03-08 merged
Christian Urban <urbanc@in.tum.de> [Tue, 08 Mar 2011 09:07:49 +0000] rev 2741
merged
2011-03-08 more on the pearl paper
Christian Urban <urbanc@in.tum.de> [Tue, 08 Mar 2011 09:07:27 +0000] rev 2740
more on the pearl paper
2011-03-02 distinct names at toplevel
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 02 Mar 2011 16:07:56 +0900] rev 2739
distinct names at toplevel
2011-03-02 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 02 Mar 2011 12:49:01 +0900] rev 2738
merge
2011-03-02 Pairing function
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 02 Mar 2011 12:48:00 +0900] rev 2737
Pairing function
2011-03-02 updated pearl papers
Christian Urban <urbanc@in.tum.de> [Wed, 02 Mar 2011 00:06:28 +0000] rev 2736
updated pearl papers
2011-03-01 a bit more tuning
Christian Urban <urbanc@in.tum.de> [Tue, 01 Mar 2011 00:14:02 +0000] rev 2735
a bit more tuning
2011-02-28 included old test cases for perm_simp into ROOT.ML file
Christian Urban <urbanc@in.tum.de> [Mon, 28 Feb 2011 16:47:13 +0000] rev 2734
included old test cases for perm_simp into ROOT.ML file
2011-02-28 split the library into a basics file; merged Nominal_Eqvt into Nominal_Base
Christian Urban <urbanc@in.tum.de> [Mon, 28 Feb 2011 15:21:10 +0000] rev 2733
split the library into a basics file; merged Nominal_Eqvt into Nominal_Base
2011-02-25 some slight polishing
Christian Urban <urbanc@in.tum.de> [Fri, 25 Feb 2011 21:23:30 +0000] rev 2732
some slight polishing
2011-02-24 merged
Christian Urban <urbanc@in.tum.de> [Thu, 24 Feb 2011 18:50:02 +0000] rev 2731
merged
2011-02-24 added a lemma about fresh_star and Abs
Christian Urban <urbanc@in.tum.de> [Thu, 24 Feb 2011 16:26:11 +0000] rev 2730
added a lemma about fresh_star and Abs
2011-02-23 Reduce the definition of trans to FCB; test that FCB can be proved with simp rules.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 23 Feb 2011 11:11:02 +0900] rev 2729
Reduce the definition of trans to FCB; test that FCB can be proved with simp rules.
2011-02-19 typeschemes/subst
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 19 Feb 2011 09:31:22 +0900] rev 2728
typeschemes/subst
2011-02-17 further experiments with typeschemes subst
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 17 Feb 2011 17:02:25 +0900] rev 2727
further experiments with typeschemes subst
2011-02-17 Finished the proof of a function that invents fresh variable names.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 17 Feb 2011 12:01:08 +0900] rev 2726
Finished the proof of a function that invents fresh variable names.
2011-02-16 added eqvt for length
Christian Urban <urbanc@in.tum.de> [Wed, 16 Feb 2011 14:44:33 +0000] rev 2725
added eqvt for length
2011-02-16 added eqvt lemmas for filter and distinct
Christian Urban <urbanc@in.tum.de> [Wed, 16 Feb 2011 14:03:26 +0000] rev 2724
added eqvt lemmas for filter and distinct
2011-02-07 added eqvt for cartesian products
Christian Urban <urbanc@in.tum.de> [Mon, 07 Feb 2011 16:00:24 +0000] rev 2723
added eqvt for cartesian products
2011-02-07 cleaned up the experiments so that the tests go through
Christian Urban <urbanc@in.tum.de> [Mon, 07 Feb 2011 15:59:37 +0000] rev 2722
cleaned up the experiments so that the tests go through
2011-02-04 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 05 Feb 2011 07:39:00 +0900] rev 2721
merge
2011-02-04 Experiments defining a function on Let
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 05 Feb 2011 07:38:22 +0900] rev 2720
Experiments defining a function on Let
2011-02-04 updated TODO
Christian Urban <urbanc@in.tum.de> [Fri, 04 Feb 2011 04:45:04 +0000] rev 2719
updated TODO
2011-02-04 Lambda.thy which works with Nominal_Isabelle2011
Christian Urban <urbanc@in.tum.de> [Fri, 04 Feb 2011 03:52:38 +0000] rev 2718
Lambda.thy which works with Nominal_Isabelle2011
2011-02-03 merged
Christian Urban <urbanc@in.tum.de> [Thu, 03 Feb 2011 02:57:04 +0000] rev 2717
merged
2011-02-03 removed diagnostic code
Christian Urban <urbanc@in.tum.de> [Thu, 03 Feb 2011 02:51:57 +0000] rev 2716
removed diagnostic code
2011-02-01 Only one of the subgoals is needed
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 01 Feb 2011 09:07:55 +0900] rev 2715
Only one of the subgoals is needed
2011-01-31 Experiments with substitution on set+
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 01 Feb 2011 08:57:50 +0900] rev 2714
Experiments with substitution on set+
2011-01-31 More properties that relate abs_res and abs_set. Also abs_res with less binders.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 01 Feb 2011 08:48:14 +0900] rev 2713
More properties that relate abs_res and abs_set. Also abs_res with less binders.
2011-01-30 alpha_res implies alpha_set :)
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 30 Jan 2011 12:09:23 +0900] rev 2712
alpha_res implies alpha_set :)
2011-01-30 Showing that the binders difference is fresh for the left side solves the goal for 'set'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 30 Jan 2011 09:57:37 +0900] rev 2711
Showing that the binders difference is fresh for the left side solves the goal for 'set'.
2011-01-29 Experiments with functions
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 29 Jan 2011 14:26:47 +0900] rev 2710
Experiments with functions
2011-01-27 some experiments
Christian Urban <urbanc@in.tum.de> [Thu, 27 Jan 2011 20:19:13 +0100] rev 2709
some experiments
2011-01-27 the proofs with eqvt_at
Christian Urban <urbanc@in.tum.de> [Thu, 27 Jan 2011 04:24:17 +0100] rev 2708
the proofs with eqvt_at
2011-01-25 made eqvt-proof explicit in the function definitions
Christian Urban <urbanc@in.tum.de> [Tue, 25 Jan 2011 18:58:26 +0100] rev 2707
made eqvt-proof explicit in the function definitions
2011-01-24 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 25 Jan 2011 02:51:44 +0900] rev 2706
merge
2011-01-24 minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 25 Jan 2011 02:46:05 +0900] rev 2705
minor
2011-01-24 Down as infixr
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 25 Jan 2011 02:42:15 +0900] rev 2704
Down as infixr
2011-01-23 added some slides
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 23:24:20 -0600] rev 2703
added some slides
2011-01-23 added Tutorial6
Christian Urban <urbanc@in.tum.de> [Sun, 23 Jan 2011 03:29:22 +0100] rev 2702
added Tutorial6
2011-01-23 cleaning up
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 18:59:48 -0600] rev 2701
cleaning up
2011-01-22 merged
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 16:37:00 -0600] rev 2700
merged
2011-01-22 cleaned up Tutorial 3 with solutions
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 16:36:21 -0600] rev 2699
cleaned up Tutorial 3 with solutions
2011-01-22 Missing val.simps
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 23 Jan 2011 07:32:28 +0900] rev 2698
Missing val.simps
2011-01-22 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 23 Jan 2011 07:17:35 +0900] rev 2697
merge
2011-01-22 Tutorial 4s
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 23 Jan 2011 07:15:59 +0900] rev 2696
Tutorial 4s
2011-01-22 cleaned up and solution section
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 16:04:40 -0600] rev 2695
cleaned up and solution section
2011-01-22 cleaned up tutorial1...added solution file
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 15:07:36 -0600] rev 2694
cleaned up tutorial1...added solution file
2011-01-22 better version of Tutorial 1
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 12:46:01 -0600] rev 2693
better version of Tutorial 1
2011-01-21 better flow of proofs and definitions and proof
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 22:58:03 +0100] rev 2692
better flow of proofs and definitions and proof
2011-01-21 separated type preservation and progress into a separate file
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 22:23:44 +0100] rev 2691
separated type preservation and progress into a separate file
2011-01-21 substitution lemma in separate file
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 22:02:34 +0100] rev 2690
substitution lemma in separate file
2011-01-21 added unbind example
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 21:58:51 +0100] rev 2689
added unbind example
2011-01-20 a bit tuning
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 00:55:28 +0100] rev 2688
a bit tuning
2011-01-20 first split of tutorrial theory
Christian Urban <urbanc@in.tum.de> [Thu, 20 Jan 2011 23:19:30 +0100] rev 2687
first split of tutorrial theory
2011-01-19 added a very rough version of the tutorial; all seems to work
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 23:58:12 +0100] rev 2686
added a very rough version of the tutorial; all seems to work
2011-01-19 added obtain_fresh lemma; tuned Lambda.thy
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 19:41:50 +0100] rev 2685
added obtain_fresh lemma; tuned Lambda.thy
2011-01-19 base file for the tutorial (contains definitions for heigt, subst and beta-reduction)
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 19:06:52 +0100] rev 2684
base file for the tutorial (contains definitions for heigt, subst and beta-reduction)
2011-01-19 ported some of the old proofs to serve as testcases
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 18:56:28 +0100] rev 2683
ported some of the old proofs to serve as testcases
2011-01-19 added eqvt and supp lemma for removeAll (function from List.thy)
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 18:07:29 +0100] rev 2682
added eqvt and supp lemma for removeAll (function from List.thy)
2011-01-19 theory name as it should be
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 17:54:50 +0100] rev 2681
theory name as it should be
2011-01-19 removed diagnostic code
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 17:54:06 +0100] rev 2680
removed diagnostic code
2011-01-19 added Minimal file to test things
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 17:11:10 +0100] rev 2679
added Minimal file to test things
2011-01-19 defined height as a function that returns an integer
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 07:06:47 +0100] rev 2678
defined height as a function that returns an integer
2011-01-18 deleted diagnostic code
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 21:28:07 +0100] rev 2677
deleted diagnostic code
2011-01-18 some tryes about substitution over type-schemes
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 21:26:58 +0100] rev 2676
some tryes about substitution over type-schemes
2011-01-18 defined properly substitution
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 19:27:30 +0100] rev 2675
defined properly substitution
2011-01-18 derived stronger Abs_eq_iff2 theorems
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 18:04:40 +0100] rev 2674
derived stronger Abs_eq_iff2 theorems
2011-01-18 made alpha_abs_set_stronger1 stronger
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 17:30:47 +0100] rev 2673
made alpha_abs_set_stronger1 stronger
2011-01-18 removed finiteness assumption from set_rename_perm
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 17:19:50 +0100] rev 2672
removed finiteness assumption from set_rename_perm
2011-01-18 alpha_abs_set_stronger1
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 18 Jan 2011 22:11:49 +0900] rev 2671
alpha_abs_set_stronger1
2011-01-18 alpha_abs_let_stronger is not true in the same form
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 18 Jan 2011 21:12:25 +0900] rev 2670
alpha_abs_let_stronger is not true in the same form
2011-01-18 the function translating lambda terms to locally nameless lambda terms; still needs a stronger abs_eq_iff lemma...at the moment only proved for restrictions
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 11:02:57 +0100] rev 2669
the function translating lambda terms to locally nameless lambda terms; still needs a stronger abs_eq_iff lemma...at the moment only proved for restrictions
2011-01-18 modified the renaming_perm lemmas
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 06:55:18 +0100] rev 2668
modified the renaming_perm lemmas
2011-01-17 added a translation function from lambda-terms to deBruijn terms (equivariance fails at the moment)
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 17:20:21 +0100] rev 2667
added a translation function from lambda-terms to deBruijn terms (equivariance fails at the moment)
2011-01-17 added a few examples of functions to Lambda.thy
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 15:12:03 +0100] rev 2666
added a few examples of functions to Lambda.thy
2011-01-17 exported nominal function code to external file
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 14:37:18 +0100] rev 2665
exported nominal function code to external file
2011-01-17 removed old testing code from Lambda.thy
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 12:37:37 +0000] rev 2664
removed old testing code from Lambda.thy
2011-01-17 moved high level code from LamTest into the main libraries.
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 12:34:11 +0000] rev 2663
moved high level code from LamTest into the main libraries.
2011-01-17 eliminated tracing code; added flag so that equivariance is only proved for the function graph, not the relation
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 12:33:37 +0000] rev 2662
eliminated tracing code; added flag so that equivariance is only proved for the function graph, not the relation
2011-01-15 subst also works now
Christian Urban <urbanc@in.tum.de> [Sat, 15 Jan 2011 21:16:15 +0000] rev 2661
subst also works now
2011-01-15 nominal_function works now completely for frees and depth; still a propbelm with subst; no unproved assumptions
Christian Urban <urbanc@in.tum.de> [Sat, 15 Jan 2011 20:24:16 +0000] rev 2660
nominal_function works now completely for frees and depth; still a propbelm with subst; no unproved assumptions
2011-01-14 strengthened renaming lemmas
Christian Urban <urbanc@in.tum.de> [Fri, 14 Jan 2011 14:22:25 +0000] rev 2659
strengthened renaming lemmas
2011-01-13 added eqvt_lemmas for subset and psubset
Christian Urban <urbanc@in.tum.de> [Thu, 13 Jan 2011 12:12:47 +0000] rev 2658
added eqvt_lemmas for subset and psubset
2011-01-10 a few lemmas about freshness for at and at_base
Christian Urban <urbanc@in.tum.de> [Mon, 10 Jan 2011 11:36:55 +0000] rev 2657
a few lemmas about freshness for at and at_base
2011-01-10 added a property about finite support in the presense of eqvt_at
Christian Urban <urbanc@in.tum.de> [Mon, 10 Jan 2011 08:51:51 +0000] rev 2656
added a property about finite support in the presense of eqvt_at
2011-01-09 instantiated fundef_ex1_eqvt_at theorem with the indction hypothesis
Christian Urban <urbanc@in.tum.de> [Sun, 09 Jan 2011 05:38:53 +0000] rev 2655
instantiated fundef_ex1_eqvt_at theorem with the indction hypothesis
2011-01-09 solved subgoals for depth and subst function
Christian Urban <urbanc@in.tum.de> [Sun, 09 Jan 2011 04:28:24 +0000] rev 2654
solved subgoals for depth and subst function
2011-01-09 added eqvt_at premises in function definition - however not proved at the moment
Christian Urban <urbanc@in.tum.de> [Sun, 09 Jan 2011 01:17:44 +0000] rev 2653
added eqvt_at premises in function definition - however not proved at the moment
2011-01-07 added one further lemma about equivariance of THE_default
Christian Urban <urbanc@in.tum.de> [Fri, 07 Jan 2011 05:40:31 +0000] rev 2652
added one further lemma about equivariance of THE_default
2011-01-07 equivariance of THE_default under the uniqueness assumption
Christian Urban <urbanc@in.tum.de> [Fri, 07 Jan 2011 05:06:25 +0000] rev 2651
equivariance of THE_default under the uniqueness assumption
2011-01-07 derived equivariance for the function graph and function relation
Christian Urban <urbanc@in.tum.de> [Fri, 07 Jan 2011 02:30:00 +0000] rev 2650
derived equivariance for the function graph and function relation
2011-01-06 a modified function package where, as a test, True has been injected into the compatibility condictions
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 23:06:45 +0000] rev 2649
a modified function package where, as a test, True has been injected into the compatibility condictions
2011-01-06 removed last traces of debugging code
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 20:25:40 +0000] rev 2648
removed last traces of debugging code
2011-01-06 removed debugging code abd introduced a guarded tracing function
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 19:57:57 +0000] rev 2647
removed debugging code abd introduced a guarded tracing function
2011-01-06 moved Weakening up....it does not compile when put at the last position
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 14:53:38 +0000] rev 2646
moved Weakening up....it does not compile when put at the last position
2011-01-06 tuned
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 14:02:10 +0000] rev 2645
tuned
2011-01-06 added weakening to the test cases
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 13:31:44 +0000] rev 2644
added weakening to the test cases
2011-01-06 cleaned up weakening proof and added a version with finit sets
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 13:28:40 +0000] rev 2643
cleaned up weakening proof and added a version with finit sets
2011-01-06 same
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 13:28:19 +0000] rev 2642
same
2011-01-06 some further lemmas for fsets
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 13:28:04 +0000] rev 2641
some further lemmas for fsets
2011-01-06 made sure the raw datatypes and raw functions do not get any mixfix syntax
Christian Urban <urbanc@in.tum.de> [Thu, 06 Jan 2011 11:00:16 +0000] rev 2640
made sure the raw datatypes and raw functions do not get any mixfix syntax
2011-01-05 exported the code into a separate file
Christian Urban <urbanc@in.tum.de> [Wed, 05 Jan 2011 17:33:43 +0000] rev 2639
exported the code into a separate file
2011-01-05 strong rule inductions; as an example the weakening lemma works
Christian Urban <urbanc@in.tum.de> [Wed, 05 Jan 2011 16:51:27 +0000] rev 2638
strong rule inductions; as an example the weakening lemma works
2011-01-04 final version of the ESOP paper; used set+ instead of res as requested by one reviewer
Christian Urban <urbanc@in.tum.de> [Tue, 04 Jan 2011 13:47:38 +0000] rev 2637
final version of the ESOP paper; used set+ instead of res as requested by one reviewer
2011-01-03 file with most of the strong rule induction development
Christian Urban <urbanc@in.tum.de> [Mon, 03 Jan 2011 16:21:12 +0000] rev 2636
file with most of the strong rule induction development
2011-01-03 simple cases for string rule inductions
Christian Urban <urbanc@in.tum.de> [Mon, 03 Jan 2011 16:19:27 +0000] rev 2635
simple cases for string rule inductions
2010-12-31 changed res keyword to set+ for restrictions; comment by a referee
Christian Urban <urbanc@in.tum.de> [Fri, 31 Dec 2010 15:37:04 +0000] rev 2634
changed res keyword to set+ for restrictions; comment by a referee
2010-12-31 added proper case names for all induct and exhaust theorems
Christian Urban <urbanc@in.tum.de> [Fri, 31 Dec 2010 13:31:39 +0000] rev 2633
added proper case names for all induct and exhaust theorems
2010-12-31 added small example for strong inductions; functions still need a sorry
Christian Urban <urbanc@in.tum.de> [Fri, 31 Dec 2010 12:12:59 +0000] rev 2632
added small example for strong inductions; functions still need a sorry
2010-12-30 removed local fix for bug in induction_schema; added setup method for strong inductions
Christian Urban <urbanc@in.tum.de> [Thu, 30 Dec 2010 10:00:09 +0000] rev 2631
removed local fix for bug in induction_schema; added setup method for strong inductions
2010-12-28 automated all strong induction lemmas
Christian Urban <urbanc@in.tum.de> [Tue, 28 Dec 2010 19:51:25 +0000] rev 2630
automated all strong induction lemmas
2010-12-28 proper application of induction_schema and strong_exhaust rules; needs local fix in induction_schema.ML
Christian Urban <urbanc@in.tum.de> [Tue, 28 Dec 2010 00:20:50 +0000] rev 2629
proper application of induction_schema and strong_exhaust rules; needs local fix in induction_schema.ML
2010-12-26 generated goals for strong induction theorems.
Christian Urban <urbanc@in.tum.de> [Sun, 26 Dec 2010 16:35:16 +0000] rev 2628
generated goals for strong induction theorems.
2010-12-23 test with strong inductions
Christian Urban <urbanc@in.tum.de> [Thu, 23 Dec 2010 01:05:05 +0000] rev 2627
test with strong inductions
2010-12-23 moved all strong_exhaust code to nominal_dt_quot; tuned examples
Christian Urban <urbanc@in.tum.de> [Thu, 23 Dec 2010 00:46:06 +0000] rev 2626
moved all strong_exhaust code to nominal_dt_quot; tuned examples
2010-12-23 moved generic functions into nominal_library
Christian Urban <urbanc@in.tum.de> [Thu, 23 Dec 2010 00:22:41 +0000] rev 2625
moved generic functions into nominal_library
2010-12-22 slight tuning
Christian Urban <urbanc@in.tum.de> [Wed, 22 Dec 2010 23:12:51 +0000] rev 2624
slight tuning
2010-12-22 slight tuning
Christian Urban <urbanc@in.tum.de> [Wed, 22 Dec 2010 22:30:43 +0000] rev 2623
slight tuning
2010-12-22 tuned examples
Christian Urban <urbanc@in.tum.de> [Wed, 22 Dec 2010 21:13:44 +0000] rev 2622
tuned examples
2010-12-22 added fold_right which produces the correct term for left-infix operators
Christian Urban <urbanc@in.tum.de> [Wed, 22 Dec 2010 21:13:32 +0000] rev 2621
added fold_right which produces the correct term for left-infix operators
2010-12-22 updated to Isabelle 22 December
Christian Urban <urbanc@in.tum.de> [Wed, 22 Dec 2010 12:47:09 +0000] rev 2620
updated to Isabelle 22 December
2010-12-22 a bit tuning
Christian Urban <urbanc@in.tum.de> [Wed, 22 Dec 2010 12:17:49 +0000] rev 2619
a bit tuning
2010-12-22 corrected premises of strong exhausts theorems
Christian Urban <urbanc@in.tum.de> [Wed, 22 Dec 2010 10:32:01 +0000] rev 2618
corrected premises of strong exhausts theorems
2010-12-22 properly exported strong exhaust theorem; cleaned up some examples
Christian Urban <urbanc@in.tum.de> [Wed, 22 Dec 2010 09:13:25 +0000] rev 2617
properly exported strong exhaust theorem; cleaned up some examples
2010-12-21 all examples for strong exhausts work; recursive binders need to be treated differently; still unclean version with lots of diagnostic code
Christian Urban <urbanc@in.tum.de> [Tue, 21 Dec 2010 10:28:08 +0000] rev 2616
all examples for strong exhausts work; recursive binders need to be treated differently; still unclean version with lots of diagnostic code
2010-12-19 one interesting case done
Christian Urban <urbanc@in.tum.de> [Sun, 19 Dec 2010 07:50:37 +0000] rev 2615
one interesting case done
2010-12-19 a stronger statement for at_set_avoiding
Christian Urban <urbanc@in.tum.de> [Sun, 19 Dec 2010 07:43:32 +0000] rev 2614
a stronger statement for at_set_avoiding
2010-12-17 tuned
Christian Urban <urbanc@in.tum.de> [Fri, 17 Dec 2010 01:01:44 +0000] rev 2613
tuned
2010-12-17 tuned
Christian Urban <urbanc@in.tum.de> [Fri, 17 Dec 2010 00:39:27 +0000] rev 2612
tuned
2010-12-16 simple cases for strong inducts done; infrastructure for the difficult ones is there
Christian Urban <urbanc@in.tum.de> [Thu, 16 Dec 2010 08:42:48 +0000] rev 2611
simple cases for strong inducts done; infrastructure for the difficult ones is there
2010-12-16 added theorem-rewriter conversion
Christian Urban <urbanc@in.tum.de> [Thu, 16 Dec 2010 02:25:35 +0000] rev 2610
added theorem-rewriter conversion
2010-12-14 freshness theorem in strong exhausts; (temporarily includes a cheat_tac to make all tests go through)
Christian Urban <urbanc@in.tum.de> [Tue, 14 Dec 2010 14:23:40 +0000] rev 2609
freshness theorem in strong exhausts; (temporarily includes a cheat_tac to make all tests go through)
2010-12-12 created strong_exhausts terms
Christian Urban <urbanc@in.tum.de> [Sun, 12 Dec 2010 22:09:11 +0000] rev 2608
created strong_exhausts terms
2010-12-12 moved setify and listify functions into the library; introduced versions that have a type argument
Christian Urban <urbanc@in.tum.de> [Sun, 12 Dec 2010 00:10:40 +0000] rev 2607
moved setify and listify functions into the library; introduced versions that have a type argument
2010-12-10 updated
Christian Urban <urbanc@in.tum.de> [Fri, 10 Dec 2010 19:01:44 +0000] rev 2606
updated
2010-12-09 a bit more tuning of the paper
Christian Urban <urbanc@in.tum.de> [Thu, 09 Dec 2010 18:12:42 +0000] rev 2605
a bit more tuning of the paper
2010-12-09 brought the paper to 20 pages plus one page appendix
Christian Urban <urbanc@in.tum.de> [Thu, 09 Dec 2010 17:10:08 +0000] rev 2604
brought the paper to 20 pages plus one page appendix
2010-12-08 first tests about exhaust
Christian Urban <urbanc@in.tum.de> [Wed, 08 Dec 2010 17:07:08 +0000] rev 2603
first tests about exhaust
2010-12-08 moved some code into the nominal_library
Christian Urban <urbanc@in.tum.de> [Wed, 08 Dec 2010 13:16:25 +0000] rev 2602
moved some code into the nominal_library
2010-12-08 moved definition of raw bn-functions into nominal_dt_rawfuns
Christian Urban <urbanc@in.tum.de> [Wed, 08 Dec 2010 13:05:04 +0000] rev 2601
moved definition of raw bn-functions into nominal_dt_rawfuns
2010-12-08 kept the nested structure of constructors (belonging to one datatype)
Christian Urban <urbanc@in.tum.de> [Wed, 08 Dec 2010 12:37:25 +0000] rev 2600
kept the nested structure of constructors (belonging to one datatype)
2010-12-07 moved general theorems into the libraries
Christian Urban <urbanc@in.tum.de> [Tue, 07 Dec 2010 19:16:09 +0000] rev 2599
moved general theorems into the libraries
2010-12-07 automated permute_bn theorems
Christian Urban <urbanc@in.tum.de> [Tue, 07 Dec 2010 14:27:39 +0000] rev 2598
automated permute_bn theorems
2010-12-07 updated to changes in Isabelle
Christian Urban <urbanc@in.tum.de> [Tue, 07 Dec 2010 14:27:21 +0000] rev 2597
updated to changes in Isabelle
2010-12-06 deleted nominal_dt_supp.ML
Christian Urban <urbanc@in.tum.de> [Mon, 06 Dec 2010 17:11:54 +0000] rev 2596
deleted nominal_dt_supp.ML
2010-12-06 moved code from nominal_dt_supp to nominal_dt_quot
Christian Urban <urbanc@in.tum.de> [Mon, 06 Dec 2010 17:11:34 +0000] rev 2595
moved code from nominal_dt_supp to nominal_dt_quot
2010-12-06 automated alpha_perm_bn theorems
Christian Urban <urbanc@in.tum.de> [Mon, 06 Dec 2010 16:35:42 +0000] rev 2594
automated alpha_perm_bn theorems
2010-12-06 ordered raw_bn_info to agree with the order of the raw_bn_functions; started alpha_bn proof
Christian Urban <urbanc@in.tum.de> [Mon, 06 Dec 2010 14:24:17 +0000] rev 2593
ordered raw_bn_info to agree with the order of the raw_bn_functions; started alpha_bn proof
2010-12-03 updated to Isabelle 2nd December
Christian Urban <urbanc@in.tum.de> [Fri, 03 Dec 2010 13:51:07 +0000] rev 2592
updated to Isabelle 2nd December
2010-11-29 isarfied some of the high-level proofs
Christian Urban <urbanc@in.tum.de> [Mon, 29 Nov 2010 08:01:09 +0000] rev 2591
isarfied some of the high-level proofs
2010-11-29 added abs_rename_res lemma
Christian Urban <urbanc@in.tum.de> [Mon, 29 Nov 2010 05:17:41 +0000] rev 2590
added abs_rename_res lemma
2010-11-29 completed proofs in Foo2
Christian Urban <urbanc@in.tum.de> [Mon, 29 Nov 2010 05:10:02 +0000] rev 2589
completed proofs in Foo2
2010-11-28 completed the strong exhausts rules for Foo2 using general lemmas
Christian Urban <urbanc@in.tum.de> [Sun, 28 Nov 2010 16:37:34 +0000] rev 2588
completed the strong exhausts rules for Foo2 using general lemmas
2010-11-27 tuned proof to reduce number of warnings
Christian Urban <urbanc@in.tum.de> [Sat, 27 Nov 2010 23:00:16 +0000] rev 2587
tuned proof to reduce number of warnings
2010-11-27 disabled the Foo examples, because of heavy work
Christian Urban <urbanc@in.tum.de> [Sat, 27 Nov 2010 22:55:29 +0000] rev 2586
disabled the Foo examples, because of heavy work
2010-11-26 slightly simplified the Foo2 tests and hint at a general lemma
Christian Urban <urbanc@in.tum.de> [Fri, 26 Nov 2010 22:43:26 +0000] rev 2585
slightly simplified the Foo2 tests and hint at a general lemma
2010-11-26 completely different method fro deriving the exhaust lemma
Christian Urban <urbanc@in.tum.de> [Fri, 26 Nov 2010 19:03:23 +0000] rev 2584
completely different method fro deriving the exhaust lemma
2010-11-26 merged
Christian Urban <urbanc@in.tum.de> [Fri, 26 Nov 2010 10:53:55 +0000] rev 2583
merged
2010-11-25 merged
Christian Urban <urbanc@in.tum.de> [Thu, 25 Nov 2010 01:18:24 +0000] rev 2582
merged
2010-11-24 added example from the F-ing paper by Rossberg, Russo and Dreyer
Christian Urban <urbanc@in.tum.de> [Wed, 24 Nov 2010 02:36:21 +0000] rev 2581
added example from the F-ing paper by Rossberg, Russo and Dreyer
2010-11-24 implemented concrete suggestion of 3rd reviewer
Christian Urban <urbanc@in.tum.de> [Wed, 24 Nov 2010 01:08:48 +0000] rev 2580
implemented concrete suggestion of 3rd reviewer
2010-11-26 missing freshness assumptions
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Nov 2010 12:17:24 +0900] rev 2579
missing freshness assumptions
2010-11-25 foo2 strong induction
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Nov 2010 15:06:45 +0900] rev 2578
foo2 strong induction
2010-11-24 foo2 full exhausts
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Nov 2010 17:44:50 +0900] rev 2577
foo2 full exhausts
2010-11-24 Foo2 strong_exhaust for first variable.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Nov 2010 16:59:26 +0900] rev 2576
Foo2 strong_exhaust for first variable.
2010-11-22 single rename in let2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 22 Nov 2010 16:16:25 +0900] rev 2575
single rename in let2
2010-11-22 current isabelle
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 22 Nov 2010 16:14:47 +0900] rev 2574
current isabelle
2010-11-21 added example Foo2.thy
Christian Urban <urbanc@in.tum.de> [Sun, 21 Nov 2010 02:17:19 +0000] rev 2573
added example Foo2.thy
2010-11-15 tuned example
Christian Urban <urbanc@in.tum.de> [Mon, 15 Nov 2010 20:54:01 +0000] rev 2572
tuned example
2010-11-15 proved that bn functions return a finite set
Christian Urban <urbanc@in.tum.de> [Mon, 15 Nov 2010 09:52:29 +0000] rev 2571
proved that bn functions return a finite set
2010-11-15 added a test for the various shallow binders
Christian Urban <urbanc@in.tum.de> [Mon, 15 Nov 2010 08:17:11 +0000] rev 2570
added a test for the various shallow binders
2010-11-15 fixed bug in fv function where a shallow binder binds lists of names
Christian Urban <urbanc@in.tum.de> [Mon, 15 Nov 2010 01:10:02 +0000] rev 2569
fixed bug in fv function where a shallow binder binds lists of names
2010-11-14 merged Nominal-General directory into Nominal; renamed Abs.thy to Nominal2_Abs.thy
Christian Urban <urbanc@in.tum.de> [Sun, 14 Nov 2010 16:34:47 +0000] rev 2568
merged Nominal-General directory into Nominal; renamed Abs.thy to Nominal2_Abs.thy
2010-11-14 deleted special Nominal2_FSet theory
Christian Urban <urbanc@in.tum.de> [Sun, 14 Nov 2010 12:09:14 +0000] rev 2567
deleted special Nominal2_FSet theory
2010-11-14 moved rest of the lemmas from Nominal2_FSet to the TypeScheme example
Christian Urban <urbanc@in.tum.de> [Sun, 14 Nov 2010 11:46:39 +0000] rev 2566
moved rest of the lemmas from Nominal2_FSet to the TypeScheme example
2010-11-14 moved most material fron Nominal2_FSet into the Nominal_Base theory
Christian Urban <urbanc@in.tum.de> [Sun, 14 Nov 2010 11:05:22 +0000] rev 2565
moved most material fron Nominal2_FSet into the Nominal_Base theory
2010-11-14 tuned example
Christian Urban <urbanc@in.tum.de> [Sun, 14 Nov 2010 10:02:30 +0000] rev 2564
tuned example
2010-11-14 lifted permute_bn simp rules
Christian Urban <urbanc@in.tum.de> [Sun, 14 Nov 2010 01:00:56 +0000] rev 2563
lifted permute_bn simp rules
2010-11-13 lifted permute_bn constants
Christian Urban <urbanc@in.tum.de> [Sat, 13 Nov 2010 22:23:26 +0000] rev 2562
lifted permute_bn constants
2010-11-13 respectfulness for permute_bn functions
Christian Urban <urbanc@in.tum.de> [Sat, 13 Nov 2010 10:25:03 +0000] rev 2561
respectfulness for permute_bn functions
2010-11-12 automated permute_bn functions (raw ones first)
Christian Urban <urbanc@in.tum.de> [Fri, 12 Nov 2010 01:20:53 +0000] rev 2560
automated permute_bn functions (raw ones first)
2010-11-10 adapted to changes by Florian on the quotient package and removed local fix for function package
Christian Urban <urbanc@in.tum.de> [Wed, 10 Nov 2010 13:46:21 +0000] rev 2559
adapted to changes by Florian on the quotient package and removed local fix for function package
2010-11-10 expanded the paper by uncommenting the comments and adding the appendix
Christian Urban <urbanc@in.tum.de> [Wed, 10 Nov 2010 13:40:46 +0000] rev 2558
expanded the paper by uncommenting the comments and adding the appendix
2010-11-07 fixed locally the problem with the function package; all tests work again
Christian Urban <urbanc@in.tum.de> [Sun, 07 Nov 2010 11:22:31 +0000] rev 2557
fixed locally the problem with the function package; all tests work again
2010-11-06 added a test about subtyping; disabled two tests, because of problem with function package
Christian Urban <urbanc@in.tum.de> [Sat, 06 Nov 2010 06:18:41 +0000] rev 2556
added a test about subtyping; disabled two tests, because of problem with function package
2010-11-05 small typo
Christian Urban <urbanc@in.tum.de> [Fri, 05 Nov 2010 15:21:10 +0000] rev 2555
small typo
2010-10-29 squeezed qpaper to 6 pages
Christian Urban <urbanc@in.tum.de> [Fri, 29 Oct 2010 15:37:24 +0100] rev 2554
squeezed qpaper to 6 pages
2010-10-29 Qpaper / Move examples to commented out appendix
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 29 Oct 2010 14:25:50 +0900] rev 2553
Qpaper / Move examples to commented out appendix
2010-10-28 Unanonymize qpaper
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 28 Oct 2010 15:16:43 +0900] rev 2552
Unanonymize qpaper
2010-10-28 FSet changes for Qpaper
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 28 Oct 2010 14:12:30 +0900] rev 2551
FSet changes for Qpaper
2010-10-28 Remove FSet and use the one from Isabelle
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 28 Oct 2010 14:03:46 +0900] rev 2550
Remove FSet and use the one from Isabelle
2010-10-19 took out comment about map-types / adapted to recent changes
Christian Urban <urbanc@in.tum.de> [Tue, 19 Oct 2010 15:08:24 +0100] rev 2549
took out comment about map-types / adapted to recent changes
2010-10-19 use definitions instead of functions
Christian Urban <urbanc@in.tum.de> [Tue, 19 Oct 2010 10:10:41 +0100] rev 2548
use definitions instead of functions
2010-10-18 tuned
Christian Urban <urbanc@in.tum.de> [Mon, 18 Oct 2010 12:15:44 +0100] rev 2547
tuned
2010-10-18 used functions instead of definitions
Christian Urban <urbanc@in.tum.de> [Mon, 18 Oct 2010 11:51:22 +0100] rev 2546
used functions instead of definitions
2010-10-18 added missing style file
Christian Urban <urbanc@in.tum.de> [Mon, 18 Oct 2010 09:42:51 +0100] rev 2545
added missing style file
2010-10-18 Use the generalized compositional quotient theorem
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 18 Oct 2010 14:13:28 +0900] rev 2544
Use the generalized compositional quotient theorem
2010-10-17 fixed typo
Christian Urban <urbanc@in.tum.de> [Sun, 17 Oct 2010 21:40:23 +0100] rev 2543
fixed typo
2010-10-17 all tests work again
Christian Urban <urbanc@in.tum.de> [Sun, 17 Oct 2010 15:53:37 +0100] rev 2542
all tests work again
2010-10-17 some tuning
Christian Urban <urbanc@in.tum.de> [Sun, 17 Oct 2010 15:28:05 +0100] rev 2541
some tuning
2010-10-17 naming scheme is now *_fset (not f*_)
Christian Urban <urbanc@in.tum.de> [Sun, 17 Oct 2010 13:35:52 +0100] rev 2540
naming scheme is now *_fset (not f*_)
2010-10-15 more cleaning
Christian Urban <urbanc@in.tum.de> [Fri, 15 Oct 2010 23:45:54 +0100] rev 2539
more cleaning
2010-10-15 further tuning
Christian Urban <urbanc@in.tum.de> [Fri, 15 Oct 2010 17:37:44 +0100] rev 2538
further tuning
2010-10-15 renamed fminus_raw to diff_list
Christian Urban <urbanc@in.tum.de> [Fri, 15 Oct 2010 16:01:03 +0100] rev 2537
renamed fminus_raw to diff_list
2010-10-15 renamed fcard_raw to card_list
Christian Urban <urbanc@in.tum.de> [Fri, 15 Oct 2010 15:58:48 +0100] rev 2536
renamed fcard_raw to card_list
2010-10-15 slight update
Christian Urban <urbanc@in.tum.de> [Fri, 15 Oct 2010 15:56:16 +0100] rev 2535
slight update
2010-10-15 Further reorganisation and cleaning
Christian Urban <urbanc@in.tum.de> [Fri, 15 Oct 2010 15:47:20 +0100] rev 2534
Further reorganisation and cleaning
2010-10-15 further cleaning
Christian Urban <urbanc@in.tum.de> [Fri, 15 Oct 2010 14:11:23 +0100] rev 2533
further cleaning
2010-10-15 typo
Christian Urban <urbanc@in.tum.de> [Fri, 15 Oct 2010 13:28:39 +0100] rev 2532
typo
2010-10-15 FSet: stronger fact in Isabelle.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 15 Oct 2010 16:32:34 +0900] rev 2531
FSet: stronger fact in Isabelle.
2010-10-15 FSet synchronizing
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 15 Oct 2010 16:23:26 +0900] rev 2530
FSet synchronizing
2010-10-15 Synchronizing FSet further.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 15 Oct 2010 15:52:40 +0900] rev 2529
Synchronizing FSet further.
2010-10-15 Partially merging changes from Isabelle
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 15 Oct 2010 15:24:19 +0900] rev 2528
Partially merging changes from Isabelle
2010-10-14 fixed the typo in the abstract and the problem with append (the type of map_k
Christian Urban <urbanc@in.tum.de> [Thu, 14 Oct 2010 17:32:06 +0100] rev 2527
fixed the typo in the abstract and the problem with append (the type of map_k and map_list seems to be indeed incorrect....did not yet look at this)
2010-10-14 changed format of the pearl paper
Christian Urban <urbanc@in.tum.de> [Thu, 14 Oct 2010 15:58:34 +0100] rev 2526
changed format of the pearl paper
2010-10-14 deleted some unused lemmas
Christian Urban <urbanc@in.tum.de> [Thu, 14 Oct 2010 11:09:52 +0100] rev 2525
deleted some unused lemmas
2010-10-14 major reorganisation of fset (renamed fset_to_set to fset, changed the definition of list_eq and fcard_raw)
Christian Urban <urbanc@in.tum.de> [Thu, 14 Oct 2010 04:14:22 +0100] rev 2524
major reorganisation of fset (renamed fset_to_set to fset, changed the definition of list_eq and fcard_raw)
2010-10-13 more on the pearl paper
Christian Urban <urbanc@in.tum.de> [Wed, 13 Oct 2010 22:55:58 +0100] rev 2523
more on the pearl paper
2010-10-12 added a section about abstractions
Christian Urban <urbanc@in.tum.de> [Tue, 12 Oct 2010 13:06:18 +0100] rev 2522
added a section about abstractions
2010-10-12 tiny work on the pearl paper
Christian Urban <urbanc@in.tum.de> [Tue, 12 Oct 2010 10:07:48 +0100] rev 2521
tiny work on the pearl paper
2010-10-08 tuned
Christian Urban <urbanc@in.tum.de> [Fri, 08 Oct 2010 23:53:51 +0100] rev 2520
tuned
2010-10-08 added apendix to paper detailing one proof
Christian Urban <urbanc@in.tum.de> [Fri, 08 Oct 2010 23:49:18 +0100] rev 2519
added apendix to paper detailing one proof
2010-10-08 minor
Christian Urban <urbanc@in.tum.de> [Fri, 08 Oct 2010 15:37:11 +0100] rev 2518
minor
2010-10-08 minor
Christian Urban <urbanc@in.tum.de> [Fri, 08 Oct 2010 15:35:14 +0100] rev 2517
minor
2010-10-08 down to 20 pages
Christian Urban <urbanc@in.tum.de> [Fri, 08 Oct 2010 13:41:54 +0100] rev 2516
down to 20 pages
2010-10-07 minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 07 Oct 2010 14:23:32 +0900] rev 2515
minor
2010-10-06 down to 21 pages and changed strong induction section
Christian Urban <urbanc@in.tum.de> [Wed, 06 Oct 2010 21:32:44 +0100] rev 2514
down to 21 pages and changed strong induction section
2010-10-06 tuned
Christian Urban <urbanc@in.tum.de> [Wed, 06 Oct 2010 08:13:09 +0100] rev 2513
tuned
2010-10-06 down to 22 pages
Christian Urban <urbanc@in.tum.de> [Wed, 06 Oct 2010 08:09:40 +0100] rev 2512
down to 22 pages
2010-10-05 down to 23 pages
Christian Urban <urbanc@in.tum.de> [Tue, 05 Oct 2010 21:48:31 +0100] rev 2511
down to 23 pages
2010-10-05 down to 24 pages and a bit
Christian Urban <urbanc@in.tum.de> [Tue, 05 Oct 2010 08:43:49 +0100] rev 2510
down to 24 pages and a bit
2010-10-05 llncs and more sqeezing
Christian Urban <urbanc@in.tum.de> [Tue, 05 Oct 2010 07:30:37 +0100] rev 2509
llncs and more sqeezing
2010-10-04 first part of sqeezing everything into 20 pages (at the moment we have 26)
Christian Urban <urbanc@in.tum.de> [Mon, 04 Oct 2010 12:39:57 +0100] rev 2508
first part of sqeezing everything into 20 pages (at the moment we have 26)
(0) -1000 -480 tip