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
Thu, 04 Mar 2010 15:31:21 +0100 more proofs in Abs and work on Core Haskell
Christian Urban <urbanc@in.tum.de> [Thu, 04 Mar 2010 15:31:21 +0100] rev 1351
more proofs in Abs and work on Core Haskell
Wed, 03 Mar 2010 19:10:40 +0100 added a lemma that permutations can be represented as sums of swapping
Christian Urban <urbanc@in.tum.de> [Wed, 03 Mar 2010 19:10:40 +0100] rev 1350
added a lemma that permutations can be represented as sums of swapping
Fri, 05 Mar 2010 18:14:04 +0100 Still unable to show supp=fv for let with one existential.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 18:14:04 +0100] rev 1349
Still unable to show supp=fv for let with one existential.
Fri, 05 Mar 2010 17:09:48 +0100 Ported LF to the parser interface.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 17:09:48 +0100] rev 1348
Ported LF to the parser interface.
Fri, 05 Mar 2010 14:56:19 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 14:56:19 +0100] rev 1347
merge
Fri, 05 Mar 2010 14:55:21 +0100 Lift fv and bn eqvts; no need to lift alpha_eqvt.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 14:55:21 +0100] rev 1346
Lift fv and bn eqvts; no need to lift alpha_eqvt.
Fri, 05 Mar 2010 13:04:47 +0100 Not much progress about the single existential let case.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 13:04:47 +0100] rev 1345
Not much progress about the single existential let case.
Fri, 05 Mar 2010 10:23:40 +0100 Fixed LF for one quantifier over 2 premises.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 10:23:40 +0100] rev 1344
Fixed LF for one quantifier over 2 premises.
Fri, 05 Mar 2010 09:41:22 +0100 Trying to fix the proofs for the single existential... So far failed.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 09:41:22 +0100] rev 1343
Trying to fix the proofs for the single existential... So far failed.
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 tip