| 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
|
| 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:06:22 +0100 |
Cezary Kaliszyk |
Removed pi o bn = bn' assumption in alpha
|
file |
diff |
annotate
|
| Thu, 11 Mar 2010 20:49:31 +0100 |
Cezary Kaliszyk |
Do not fail if the finite support proof fails.
|
file |
diff |
annotate
|