Fri, 26 Mar 2010 17:01:22 +0100 |
Cezary Kaliszyk |
Fixed renamings.
|
file |
diff |
annotate
|
Fri, 26 Mar 2010 16:20:39 +0100 |
Cezary Kaliszyk |
Removed remaining cheats + some cleaning.
|
file |
diff |
annotate
|
Fri, 26 Mar 2010 10:07:26 +0100 |
Cezary Kaliszyk |
Removed another cheat and cleaned the code a bit.
|
file |
diff |
annotate
|
Thu, 25 Mar 2010 20:12:57 +0100 |
Cezary Kaliszyk |
Proper bn_rsp, for bn functions calling each other.
|
file |
diff |
annotate
|
Thu, 25 Mar 2010 17:30:46 +0100 |
Cezary Kaliszyk |
Gathering things to prove by induction together; removed cheat_bn_eqvt.
|
file |
diff |
annotate
|
Wed, 24 Mar 2010 11:13:39 +0100 |
Cezary Kaliszyk |
Support proof modification for Core Haskell.
|
file |
diff |
annotate
|
Wed, 24 Mar 2010 09:59:47 +0100 |
Cezary Kaliszyk |
Compute Fv for non-recursive bn functions calling other bn functions
|
file |
diff |
annotate
|
Tue, 23 Mar 2010 16:28:29 +0100 |
Cezary Kaliszyk |
Parsing bn functions that call other bn functions and transmitting this information to fv/alpha.
|
file |
diff |
annotate
|
Tue, 23 Mar 2010 11:42:06 +0100 |
Cezary Kaliszyk |
Modification to Core Haskell to make it accepted with an empty binding function.
|
file |
diff |
annotate
|
Mon, 22 Mar 2010 18:29:29 +0100 |
Cezary Kaliszyk |
equivp_cheat can be removed for all one-permutation examples.
|
file |
diff |
annotate
|
Sat, 20 Mar 2010 08:56:07 +0100 |
Cezary Kaliszyk |
Build alpha-->alphabn implications
|
file |
diff |
annotate
|
Sat, 20 Mar 2010 08:04:59 +0100 |
Cezary Kaliszyk |
Prove reflp for all relations.
|
file |
diff |
annotate
|
Fri, 19 Mar 2010 18:42:57 +0100 |
Cezary Kaliszyk |
Automatically derive support for datatypes with at-most one binding per constructor.
|
file |
diff |
annotate
|
Fri, 19 Mar 2010 14:54:30 +0100 |
Cezary Kaliszyk |
Use fs typeclass in showing finite support + some cheat cleaning.
|
file |
diff |
annotate
|
Fri, 19 Mar 2010 08:31:43 +0100 |
Cezary Kaliszyk |
The nominal infrastructure for fset. 'fs' missing, but not needed so far.
|
file |
diff |
annotate
|
Thu, 18 Mar 2010 15:32:49 +0100 |
Cezary Kaliszyk |
Continued description of alpha.
|
file |
diff |
annotate
|
Thu, 18 Mar 2010 14:48:27 +0100 |
Cezary Kaliszyk |
First part of the description of alpha_ty.
|
file |
diff |
annotate
|
Thu, 18 Mar 2010 14:29:42 +0100 |
Cezary Kaliszyk |
Description of generation of alpha_bn.
|
file |
diff |
annotate
|
Thu, 18 Mar 2010 12:09:59 +0100 |
Cezary Kaliszyk |
Added fv,bn,distinct,perm to the simplifier.
|
file |
diff |
annotate
|
Thu, 18 Mar 2010 11:36:03 +0100 |
Cezary Kaliszyk |
Simplified the description.
|
file |
diff |
annotate
|
Thu, 18 Mar 2010 11:29:12 +0100 |
Cezary Kaliszyk |
Update the description of the generation of fv function.
|
file |
diff |
annotate
|
Thu, 18 Mar 2010 08:32:55 +0100 |
Cezary Kaliszyk |
Rename bound variables + minor cleaning.
|
file |
diff |
annotate
|
Wed, 17 Mar 2010 17:40:14 +0100 |
Cezary Kaliszyk |
Proper compose_sym2
|
file |
diff |
annotate
|
Wed, 17 Mar 2010 17:09:01 +0100 |
Cezary Kaliszyk |
Trying to find a compose lemma for 2 arguments.
|
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 09:57:54 +0100 |
Cezary Kaliszyk |
Fix in alpha; support of the recursive Let works :)
|
file |
diff |
annotate
|
Wed, 17 Mar 2010 09:17:55 +0100 |
Cezary Kaliszyk |
Generate compound FV and Alpha for recursive bindings.
|
file |
diff |
annotate
|
Tue, 16 Mar 2010 20:07:13 +0100 |
Cezary Kaliszyk |
Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
|
file |
diff |
annotate
|
Tue, 16 Mar 2010 18:18:08 +0100 |
Cezary Kaliszyk |
The old recursive alpha works fine.
|
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
|