| 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.
|
file |
diff |
annotate
|
| Mon, 27 Jun 2011 04:01:55 +0900 |
Cezary Kaliszyk |
equality of lst_binder and a few helper lemmas
|
file |
diff |
annotate
|
| 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)
|
file |
diff |
annotate
|
| 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
|
file |
diff |
annotate
|
| Sat, 25 Jun 2011 22:51:43 +0100 |
Christian Urban |
did all cases, except the multiple binder case
|
file |
diff |
annotate
|
| 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.
|
file |
diff |
annotate
|
| Fri, 24 Jun 2011 09:42:44 +0100 |
Christian Urban |
except for the interated binder case, finished definition in Calssical.thy
|
file |
diff |
annotate
|
| Fri, 24 Jun 2011 10:12:47 +0900 |
Cezary Kaliszyk |
Speed-up the completeness proof.
|
file |
diff |
annotate
|
| 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
|
file |
diff |
annotate
|
| Thu, 23 Jun 2011 12:28:25 +0100 |
Christian Urban |
expanded the example
|
file |
diff |
annotate
|
| Wed, 22 Dec 2010 09:13:25 +0000 |
Christian Urban |
properly exported strong exhaust theorem; cleaned up some examples
|
file |
diff |
annotate
|
| Sun, 29 Aug 2010 13:36:03 +0800 |
Christian Urban |
renamed NewParser to Nominal2
|
file |
diff |
annotate
|
| Thu, 26 Aug 2010 02:08:00 +0800 |
Christian Urban |
cleaned up (almost completely) the examples
|
file |
diff |
annotate
|
| Wed, 25 Aug 2010 22:55:42 +0800 |
Christian Urban |
automatic lifting
|
file |
diff |
annotate
|
| Mon, 07 Jun 2010 11:43:01 +0200 |
Christian Urban |
work on transitivity proof
|
file |
diff |
annotate
|
| Wed, 02 Jun 2010 11:37:51 +0200 |
Christian Urban |
fixed problem with bn_info
|
file |
diff |
annotate
|
| Wed, 12 May 2010 16:59:53 +0100 |
Christian Urban |
fixed the examples for the new eqvt-procedure....temporarily disabled Manual/Term4.thy
|
file |
diff |
annotate
|
| Wed, 12 May 2010 16:57:01 +0200 |
Cezary Kaliszyk |
include set_simps and append_simps in fv_rsp
|
file |
diff |
annotate
|
| Wed, 12 May 2010 16:32:44 +0200 |
Cezary Kaliszyk |
Use equivariance instead of alpha_eqvt
|
file |
diff |
annotate
|
| Tue, 11 May 2010 18:20:25 +0200 |
Cezary Kaliszyk |
Include raw permutation definitions in eqvt
|
file |
diff |
annotate
|
| Tue, 11 May 2010 17:16:57 +0200 |
Cezary Kaliszyk |
Declare alpha_gen_eqvt as eqvt and change the proofs that used 'eqvts[symmetric]'
|
file |
diff |
annotate
|
| Wed, 05 May 2010 10:24:54 +0100 |
Christian Urban |
solved the problem with equivariance by first eta-normalising the goal
|
file |
diff |
annotate
|
| Mon, 03 May 2010 15:47:30 +0200 |
Cezary Kaliszyk |
Added cheats to classical
|
file |
diff |
annotate
|
| Sun, 02 May 2010 14:06:26 +0100 |
Christian Urban |
attempted to remove dependency on (old) Fv and (old) Parser; lifting still uses Fv.thy; the examples do not work at the moment (with equivp proofs failing)
|
file |
diff |
annotate
|
| Fri, 16 Apr 2010 16:29:11 +0200 |
Christian Urban |
automatic proofs for equivariance of alphas
|
file |
diff |
annotate
|
| Thu, 08 Apr 2010 11:40:13 +0200 |
Christian Urban |
properly separated the example from my PhD and gave the correct alpha-equivalence relation (according to the paper)
|
file |
diff |
annotate
|