Mon, 11 Jul 2011 12:23:24 +0100 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
Fri, 08 Jul 2011 05:04:23 +0200 some code refactoring
Christian Urban <urbanc@in.tum.de> [Fri, 08 Jul 2011 05:04:23 +0200] rev 2959
some code refactoring
Thu, 07 Jul 2011 16:17:03 +0200 merged
Christian Urban <urbanc@in.tum.de> [Thu, 07 Jul 2011 16:17:03 +0200] rev 2958
merged
Thu, 07 Jul 2011 16:16:42 +0200 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
Wed, 06 Jul 2011 23:11:30 +0200 more on NBE
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 23:11:30 +0200] rev 2956
more on NBE
Wed, 06 Jul 2011 15:59:11 +0200 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
Wed, 06 Jul 2011 01:04:09 +0200 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
Wed, 06 Jul 2011 07:42:12 +0900 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
Wed, 06 Jul 2011 00:34:42 +0200 attempt for NBE
Christian Urban <urbanc@in.tum.de> [Wed, 06 Jul 2011 00:34:42 +0200] rev 2952
attempt for NBE
Tue, 05 Jul 2011 23:47:20 +0200 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
Tue, 05 Jul 2011 18:42:34 +0200 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
Tue, 05 Jul 2011 18:01:54 +0200 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
Tue, 05 Jul 2011 16:22:18 +0200 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
Tue, 05 Jul 2011 15:01:10 +0200 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
Tue, 05 Jul 2011 15:00:41 +0200 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.
Tue, 05 Jul 2011 04:23:33 +0200 merged
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 04:23:33 +0200] rev 2945
merged
Tue, 05 Jul 2011 04:19:02 +0200 all FCB lemmas
Christian Urban <urbanc@in.tum.de> [Tue, 05 Jul 2011 04:19:02 +0200] rev 2944
all FCB lemmas
Tue, 05 Jul 2011 04:18:45 +0200 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
Tue, 05 Jul 2011 10:13:34 +0900 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?
Tue, 05 Jul 2011 09:28:16 +0900 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.
Tue, 05 Jul 2011 09:26:20 +0900 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
Mon, 04 Jul 2011 23:56:19 +0200 merged
Christian Urban <urbanc@in.tum.de> [Mon, 04 Jul 2011 23:56:19 +0200] rev 2939
merged
Mon, 04 Jul 2011 23:55:46 +0200 tuned
Christian Urban <urbanc@in.tum.de> [Mon, 04 Jul 2011 23:55:46 +0200] rev 2938
tuned
Mon, 04 Jul 2011 23:54:05 +0200 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
Mon, 04 Jul 2011 14:47:21 +0900 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.
Sun, 03 Jul 2011 21:04:46 +0900 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
Sun, 03 Jul 2011 21:04:06 +0900 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
Sun, 03 Jul 2011 21:01:07 +0900 Change CPS1 to FCB2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 03 Jul 2011 21:01:07 +0900] rev 2933
Change CPS1 to FCB2
Sat, 02 Jul 2011 12:40:59 +0900 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
Sat, 02 Jul 2011 00:27:47 +0100 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
(0) -1000 -300 -100 -50 -30 +30 +50 +100 tip