| Thu, 18 Mar 2010 08:32:55 +0100 |
Cezary Kaliszyk |
Rename bound variables + minor cleaning.
|
file |
diff |
annotate
|
| Thu, 18 Mar 2010 07:43:44 +0100 |
Cezary Kaliszyk |
Prove pseudo-inject (eq-iff) on the exported level and rename appropriately.
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 17:11:23 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 15:13:03 +0100 |
Christian Urban |
added partial proof for the strong induction principle
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 12:23:04 +0100 |
Cezary Kaliszyk |
merge
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 12:18:35 +0100 |
Cezary Kaliszyk |
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 11:53:56 +0100 |
Christian Urban |
added proof of supp/fv for type schemes
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 10:34:25 +0100 |
Christian Urban |
added partial proof of supp for type schemes
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 09:57:54 +0100 |
Cezary Kaliszyk |
Fix in alpha; support of the recursive Let works :)
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 09:42:56 +0100 |
Cezary Kaliszyk |
The recursive supp just has one equation too much.
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 08:07:25 +0100 |
Christian Urban |
commented out examples that should not work; but for example type-scheme example should work
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 06:49:33 +0100 |
Christian Urban |
added another supp-proof for the non-recursive case
|
file |
diff |
annotate
|
| Tue, 16 Mar 2010 18:13:34 +0100 |
Christian Urban |
added the final unfolded result
|
file |
diff |
annotate
|
| Tue, 16 Mar 2010 18:02:08 +0100 |
Christian Urban |
merge and proof of support for non-recursive case
|
file |
diff |
annotate
|
| Tue, 16 Mar 2010 16:51:06 +0100 |
Cezary Kaliszyk |
alpha_bn doesn't need the permutation in non-recursive case.
|
file |
diff |
annotate
|
| Tue, 16 Mar 2010 15:27:47 +0100 |
Cezary Kaliszyk |
FV_bn generated for recursive functions as well, and used in main fv for bindings.
|
file |
diff |
annotate
|
| Tue, 16 Mar 2010 12:08:37 +0100 |
Cezary Kaliszyk |
The proof in 'Test' gets simpler.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 23:42:56 +0100 |
Christian Urban |
merged (confirmed to work with Isabelle from 6th March)
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 17:51:35 +0100 |
Christian Urban |
proof for support when bn-function is present, but fb_function is empty
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 17:42:17 +0100 |
Cezary Kaliszyk |
fv_eqvt_cheat no longer needed.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 14:32:05 +0100 |
Cezary Kaliszyk |
derive "inducts" from "induct" instead of lifting again is much faster.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 11:50:12 +0100 |
Cezary Kaliszyk |
cheat_alpha_eqvt no longer needed; the proofs work.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 09:27:25 +0100 |
Cezary Kaliszyk |
Use eqvt.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 08:28:10 +0100 |
Christian Urban |
added an eqvt-proof for bi
|
file |
diff |
annotate
|
| Sat, 13 Mar 2010 13:49:15 +0100 |
Christian Urban |
started supp-fv proofs (is going to work)
|
file |
diff |
annotate
|
| Thu, 11 Mar 2010 17:47:29 +0100 |
Cezary Kaliszyk |
Show that the new types are in finite support typeclass.
|
file |
diff |
annotate
|
| Thu, 11 Mar 2010 13:34:45 +0100 |
Cezary Kaliszyk |
With the 4 cheats, all examples fully lift.
|
file |
diff |
annotate
|
| Thu, 11 Mar 2010 12:26:24 +0100 |
Cezary Kaliszyk |
Lifting constants.
|
file |
diff |
annotate
|
| Wed, 10 Mar 2010 14:24:27 +0100 |
Cezary Kaliszyk |
Reordered examples in Test.
|
file |
diff |
annotate
|
| Wed, 10 Mar 2010 13:10:00 +0100 |
Cezary Kaliszyk |
Linked parser to fv and alpha.
|
file |
diff |
annotate
|
| Wed, 10 Mar 2010 12:48:38 +0100 |
Christian Urban |
parser produces ordered bn-fun information
|
file |
diff |
annotate
|
| Tue, 09 Mar 2010 22:08:38 +0100 |
Christian Urban |
added bn-information, but it is not yet ordered according to the dts
|
file |
diff |
annotate
|
| Tue, 09 Mar 2010 17:25:35 +0100 |
Cezary Kaliszyk |
All examples should work.
|
file |
diff |
annotate
|
| Mon, 08 Mar 2010 20:18:27 +0100 |
Christian Urban |
added a test-file for compatibility
|
file |
diff |
annotate
|
| Mon, 08 Mar 2010 16:11:42 +0100 |
Christian Urban |
added compat definitions to some examples
|
file |
diff |
annotate
|
| Mon, 08 Mar 2010 15:06:14 +0100 |
Christian Urban |
deleted comments about "weird"
|
file |
diff |
annotate
|
| Mon, 08 Mar 2010 11:25:57 +0100 |
Cezary Kaliszyk |
With restricted_nominal=1, exp7 and exp8 work. Not sure about proving bn_rsp there.
|
file |
diff |
annotate
|
| Sun, 07 Mar 2010 21:30:57 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Thu, 04 Mar 2010 15:56:58 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Thu, 04 Mar 2010 15:31:34 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Thu, 04 Mar 2010 15:31:21 +0100 |
Christian Urban |
more proofs in Abs and work on Core Haskell
|
file |
diff |
annotate
|
| Thu, 04 Mar 2010 18:57:23 +0100 |
Cezary Kaliszyk |
Lift distinct.
|
file |
diff |
annotate
|
| Thu, 04 Mar 2010 15:55:53 +0100 |
Cezary Kaliszyk |
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
|
file |
diff |
annotate
|
| Thu, 04 Mar 2010 15:15:44 +0100 |
Cezary Kaliszyk |
Lift BV,FV,Permutations and injection :).
|
file |
diff |
annotate
|
| Thu, 04 Mar 2010 11:16:36 +0100 |
Cezary Kaliszyk |
A version that just leaves the supp/\supp goal. Obviously not true.
|
file |
diff |
annotate
|
| Thu, 04 Mar 2010 10:59:52 +0100 |
Cezary Kaliszyk |
Prove symp and transp of weird without the supp /\ supp = {} assumption.
|
file |
diff |
annotate
|
| Wed, 03 Mar 2010 17:51:47 +0100 |
Cezary Kaliszyk |
merge
|
file |
diff |
annotate
|
| Wed, 03 Mar 2010 17:49:34 +0100 |
Cezary Kaliszyk |
Experiments with proving weird transp
|
file |
diff |
annotate
|
| Wed, 03 Mar 2010 14:46:14 +0100 |
Christian Urban |
fixed mess in Test.thy
|
file |
diff |
annotate
|
| Wed, 03 Mar 2010 14:22:58 +0100 |
Cezary Kaliszyk |
Fix eqvt for multiple quantifiers.
|
file |
diff |
annotate
|
| Wed, 03 Mar 2010 12:48:05 +0100 |
Christian Urban |
only tuned
|
file |
diff |
annotate
|
| Wed, 03 Mar 2010 12:47:06 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Wed, 03 Mar 2010 11:50:25 +0100 |
Christian Urban |
added ACM style file for ICFP
|
file |
diff |
annotate
|
| Wed, 03 Mar 2010 11:42:15 +0100 |
Cezary Kaliszyk |
weird eqvt
|
file |
diff |
annotate
|
| Tue, 02 Mar 2010 20:14:21 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Tue, 02 Mar 2010 20:11:56 +0100 |
Christian Urban |
preliinary test about alpha-weirdo
|
file |
diff |
annotate
|
| Tue, 02 Mar 2010 18:57:26 +0100 |
Christian Urban |
Another problem with permutations in alpha and possibly also in fv
|
file |
diff |
annotate
|
| Tue, 02 Mar 2010 18:48:20 +0100 |
Christian Urban |
potential problem with the phd-example, where two permutations are generated, but only one is used
|
file |
diff |
annotate
|
| Tue, 02 Mar 2010 17:48:56 +0100 |
Cezary Kaliszyk |
merge
|
file |
diff |
annotate
|
| Tue, 02 Mar 2010 17:48:41 +0100 |
Cezary Kaliszyk |
Porting from Lift to Parser; until defining the Quotient type.
|
file |
diff |
annotate
|