| Mon, 08 Mar 2010 15:01:01 +0100 | Christian Urban | updated to new Isabelle | changeset | files |
| Mon, 08 Mar 2010 14:31:04 +0100 | Cezary Kaliszyk | Term5 written as nominal_datatype is the recursive let. | changeset | files |
| 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. | changeset | files |
| Mon, 08 Mar 2010 11:12:15 +0100 | Cezary Kaliszyk | More fine-grained nominal restriction for debugging. | changeset | files |
| Mon, 08 Mar 2010 11:10:43 +0100 | Cezary Kaliszyk | Fix permutation addition. | changeset | files |
| Mon, 08 Mar 2010 10:33:55 +0100 | Cezary Kaliszyk | Update the comments | changeset | files |
| Mon, 08 Mar 2010 10:08:31 +0100 | Cezary Kaliszyk | Gather bindings with same binder, and generate only one permutation for them. | changeset | files |
| Mon, 08 Mar 2010 02:40:16 +0100 | Cezary Kaliszyk | Undo effects of simp. | changeset | files |
| Sun, 07 Mar 2010 21:30:57 +0100 | Christian Urban | merged | changeset | files |
| Sun, 07 Mar 2010 21:30:12 +0100 | Christian Urban | updated to renamings in Isabelle | changeset | files |
| Thu, 04 Mar 2010 15:56:58 +0100 | Christian Urban | merged | changeset | files |
| Thu, 04 Mar 2010 15:31:34 +0100 | Christian Urban | merged | changeset | files |
| Thu, 04 Mar 2010 15:31:21 +0100 | Christian Urban | more proofs in Abs and work on Core Haskell | changeset | files |
| Wed, 03 Mar 2010 19:10:40 +0100 | Christian Urban | added a lemma that permutations can be represented as sums of swapping | changeset | files |
| Fri, 05 Mar 2010 18:14:04 +0100 | Cezary Kaliszyk | Still unable to show supp=fv for let with one existential. | changeset | files |