| Wed, 22 Jun 2011 13:40:25 +0100 | Christian Urban | deleted some dead code | changeset | files |
| Wed, 22 Jun 2011 12:18:22 +0100 | Christian Urban | some rudimentary infrastructure for storing data about nominal datatypes | changeset | files |
| Wed, 22 Jun 2011 17:57:15 +0900 | Cezary Kaliszyk | constants with the same names | changeset | files |
| Wed, 22 Jun 2011 04:49:56 +0900 | Cezary Kaliszyk | Quotients/TODO addtion | changeset | files |
| Tue, 21 Jun 2011 23:59:36 +0900 | Cezary Kaliszyk | Minor | changeset | files |
| Tue, 21 Jun 2011 10:39:25 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Tue, 21 Jun 2011 10:37:43 +0900 | Cezary Kaliszyk | spelling | changeset | files |
| Mon, 20 Jun 2011 20:09:51 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Mon, 20 Jun 2011 20:08:16 +0900 | Cezary Kaliszyk | Abs_set_fcb | changeset | files |
| Mon, 20 Jun 2011 20:09:30 +0900 | Cezary Kaliszyk | function for let-rec | changeset | files |
| Mon, 20 Jun 2011 10:16:12 +0900 | Cezary Kaliszyk | TODO/minor | changeset | files |
| Mon, 20 Jun 2011 09:59:18 +0900 | Cezary Kaliszyk | Move lst_fcb to Nominal2_Abs | changeset | files |
| Mon, 20 Jun 2011 09:38:57 +0900 | Cezary Kaliszyk | More minor TODOs | changeset | files |
| Mon, 20 Jun 2011 09:36:16 +0900 | Cezary Kaliszyk | Update TODO | changeset | files |
| Mon, 20 Jun 2011 09:29:42 +0900 | Cezary Kaliszyk | Let/minor | changeset | files |
| Mon, 20 Jun 2011 08:50:13 +0900 | Cezary Kaliszyk | Update Quotient/TODO and remove some attic code | changeset | files |
| Sun, 19 Jun 2011 13:14:37 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Sun, 19 Jun 2011 13:10:15 +0900 | Cezary Kaliszyk | little on cps2 | changeset | files |
| Thu, 16 Jun 2011 20:07:03 +0100 | Christian Urban | got rid of the boolean flag in the raw_equivariance function | changeset | files |
| Thu, 16 Jun 2011 23:11:50 +0900 | Cezary Kaliszyk | Fix | changeset | files |
| Thu, 16 Jun 2011 22:00:52 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Thu, 16 Jun 2011 21:23:38 +0900 | Cezary Kaliszyk | CPS3 can be defined with eqvt_rhs. | changeset | files |
| Thu, 16 Jun 2011 13:32:36 +0100 | Christian Urban | moved for the moment CPS translations into the example directory | changeset | files |
| Thu, 16 Jun 2011 13:14:53 +0100 | Christian Urban | merged | changeset | files |
| Thu, 16 Jun 2011 13:14:16 +0100 | Christian Urban | added eqvt_at and invariant for boths sides of the equations | changeset | files |
| Thu, 16 Jun 2011 20:56:30 +0900 | Cezary Kaliszyk | Added the CPS translation experiments. CPS1 comes with all the proofs, CPS2,3 just have the function and need eqvt_rhs to finish the obligations. | changeset | files |
| Thu, 16 Jun 2011 12:12:25 +0100 | Christian Urban | added a test that every function must be of pt-sort | changeset | files |
| Thu, 16 Jun 2011 11:03:01 +0100 | Christian Urban | all tests work again | changeset | files |
| Wed, 15 Jun 2011 22:36:59 +0100 | Christian Urban | added size-lemmas to simplifier; as a result termination can be proved by the standard lexicographic_order method | changeset | files |
| Wed, 15 Jun 2011 12:52:48 +0100 | Christian Urban | added an abstract | changeset | files |
| Wed, 15 Jun 2011 12:32:40 +0100 | Christian Urban | added a stub for function paper; "isabelle make fnpaper" | changeset | files |
| Wed, 15 Jun 2011 11:06:48 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Wed, 15 Jun 2011 11:06:31 +0900 | Cezary Kaliszyk | one TODO and one Problem? | changeset | files |
| Wed, 15 Jun 2011 09:51:26 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Wed, 15 Jun 2011 09:50:53 +0900 | Cezary Kaliszyk | Some TODOs | changeset | files |
| Wed, 15 Jun 2011 09:31:59 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Wed, 15 Jun 2011 09:25:36 +0900 | Cezary Kaliszyk | TypeSchemes work with 'default'. | changeset | files |
| Tue, 14 Jun 2011 19:11:44 +0100 | Christian Urban | tuned some proofs | changeset | files |
| Tue, 14 Jun 2011 14:07:07 +0100 | Christian Urban | fixed the problem when giving a complex default-term; the fundef lemmas in Nominal_Base were not general enough | changeset | files |
| Tue, 14 Jun 2011 11:43:06 +0100 | Christian Urban | tuned | changeset | files |
| Fri, 10 Jun 2011 15:52:17 +0900 | Cezary Kaliszyk | Move working examples before non-working ones | changeset | files |
| Fri, 10 Jun 2011 15:45:49 +0900 | Cezary Kaliszyk | Optimized proofs and removed some garbage. | changeset | files |
| Fri, 10 Jun 2011 15:31:14 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Fri, 10 Jun 2011 15:30:09 +0900 | Cezary Kaliszyk | Slightly modify fcb for list1 and put in common place. | changeset | files |
| Fri, 10 Jun 2011 09:00:24 +0900 | Cezary Kaliszyk | Experiments with Let | changeset | files |
| Thu, 09 Jun 2011 15:34:51 +0900 | Cezary Kaliszyk | Eval can be defined with additional freshness | changeset | files |
| Thu, 09 Jun 2011 15:03:58 +0900 | Cezary Kaliszyk | Minor simplification | changeset | files |
| Thu, 09 Jun 2011 11:10:41 +0900 | Cezary Kaliszyk | abs_res_fcb will be enough to finish the multiple-recursive proof, if we have a working 'default'. | changeset | files |
| Thu, 09 Jun 2011 09:44:51 +0900 | Cezary Kaliszyk | More experiments with 'default' | changeset | files |
| Wed, 08 Jun 2011 21:44:03 +0900 | Cezary Kaliszyk | Finished the proof with the invariant | changeset | files |
| Wed, 08 Jun 2011 21:32:35 +0900 | Cezary Kaliszyk | Issue with 'default' | changeset | files |
| Wed, 08 Jun 2011 12:30:56 +0100 | Christian Urban | merged | changeset | files |
| Wed, 08 Jun 2011 12:30:46 +0100 | Christian Urban | merged | changeset | files |
| Wed, 08 Jun 2011 08:44:01 +0100 | Christian Urban | using the option "default" the function package allows one to give an explicit default value | changeset | files |
| Wed, 08 Jun 2011 17:52:06 +0900 | Cezary Kaliszyk | Simpler proof of TypeSchemes/substs | changeset | files |
| Wed, 08 Jun 2011 17:25:54 +0900 | Cezary Kaliszyk | Simplify fcb_res | changeset | files |
| Wed, 08 Jun 2011 09:56:39 +0900 | Cezary Kaliszyk | FCB for res binding and simplified proof of subst for type schemes | changeset | files |
| Wed, 08 Jun 2011 07:06:20 +0900 | Cezary Kaliszyk | Simplify ln-trans proof | changeset | files |
| Wed, 08 Jun 2011 07:02:52 +0900 | Cezary Kaliszyk | cbvs can be easily defined without an invariant | changeset | files |
| Tue, 07 Jun 2011 20:58:00 +0100 | Christian Urban | defined the "count-bound-variables-occurences" function which has an accumulator like trans | changeset | files |