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
|