| Wed, 10 Mar 2010 08:44:19 +0100 |
Cezary Kaliszyk |
alpha_bn_frees
|
file |
diff |
annotate
|
| Tue, 09 Mar 2010 21:22:22 +0100 |
Cezary Kaliszyk |
Separate lists for separate constructors, to match bn_eqs.
|
file |
diff |
annotate
|
| Tue, 09 Mar 2010 17:02:29 +0100 |
Cezary Kaliszyk |
Fix to get old alpha.
|
file |
diff |
annotate
|
| Tue, 09 Mar 2010 16:57:51 +0100 |
Cezary Kaliszyk |
Separate primrecs in Fv.
|
file |
diff |
annotate
|
| Tue, 09 Mar 2010 16:24:39 +0100 |
Cezary Kaliszyk |
A version of Fv that takes into account recursive and non-recursive bindings.
|
file |
diff |
annotate
|
| Mon, 08 Mar 2010 15:28:25 +0100 |
Cezary Kaliszyk |
Proper recognition of atoms and atom sets.
|
file |
diff |
annotate
|
| Mon, 08 Mar 2010 14:31:04 +0100 |
Cezary Kaliszyk |
Term5 written as nominal_datatype is the recursive let.
|
file |
diff |
annotate
|
| Mon, 08 Mar 2010 11:10:43 +0100 |
Cezary Kaliszyk |
Fix permutation addition.
|
file |
diff |
annotate
|
| Mon, 08 Mar 2010 10:33:55 +0100 |
Cezary Kaliszyk |
Update the comments
|
file |
diff |
annotate
|
| Mon, 08 Mar 2010 10:08:31 +0100 |
Cezary Kaliszyk |
Gather bindings with same binder, and generate only one permutation for them.
|
file |
diff |
annotate
|
| Thu, 04 Mar 2010 12:00:11 +0100 |
Cezary Kaliszyk |
Comment out Weird and Phd until we have an idea how to handle multiple permutations. Transp that works for multiple existentials.
|
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:47:29 +0100 |
Cezary Kaliszyk |
Code for solving symp goals with multiple existentials.
|
file |
diff |
annotate
|