| Tue, 05 Jul 2011 18:01:54 +0200 |
Christian Urban |
side commment for future use
|
changeset |
files
|
| Tue, 05 Jul 2011 16:22:18 +0200 |
Christian Urban |
made the tests go through again
|
changeset |
files
|
| Tue, 05 Jul 2011 15:01:10 +0200 |
Christian Urban |
added another example which seems difficult to define
|
changeset |
files
|
| Tue, 05 Jul 2011 15:00:41 +0200 |
Christian Urban |
added a tactic "all_trivials" which simplifies all trivial constructor cases and leaves the others untouched.
|
changeset |
files
|
| Tue, 05 Jul 2011 04:23:33 +0200 |
Christian Urban |
merged
|
changeset |
files
|
| Tue, 05 Jul 2011 04:19:02 +0200 |
Christian Urban |
all FCB lemmas
|
changeset |
files
|
| Tue, 05 Jul 2011 04:18:45 +0200 |
Christian Urban |
exported various FCB-lemmas to a separate file
|
changeset |
files
|
| Tue, 05 Jul 2011 10:13:34 +0900 |
Cezary Kaliszyk |
Express trans_db with Option.map and Option.bind. Possibly mbind is a copy of bind?
|
changeset |
files
|
| Tue, 05 Jul 2011 09:28:16 +0900 |
Cezary Kaliszyk |
Define a version of aux only for same binders. Completeness is fine.
|
changeset |
files
|
| Tue, 05 Jul 2011 09:26:20 +0900 |
Cezary Kaliszyk |
Move If / Let with 'True' to the end of Lambda
|
changeset |
files
|
| Mon, 04 Jul 2011 23:56:19 +0200 |
Christian Urban |
merged
|
changeset |
files
|
| Mon, 04 Jul 2011 23:55:46 +0200 |
Christian Urban |
tuned
|
changeset |
files
|
| Mon, 04 Jul 2011 23:54:05 +0200 |
Christian Urban |
added an example that recurses over two arguments; the interesting proof-obligation is not yet done
|
changeset |
files
|
| Mon, 04 Jul 2011 14:47:21 +0900 |
Cezary Kaliszyk |
Let with a different invariant; not true.
|
changeset |
files
|
| Sun, 03 Jul 2011 21:04:46 +0900 |
Cezary Kaliszyk |
Add non-working Lambda_F_T using FCB2
|
changeset |
files
|
| Sun, 03 Jul 2011 21:04:06 +0900 |
Cezary Kaliszyk |
Added non-working CPS3 using FCB2
|
changeset |
files
|
| Sun, 03 Jul 2011 21:01:07 +0900 |
Cezary Kaliszyk |
Change CPS1 to FCB2
|
changeset |
files
|
| Sat, 02 Jul 2011 12:40:59 +0900 |
Cezary Kaliszyk |
Did the proofs of height and subst for Let with list-like binders. Having apply_assns allows proving things by alpha_bn
|
changeset |
files
|
| Sat, 02 Jul 2011 00:27:47 +0100 |
Christian Urban |
side-by-side tests of lets with single assignment; deep-binder case works if the recursion is avoided using an auxiliary function
|
changeset |
files
|
| Fri, 01 Jul 2011 17:46:15 +0900 |
Cezary Kaliszyk |
Exhaust Issue
|
changeset |
files
|
| Thu, 30 Jun 2011 11:05:25 +0100 |
Christian Urban |
clarified a sentence
|
changeset |
files
|
| Thu, 30 Jun 2011 02:19:59 +0100 |
Christian Urban |
more code refactoring
|
changeset |
files
|
| Wed, 29 Jun 2011 23:08:44 +0100 |
Christian Urban |
combined distributed data for alpha in alpha_result (partially done)
|
changeset |
files
|
| Wed, 29 Jun 2011 19:21:26 +0100 |
Christian Urban |
moved Classical and Let temporarily into a section where "sorry" is allowed; this makes all test go through
|
changeset |
files
|
| 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
|