| Wed, 10 Mar 2010 12:48:55 +0100 | Christian Urban | merged | changeset | files |
| Wed, 10 Mar 2010 12:48:38 +0100 | Christian Urban | parser produces ordered bn-fun information | changeset | files |
| Wed, 10 Mar 2010 11:39:28 +0100 | Cezary Kaliszyk | Testing equalities in trm5, all seems good. | changeset | files |
| Wed, 10 Mar 2010 11:19:59 +0100 | Cezary Kaliszyk | Fv&Alpha seem to work. | changeset | files |
| Wed, 10 Mar 2010 10:47:21 +0100 | Cezary Kaliszyk | include alpha in the definitions. | changeset | files |
| Wed, 10 Mar 2010 10:11:20 +0100 | Cezary Kaliszyk | Filled the algorithm for alpha_bn_arg | changeset | files |
| Wed, 10 Mar 2010 09:58:43 +0100 | Cezary Kaliszyk | rhs of alpha_bn, and template for the arguments. | changeset | files |
| Wed, 10 Mar 2010 09:45:38 +0100 | Cezary Kaliszyk | alpha_bn_constr template | changeset | files |
| Wed, 10 Mar 2010 09:36:07 +0100 | Cezary Kaliszyk | exported template for alpha_bn | changeset | files |
| Wed, 10 Mar 2010 09:10:11 +0100 | Cezary Kaliszyk | merge | changeset | files |
| Wed, 10 Mar 2010 09:09:52 +0100 | Cezary Kaliszyk | Use alpha_bns in normal alpha defs. | changeset | files |
| Wed, 10 Mar 2010 08:44:19 +0100 | Cezary Kaliszyk | alpha_bn_frees | changeset | files |
| Tue, 09 Mar 2010 22:10:10 +0100 | Christian Urban | merged | changeset | files |
| Tue, 09 Mar 2010 22:08:38 +0100 | Christian Urban | added bn-information, but it is not yet ordered according to the dts | changeset | files |
| Tue, 09 Mar 2010 21:22:22 +0100 | Cezary Kaliszyk | Separate lists for separate constructors, to match bn_eqs. | changeset | files |
| Tue, 09 Mar 2010 17:25:35 +0100 | Cezary Kaliszyk | All examples should work. | changeset | files |
| Tue, 09 Mar 2010 17:02:29 +0100 | Cezary Kaliszyk | Fix to get old alpha. | changeset | files |
| Tue, 09 Mar 2010 16:57:51 +0100 | Cezary Kaliszyk | Separate primrecs in Fv. | changeset | files |
| Tue, 09 Mar 2010 16:24:39 +0100 | Cezary Kaliszyk | A version of Fv that takes into account recursive and non-recursive bindings. | changeset | files |
| Tue, 09 Mar 2010 11:36:40 +0100 | Cezary Kaliszyk | Trying to prove that old alpha is the same as new recursive one. Lets still to do. | changeset | files |
| Tue, 09 Mar 2010 11:06:57 +0100 | Cezary Kaliszyk | fv_bi and alpha_bi | changeset | files |
| Tue, 09 Mar 2010 09:55:19 +0100 | Christian Urban | merged | changeset | files |
| Tue, 09 Mar 2010 09:54:58 +0100 | Christian Urban | added first test about new compat | changeset | files |
| Tue, 09 Mar 2010 09:38:49 +0100 | Cezary Kaliszyk | fv_compat | changeset | files |
| Tue, 09 Mar 2010 08:46:55 +0100 | Christian Urban | added another compat example | changeset | files |
| Mon, 08 Mar 2010 20:18:27 +0100 | Christian Urban | added a test-file for compatibility | changeset | files |
| Mon, 08 Mar 2010 16:11:42 +0100 | Christian Urban | added compat definitions to some examples | changeset | files |
| Mon, 08 Mar 2010 15:28:25 +0100 | Cezary Kaliszyk | Proper recognition of atoms and atom sets. | changeset | files |
| Mon, 08 Mar 2010 15:06:14 +0100 | Christian Urban | deleted comments about "weird" | changeset | files |
| Mon, 08 Mar 2010 15:01:26 +0100 | Christian Urban | merged | changeset | files |
| 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 |
| Fri, 05 Mar 2010 17:09:48 +0100 | Cezary Kaliszyk | Ported LF to the parser interface. | changeset | files |
| Fri, 05 Mar 2010 14:56:19 +0100 | Cezary Kaliszyk | merge | changeset | files |
| Fri, 05 Mar 2010 14:55:21 +0100 | Cezary Kaliszyk | Lift fv and bn eqvts; no need to lift alpha_eqvt. | changeset | files |
| Fri, 05 Mar 2010 13:04:47 +0100 | Cezary Kaliszyk | Not much progress about the single existential let case. | changeset | files |
| Fri, 05 Mar 2010 10:23:40 +0100 | Cezary Kaliszyk | Fixed LF for one quantifier over 2 premises. | changeset | files |
| Fri, 05 Mar 2010 09:41:22 +0100 | Cezary Kaliszyk | Trying to fix the proofs for the single existential... So far failed. | changeset | files |
| Thu, 04 Mar 2010 18:57:23 +0100 | Cezary Kaliszyk | Lift distinct. | changeset | files |
| 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. | changeset | files |
| Thu, 04 Mar 2010 15:15:44 +0100 | Cezary Kaliszyk | Lift BV,FV,Permutations and injection :). | changeset | files |
| 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. | changeset | files |
| Thu, 04 Mar 2010 11:16:36 +0100 | Cezary Kaliszyk | A version that just leaves the supp/\supp goal. Obviously not true. | changeset | files |
| Thu, 04 Mar 2010 10:59:52 +0100 | Cezary Kaliszyk | Prove symp and transp of weird without the supp /\ supp = {} assumption. | changeset | files |
| Wed, 03 Mar 2010 17:51:47 +0100 | Cezary Kaliszyk | merge | changeset | files |
| Wed, 03 Mar 2010 17:49:34 +0100 | Cezary Kaliszyk | Experiments with proving weird transp | changeset | files |
| Wed, 03 Mar 2010 17:47:29 +0100 | Cezary Kaliszyk | Code for solving symp goals with multiple existentials. | changeset | files |