Tue, 09 Mar 2010 22:10:10 +0100 merged
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 22:10:10 +0100] rev 1381
merged
Tue, 09 Mar 2010 22:08:38 +0100 added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 22:08:38 +0100] rev 1380
added bn-information, but it is not yet ordered according to the dts
Tue, 09 Mar 2010 21:22:22 +0100 Separate lists for separate constructors, to match bn_eqs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 21:22:22 +0100] rev 1379
Separate lists for separate constructors, to match bn_eqs.
Tue, 09 Mar 2010 17:25:35 +0100 All examples should work.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 17:25:35 +0100] rev 1378
All examples should work.
Tue, 09 Mar 2010 17:02:29 +0100 Fix to get old alpha.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 17:02:29 +0100] rev 1377
Fix to get old alpha.
Tue, 09 Mar 2010 16:57:51 +0100 Separate primrecs in Fv.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 16:57:51 +0100] rev 1376
Separate primrecs in Fv.
Tue, 09 Mar 2010 16:24:39 +0100 A version of Fv that takes into account recursive and non-recursive bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 16:24:39 +0100] rev 1375
A version of Fv that takes into account recursive and non-recursive bindings.
Tue, 09 Mar 2010 11:36:40 +0100 Trying to prove that old alpha is the same as new recursive one. Lets still to do.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 11:36:40 +0100] rev 1374
Trying to prove that old alpha is the same as new recursive one. Lets still to do.
Tue, 09 Mar 2010 11:06:57 +0100 fv_bi and alpha_bi
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 11:06:57 +0100] rev 1373
fv_bi and alpha_bi
Tue, 09 Mar 2010 09:55:19 +0100 merged
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 09:55:19 +0100] rev 1372
merged
Tue, 09 Mar 2010 09:54:58 +0100 added first test about new compat
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 09:54:58 +0100] rev 1371
added first test about new compat
Tue, 09 Mar 2010 09:38:49 +0100 fv_compat
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 09:38:49 +0100] rev 1370
fv_compat
Tue, 09 Mar 2010 08:46:55 +0100 added another compat example
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 08:46:55 +0100] rev 1369
added another compat example
Mon, 08 Mar 2010 20:18:27 +0100 added a test-file for compatibility
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 20:18:27 +0100] rev 1368
added a test-file for compatibility
Mon, 08 Mar 2010 16:11:42 +0100 added compat definitions to some examples
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 16:11:42 +0100] rev 1367
added compat definitions to some examples
Mon, 08 Mar 2010 15:28:25 +0100 Proper recognition of atoms and atom sets.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 15:28:25 +0100] rev 1366
Proper recognition of atoms and atom sets.
Mon, 08 Mar 2010 15:06:14 +0100 deleted comments about "weird"
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 15:06:14 +0100] rev 1365
deleted comments about "weird"
Mon, 08 Mar 2010 15:01:26 +0100 merged
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 15:01:26 +0100] rev 1364
merged
Mon, 08 Mar 2010 15:01:01 +0100 updated to new Isabelle
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 15:01:01 +0100] rev 1363
updated to new Isabelle
Mon, 08 Mar 2010 14:31:04 +0100 Term5 written as nominal_datatype is the recursive let.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 14:31:04 +0100] rev 1362
Term5 written as nominal_datatype is the recursive let.
Mon, 08 Mar 2010 11:25:57 +0100 With restricted_nominal=1, exp7 and exp8 work. Not sure about proving bn_rsp there.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 11:25:57 +0100] rev 1361
With restricted_nominal=1, exp7 and exp8 work. Not sure about proving bn_rsp there.
Mon, 08 Mar 2010 11:12:15 +0100 More fine-grained nominal restriction for debugging.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 11:12:15 +0100] rev 1360
More fine-grained nominal restriction for debugging.
Mon, 08 Mar 2010 11:10:43 +0100 Fix permutation addition.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 11:10:43 +0100] rev 1359
Fix permutation addition.
Mon, 08 Mar 2010 10:33:55 +0100 Update the comments
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 10:33:55 +0100] rev 1358
Update the comments
Mon, 08 Mar 2010 10:08:31 +0100 Gather bindings with same binder, and generate only one permutation for them.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 10:08:31 +0100] rev 1357
Gather bindings with same binder, and generate only one permutation for them.
Mon, 08 Mar 2010 02:40:16 +0100 Undo effects of simp.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 02:40:16 +0100] rev 1356
Undo effects of simp.
Sun, 07 Mar 2010 21:30:57 +0100 merged
Christian Urban <urbanc@in.tum.de> [Sun, 07 Mar 2010 21:30:57 +0100] rev 1355
merged
Sun, 07 Mar 2010 21:30:12 +0100 updated to renamings in Isabelle
Christian Urban <urbanc@in.tum.de> [Sun, 07 Mar 2010 21:30:12 +0100] rev 1354
updated to renamings in Isabelle
Thu, 04 Mar 2010 15:56:58 +0100 merged
Christian Urban <urbanc@in.tum.de> [Thu, 04 Mar 2010 15:56:58 +0100] rev 1353
merged
Thu, 04 Mar 2010 15:31:34 +0100 merged
Christian Urban <urbanc@in.tum.de> [Thu, 04 Mar 2010 15:31:34 +0100] rev 1352
merged
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 tip