| Wed, 29 Jun 2011 17:01:09 +0100 | Christian Urban | added a warning if a theorem is already declared as equivariant | changeset | files |
| Wed, 29 Jun 2011 16:44:54 +0100 | Christian Urban | merged | changeset | files |
| Wed, 29 Jun 2011 13:04:24 +0900 | Cezary Kaliszyk | Prove bn injectivity and experiment more with Let | changeset | files |
| Wed, 29 Jun 2011 00:48:50 +0100 | Christian Urban | some experiments | changeset | files |
| Tue, 28 Jun 2011 14:45:30 +0900 | Cezary Kaliszyk | trying new fcb in let/subst | changeset | files |
| Tue, 28 Jun 2011 14:30:30 +0900 | Cezary Kaliszyk | Leftover only inj and eqvt | changeset | files |
| Tue, 28 Jun 2011 14:18:26 +0900 | Cezary Kaliszyk | eapply fcb ok | changeset | files |
| Tue, 28 Jun 2011 14:01:15 +0900 | Cezary Kaliszyk | Removed Inl and Inr | changeset | files |
| Tue, 28 Jun 2011 14:49:48 +0100 | Christian Urban | relaxed type in fcb | changeset | files |
| Tue, 28 Jun 2011 14:34:07 +0100 | Christian Urban | fcb with explicit bn function | changeset | files |
| Tue, 28 Jun 2011 14:01:52 +0100 | Christian Urban | added let-rec example | changeset | files |
| Tue, 28 Jun 2011 12:36:34 +0900 | Cezary Kaliszyk | Experiments with res | changeset | files |
| Tue, 28 Jun 2011 00:48:57 +0100 | Christian Urban | proved the fcb also for sets (no restriction yet) | changeset | files |
| Tue, 28 Jun 2011 00:30:30 +0100 | Christian Urban | copied all work to Lambda.thy; had to derive a special version of fcb1 for concrete atom | changeset | files |
| Mon, 27 Jun 2011 22:51:42 +0100 | Christian Urban | streamlined the fcb-proof and made fcb1 a special case of fcb | changeset | files |
| Mon, 27 Jun 2011 19:22:10 +0100 | Christian Urban | completed proof in Classical; the fcb lemma works for any list of atoms (despite what was written earlier) | changeset | files |
| Mon, 27 Jun 2011 19:15:18 +0100 | Christian Urban | fcb for multible (list) binders; at the moment all of them have to have the same sort (at-class); this should also work for set binders, but not yet for restriction. | changeset | files |
| Mon, 27 Jun 2011 19:13:55 +0100 | Christian Urban | renamed ds to dset (disagreement set) | changeset | files |
| Mon, 27 Jun 2011 12:15:21 +0100 | Christian Urban | added small lemma about disagreement set | changeset | files |
| Mon, 27 Jun 2011 08:42:02 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Mon, 27 Jun 2011 08:38:54 +0900 | Cezary Kaliszyk | New-style fcb for multiple binders. | changeset | files |
| Mon, 27 Jun 2011 04:01:55 +0900 | Cezary Kaliszyk | equality of lst_binder and a few helper lemmas | changeset | files |
| Sun, 26 Jun 2011 21:42:07 +0100 | Christian Urban | only one of the fcb precondistions are needed (probably the same with the perm-conditions) | changeset | files |
| Sun, 26 Jun 2011 17:55:22 +0100 | Christian Urban | another change to the fcb2; this is needed in order to get all proofs through in Lambda.thy | changeset | files |
| Sat, 25 Jun 2011 22:51:43 +0100 | Christian Urban | did all cases, except the multiple binder case | changeset | files |
| Sat, 25 Jun 2011 21:28:24 +0100 | Christian Urban | an alternative FCB for Abs_lst1; seems simpler but not as simple as I thought; not sure whether it generalises to multiple binders. | changeset | files |
| Fri, 24 Jun 2011 09:42:44 +0100 | Christian Urban | except for the interated binder case, finished definition in Calssical.thy | changeset | files |
| Fri, 24 Jun 2011 11:18:18 +0900 | Cezary Kaliszyk | Make examples work with non-precompiled image | changeset | files |
| Fri, 24 Jun 2011 11:15:22 +0900 | Cezary Kaliszyk | Remove Lambda_add.thy | changeset | files |
| Fri, 24 Jun 2011 11:14:58 +0900 | Cezary Kaliszyk | The examples in Lambda_add can be defined by nominal_function directly | changeset | files |
| Fri, 24 Jun 2011 11:03:53 +0900 | Cezary Kaliszyk | Theory name changes for JEdit | changeset | files |
| Fri, 24 Jun 2011 10:54:31 +0900 | Cezary Kaliszyk | More usual names for substitution properties | changeset | files |
| Fri, 24 Jun 2011 10:30:06 +0900 | Cezary Kaliszyk | Second Fixed Point Theorem | changeset | files |
| Fri, 24 Jun 2011 10:12:47 +0900 | Cezary Kaliszyk | Speed-up the completeness proof. | changeset | files |
| Thu, 23 Jun 2011 22:21:43 +0100 | Christian Urban | the simplifier can simplify "sort (atom a)" if a is a concrete atom type declared with atom_decl | changeset | files |
| Thu, 23 Jun 2011 13:09:17 +0100 | Christian Urban | added file | changeset | files |
| Thu, 23 Jun 2011 12:28:25 +0100 | Christian Urban | expanded the example | changeset | files |
| Thu, 23 Jun 2011 11:30:39 +0100 | Christian Urban | fixed nasty bug with type variables in nominal_datatypes; this included to be careful with the output of the inductive and function package | changeset | files |
| Wed, 22 Jun 2011 14:14:54 +0100 | Christian Urban | tuned | changeset | files |
| 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 |
| Tue, 07 Jun 2011 17:45:38 +0100 | Christian Urban | merged | changeset | files |
| Tue, 07 Jun 2011 23:42:12 +0900 | Cezary Kaliszyk | remove garbage (proofs that assumes the invariant outside function) | changeset | files |
| Tue, 07 Jun 2011 23:38:39 +0900 | Cezary Kaliszyk | Proof of trans with invariant | changeset | files |
| Tue, 07 Jun 2011 23:22:58 +0900 | Cezary Kaliszyk | Testing invariant in Lambda_F_T | changeset | files |
| Tue, 07 Jun 2011 10:40:06 +0100 | Christian Urban | cleaned ups a bit the examples with the invariant framework; exported nominal_function_config datatype into separate structure and file | changeset | files |
| Tue, 07 Jun 2011 08:52:59 +0100 | Christian Urban | fixed problem with earlier commit about nominal_function_common; added facility for specifying an invariant - added a definition of frees_set which need a finiteness invariant | changeset | files |
| Mon, 06 Jun 2011 13:11:04 +0100 | Christian Urban | slightly stronger property in fundef_ex_prop | changeset | files |
| Sun, 05 Jun 2011 21:14:23 +0100 | Christian Urban | added an option for an invariant (at the moment only a stub) | changeset | files |
| Sun, 05 Jun 2011 16:58:18 +0100 | Christian Urban | added a more general lemma fro fundef_ex1 | changeset | files |
| Sat, 04 Jun 2011 14:50:57 +0900 | Cezary Kaliszyk | Trying the induction on the graph | changeset | files |
| Sat, 04 Jun 2011 09:07:50 +0900 | Cezary Kaliszyk | Finish and test the locale approach | changeset | files |
| Fri, 03 Jun 2011 22:31:44 +0900 | Cezary Kaliszyk | FiniteSupp precondition in the function is enough to get rid of completeness obligationss | changeset | files |
| Fri, 03 Jun 2011 12:46:23 +0100 | Christian Urban | recursion combinator inside a locale | changeset | files |
| Fri, 03 Jun 2011 18:33:11 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Fri, 03 Jun 2011 18:32:22 +0900 | Cezary Kaliszyk | F for lambda used to define translation to locally nameless | changeset | files |
| Thu, 02 Jun 2011 16:15:18 +0100 | Christian Urban | typo | changeset | files |
| Thu, 02 Jun 2011 15:35:33 +0100 | Christian Urban | removed dead code | changeset | files |
| Thu, 02 Jun 2011 22:24:33 +0900 | Cezary Kaliszyk | finished the missing obligations | changeset | files |
| Thu, 02 Jun 2011 12:14:03 +0100 | Christian Urban | merged | changeset | files |
| Thu, 02 Jun 2011 12:09:31 +0100 | Christian Urban | a test with a recursion combinator defined on top of nominal_primrec | changeset | files |
| Thu, 02 Jun 2011 16:41:09 +0900 | Cezary Kaliszyk | Use FCB to simplify proof | changeset | files |
| Thu, 02 Jun 2011 10:11:50 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Thu, 02 Jun 2011 10:09:23 +0900 | Cezary Kaliszyk | Remove SMT | changeset | files |
| Wed, 01 Jun 2011 22:55:14 +0100 | Christian Urban | hopefully final fix for ho-functions | changeset | files |
| Wed, 01 Jun 2011 21:03:30 +0100 | Christian Urban | first test to fix the problem with free variables | changeset | files |
| Wed, 01 Jun 2011 16:13:42 +0900 | Cezary Kaliszyk | proved subst for All constructor in type schemes. | changeset | files |
| Wed, 01 Jun 2011 13:41:30 +0900 | Cezary Kaliszyk | DB translation using index; easier to reason about. | changeset | files |
| Wed, 01 Jun 2011 13:35:37 +0900 | Cezary Kaliszyk | Problem: free variables in the goal | changeset | files |
| Wed, 01 Jun 2011 11:01:39 +0900 | Cezary Kaliszyk | fixed previous commit | changeset | files |
| Wed, 01 Jun 2011 10:59:07 +0900 | Cezary Kaliszyk | equivariance of db_trans | changeset | files |
| Tue, 31 May 2011 12:22:28 +0100 | Christian Urban | fixed the problem with cps-like functions | changeset | files |
| Tue, 31 May 2011 14:12:31 +0900 | Cezary Kaliszyk | DeBruijn translation in a simplifier friendly way | changeset | files |
| Tue, 31 May 2011 13:25:35 +0900 | Cezary Kaliszyk | map_term can be defined when equivariance is assumed | changeset | files |
| Tue, 31 May 2011 13:21:00 +0900 | Cezary Kaliszyk | map_term is not a function the way it is defined | changeset | files |
| Tue, 31 May 2011 12:59:10 +0900 | Cezary Kaliszyk | Defined translation from nominal to de-Bruijn; with a freshness condition for the lambda case. | changeset | files |
| Tue, 31 May 2011 12:54:21 +0900 | Cezary Kaliszyk | Simple eqvt proofs with perm_simps for clarity | changeset | files |
| Tue, 31 May 2011 00:36:16 +0100 | Christian Urban | tuned last commit | changeset | files |
| Tue, 31 May 2011 00:17:22 +0100 | Christian Urban | functions involving if and case do not throw exceptions anymore; but eqvt_at assumption has now a precondition | changeset | files |
| Thu, 26 May 2011 06:36:29 +0200 | Christian Urban | updated to new Isabelle | changeset | files |
| Wed, 25 May 2011 21:38:50 +0200 | Christian Urban | added eq_iff and distinct lemmas of nominal datatypes to the simplifier | changeset | files |
| Tue, 24 May 2011 19:39:38 +0200 | Christian Urban | more on slides | changeset | files |
| Sun, 22 May 2011 10:20:18 +0200 | Christian Urban | added slides for copenhagen | changeset | files |
| Sat, 14 May 2011 10:16:16 +0100 | Christian Urban | added a problem with inductive_cases (reported by Randy) | changeset | files |
| Fri, 13 May 2011 14:50:17 +0100 | Christian Urban | misc | changeset | files |
| Tue, 10 May 2011 17:10:22 +0100 | Christian Urban | made the subtyping work again | changeset | files |
| Tue, 10 May 2011 07:47:06 +0100 | Christian Urban | updated to new Isabelle (> 9 May) | changeset | files |
| Mon, 09 May 2011 04:49:58 +0100 | Christian Urban | merged | changeset | files |
| Tue, 03 May 2011 15:39:30 +0100 | Christian Urban | added two mutual recursive inductive definitions | changeset | files |
| Tue, 03 May 2011 13:25:02 +0100 | Christian Urban | deleted two functions from the API | changeset | files |
| Tue, 03 May 2011 13:09:08 +0100 | Christian Urban | proved that lfp is equivariant (that simplifies equivariance proofs of inductively defined predicates) | changeset | files |
| Mon, 09 May 2011 04:46:43 +0100 | Christian Urban | more on pearl-paper | changeset | files |
| Wed, 04 May 2011 15:27:04 +0800 | Christian Urban | more on pearl-paper | changeset | files |
| Mon, 02 May 2011 13:01:02 +0800 | Christian Urban | updated Quotient paper so that it compiles again | changeset | files |
| Thu, 28 Apr 2011 11:51:01 +0800 | Christian Urban | merged | changeset | files |
| Thu, 28 Apr 2011 11:44:36 +0800 | Christian Urban | added slides for beijing | changeset | files |
| Fri, 22 Apr 2011 00:18:25 +0800 | Christian Urban | more to the pearl paper | changeset | files |
| Tue, 19 Apr 2011 13:03:08 +0100 | Christian Urban | updated to snapshot Isabelle 19 April | changeset | files |
| Mon, 18 Apr 2011 15:57:45 +0100 | Christian Urban | merged | changeset | files |
| Mon, 18 Apr 2011 15:56:07 +0100 | Christian Urban | added permute_pure back into the nominal_inductive procedure; updated to Isabelle 17 April | changeset | files |
| Fri, 15 Apr 2011 15:20:56 +0900 | Cezary Kaliszyk | New way of forward elimination of Abs1_eq and simplifications of the function obligation proofs. | changeset | files |
| Wed, 13 Apr 2011 13:44:25 +0100 | Christian Urban | merged | changeset | files |
| Wed, 13 Apr 2011 13:41:52 +0100 | Christian Urban | introduced framework for finetuning eqvt-rules; this solves problem with permute_pure called in nominal_inductive | changeset | files |
| Tue, 12 Apr 2011 15:46:35 +0800 | Christian Urban | shanghai slides | changeset | files |
| Mon, 11 Apr 2011 02:25:25 +0100 | Christian Urban | pictures for slides | changeset | files |
| Mon, 11 Apr 2011 02:04:11 +0100 | Christian Urban | Shanghai slides | changeset | files |
| Sun, 10 Apr 2011 14:13:55 +0800 | Christian Urban | more paper | changeset | files |
| Sun, 10 Apr 2011 07:41:52 +0800 | Christian Urban | eqvt of supp and fresh is proved using equivariance infrastructure | changeset | files |
| Sun, 10 Apr 2011 04:07:15 +0800 | Christian Urban | more paper | changeset | files |
| Sat, 09 Apr 2011 13:44:49 +0800 | Christian Urban | more on the paper | changeset | files |
| Sat, 09 Apr 2011 00:29:40 +0100 | Christian Urban | tuned paper | changeset | files |
| Sat, 09 Apr 2011 00:28:53 +0100 | Christian Urban | tuned paper | changeset | files |
| Sat, 09 Apr 2011 02:10:49 +0800 | Christian Urban | typo | changeset | files |
| Fri, 08 Apr 2011 14:23:28 +0800 | Christian Urban | more on paper | changeset | files |
| Fri, 08 Apr 2011 03:47:50 +0800 | Christian Urban | eqvt_lambda without eta-expansion | changeset | files |
| Wed, 06 Apr 2011 13:47:08 +0100 | Christian Urban | changed default preprocessor that does not catch variables only occuring on the right | changeset | files |
| Thu, 31 Mar 2011 15:25:35 +0200 | Christian Urban | final version of slides | changeset | files |
| Wed, 30 Mar 2011 22:27:26 +0200 | Christian Urban | more on the slides | changeset | files |
| Wed, 30 Mar 2011 08:11:36 +0200 | Christian Urban | tuned IsaMakefile | changeset | files |
| Tue, 29 Mar 2011 23:52:14 +0200 | Christian Urban | rearranged directories and updated to new Isabelle | changeset | files |
| Wed, 16 Mar 2011 21:14:43 +0100 | Christian Urban | precise path to LaTeXsugar | changeset | files |
| Wed, 16 Mar 2011 21:07:50 +0100 | Christian Urban | a lit bit more on the pearl-jv paper | changeset | files |
| Wed, 16 Mar 2011 20:42:14 +0100 | Christian Urban | ported changes from function package....needs Isabelle 16 March or above | changeset | files |
| Tue, 15 Mar 2011 00:40:39 +0100 | Christian Urban | more on the pearl paper | changeset | files |
| Mon, 14 Mar 2011 16:35:59 +0100 | Christian Urban | equivariance for All and Ex can be proved in terms of their definition | changeset | files |
| Fri, 11 Mar 2011 08:51:39 +0000 | Christian Urban | more on the paper | changeset | files |
| Tue, 08 Mar 2011 09:07:49 +0000 | Christian Urban | merged | changeset | files |
| Tue, 08 Mar 2011 09:07:27 +0000 | Christian Urban | more on the pearl paper | changeset | files |
| Wed, 02 Mar 2011 16:07:56 +0900 | Cezary Kaliszyk | distinct names at toplevel | changeset | files |
| Wed, 02 Mar 2011 12:49:01 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Wed, 02 Mar 2011 12:48:00 +0900 | Cezary Kaliszyk | Pairing function | changeset | files |
| Wed, 02 Mar 2011 00:06:28 +0000 | Christian Urban | updated pearl papers | changeset | files |
| Tue, 01 Mar 2011 00:14:02 +0000 | Christian Urban | a bit more tuning | changeset | files |
| Mon, 28 Feb 2011 16:47:13 +0000 | Christian Urban | included old test cases for perm_simp into ROOT.ML file | changeset | files |
| Mon, 28 Feb 2011 15:21:10 +0000 | Christian Urban | split the library into a basics file; merged Nominal_Eqvt into Nominal_Base | changeset | files |
| Fri, 25 Feb 2011 21:23:30 +0000 | Christian Urban | some slight polishing | changeset | files |
| Thu, 24 Feb 2011 18:50:02 +0000 | Christian Urban | merged | changeset | files |
| Thu, 24 Feb 2011 16:26:11 +0000 | Christian Urban | added a lemma about fresh_star and Abs | changeset | files |
| Wed, 23 Feb 2011 11:11:02 +0900 | Cezary Kaliszyk | Reduce the definition of trans to FCB; test that FCB can be proved with simp rules. | changeset | files |
| Sat, 19 Feb 2011 09:31:22 +0900 | Cezary Kaliszyk | typeschemes/subst | changeset | files |
| Thu, 17 Feb 2011 17:02:25 +0900 | Cezary Kaliszyk | further experiments with typeschemes subst | changeset | files |
| Thu, 17 Feb 2011 12:01:08 +0900 | Cezary Kaliszyk | Finished the proof of a function that invents fresh variable names. | changeset | files |
| Wed, 16 Feb 2011 14:44:33 +0000 | Christian Urban | added eqvt for length | changeset | files |
| Wed, 16 Feb 2011 14:03:26 +0000 | Christian Urban | added eqvt lemmas for filter and distinct | changeset | files |
| Mon, 07 Feb 2011 16:00:24 +0000 | Christian Urban | added eqvt for cartesian products | changeset | files |
| Mon, 07 Feb 2011 15:59:37 +0000 | Christian Urban | cleaned up the experiments so that the tests go through | changeset | files |
| Sat, 05 Feb 2011 07:39:00 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Sat, 05 Feb 2011 07:38:22 +0900 | Cezary Kaliszyk | Experiments defining a function on Let | changeset | files |
| Fri, 04 Feb 2011 04:45:04 +0000 | Christian Urban | updated TODO | changeset | files |
| Fri, 04 Feb 2011 03:52:38 +0000 | Christian Urban | Lambda.thy which works with Nominal_Isabelle2011 | changeset | files |
| Thu, 03 Feb 2011 02:57:04 +0000 | Christian Urban | merged | changeset | files |
| Thu, 03 Feb 2011 02:51:57 +0000 | Christian Urban | removed diagnostic code | changeset | files |
| Tue, 01 Feb 2011 09:07:55 +0900 | Cezary Kaliszyk | Only one of the subgoals is needed | changeset | files |
| Tue, 01 Feb 2011 08:57:50 +0900 | Cezary Kaliszyk | Experiments with substitution on set+ | changeset | files |
| Tue, 01 Feb 2011 08:48:14 +0900 | Cezary Kaliszyk | More properties that relate abs_res and abs_set. Also abs_res with less binders. | changeset | files |
| Sun, 30 Jan 2011 12:09:23 +0900 | Cezary Kaliszyk | alpha_res implies alpha_set :) | changeset | files |
| Sun, 30 Jan 2011 09:57:37 +0900 | Cezary Kaliszyk | Showing that the binders difference is fresh for the left side solves the goal for 'set'. | changeset | files |
| Sat, 29 Jan 2011 14:26:47 +0900 | Cezary Kaliszyk | Experiments with functions | changeset | files |
| Thu, 27 Jan 2011 20:19:13 +0100 | Christian Urban | some experiments | changeset | files |
| Thu, 27 Jan 2011 04:24:17 +0100 | Christian Urban | the proofs with eqvt_at | changeset | files |
| Tue, 25 Jan 2011 18:58:26 +0100 | Christian Urban | made eqvt-proof explicit in the function definitions | changeset | files |
| Tue, 25 Jan 2011 02:51:44 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Tue, 25 Jan 2011 02:46:05 +0900 | Cezary Kaliszyk | minor | changeset | files |
| Tue, 25 Jan 2011 02:42:15 +0900 | Cezary Kaliszyk | Down as infixr | changeset | files |
| Sat, 22 Jan 2011 23:24:20 -0600 | Christian Urban | added some slides | changeset | files |
| Sun, 23 Jan 2011 03:29:22 +0100 | Christian Urban | added Tutorial6 | changeset | files |
| Sat, 22 Jan 2011 18:59:48 -0600 | Christian Urban | cleaning up | changeset | files |
| Sat, 22 Jan 2011 16:37:00 -0600 | Christian Urban | merged | changeset | files |
| Sat, 22 Jan 2011 16:36:21 -0600 | Christian Urban | cleaned up Tutorial 3 with solutions | changeset | files |
| Sun, 23 Jan 2011 07:32:28 +0900 | Cezary Kaliszyk | Missing val.simps | changeset | files |
| Sun, 23 Jan 2011 07:17:35 +0900 | Cezary Kaliszyk | merge | changeset | files |
| Sun, 23 Jan 2011 07:15:59 +0900 | Cezary Kaliszyk | Tutorial 4s | changeset | files |
| Sat, 22 Jan 2011 16:04:40 -0600 | Christian Urban | cleaned up and solution section | changeset | files |
| Sat, 22 Jan 2011 15:07:36 -0600 | Christian Urban | cleaned up tutorial1...added solution file | changeset | files |
| Sat, 22 Jan 2011 12:46:01 -0600 | Christian Urban | better version of Tutorial 1 | changeset | files |
| Fri, 21 Jan 2011 22:58:03 +0100 | Christian Urban | better flow of proofs and definitions and proof | changeset | files |
| Fri, 21 Jan 2011 22:23:44 +0100 | Christian Urban | separated type preservation and progress into a separate file | changeset | files |
| Fri, 21 Jan 2011 22:02:34 +0100 | Christian Urban | substitution lemma in separate file | changeset | files |
| Fri, 21 Jan 2011 21:58:51 +0100 | Christian Urban | added unbind example | changeset | files |
| Fri, 21 Jan 2011 00:55:28 +0100 | Christian Urban | a bit tuning | changeset | files |
| Thu, 20 Jan 2011 23:19:30 +0100 | Christian Urban | first split of tutorrial theory | changeset | files |
| Wed, 19 Jan 2011 23:58:12 +0100 | Christian Urban | added a very rough version of the tutorial; all seems to work | changeset | files |