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.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 11:12:15 +0100] rev 1360
More fine-grained nominal restriction for debugging.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 11:10:43 +0100] rev 1359
Fix permutation addition.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 10:33:55 +0100] rev 1358
Update the comments
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.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 02:40:16 +0100] rev 1356
Undo effects of simp.
Christian Urban <urbanc@in.tum.de> [Sun, 07 Mar 2010 21:30:57 +0100] rev 1355
merged
Christian Urban <urbanc@in.tum.de> [Sun, 07 Mar 2010 21:30:12 +0100] rev 1354
updated to renamings in Isabelle
Christian Urban <urbanc@in.tum.de> [Thu, 04 Mar 2010 15:56:58 +0100] rev 1353
merged
Christian Urban <urbanc@in.tum.de> [Thu, 04 Mar 2010 15:31:34 +0100] rev 1352
merged
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
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
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.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 17:09:48 +0100] rev 1348
Ported LF to the parser interface.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 14:56:19 +0100] rev 1347
merge
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.
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.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 05 Mar 2010 10:23:40 +0100] rev 1344
Fixed LF for one quantifier over 2 premises.
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.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 04 Mar 2010 18:57:23 +0100] rev 1342
Lift distinct.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 04 Mar 2010 15:55:53 +0100] rev 1341
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 04 Mar 2010 15:15:44 +0100] rev 1340
Lift BV,FV,Permutations and injection :).
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 04 Mar 2010 12:00:11 +0100] rev 1339
Comment out Weird and Phd until we have an idea how to handle multiple permutations. Transp that works for multiple existentials.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 04 Mar 2010 11:16:36 +0100] rev 1338
A version that just leaves the supp/\supp goal. Obviously not true.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 04 Mar 2010 10:59:52 +0100] rev 1337
Prove symp and transp of weird without the supp /\ supp = {} assumption.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 03 Mar 2010 17:51:47 +0100] rev 1336
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 03 Mar 2010 17:49:34 +0100] rev 1335
Experiments with proving weird transp
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 03 Mar 2010 17:47:29 +0100] rev 1334
Code for solving symp goals with multiple existentials.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 03 Mar 2010 15:28:25 +0100] rev 1333
reflp for multiple quantifiers.
Christian Urban <urbanc@in.tum.de> [Wed, 03 Mar 2010 14:46:14 +0100] rev 1332
fixed mess in Test.thy