| 2014-05-19 |
Christian Urban |
changed nominal_primrec to nominal_function and termination to nominal_termination
|
file |
diff |
annotate
|
| 2014-05-19 |
Christian Urban |
changed nominal_primrec into the more appropriate nominal_function
|
file |
diff |
annotate
|
| 2012-08-07 |
Christian Urban |
definition of an auxiliary graph in nominal-primrec definitions
|
file |
diff |
annotate
|
| 2012-07-15 |
Christian Urban |
added a simproc for alpha-equivalence to the simplifier
|
file |
diff |
annotate
|
| 2012-06-04 |
Christian Urban |
added permutation simplification to the simplifier; this makes the simplifier more powerful, but it potentially loops more often
|
file |
diff |
annotate
|
| 2011-12-17 |
Christian Urban |
cleaned examples for stable branch
Nominal2-Isabelle2011-1
|
file |
diff |
annotate
|
| 2011-07-19 |
Christian Urban |
preliminary version of automatically generation the eqvt-lemmas for functions defined with nominal_primrec
|
file |
diff |
annotate
|
| 2011-07-18 |
Christian Urban |
added a flag (eqvt) to termination proofs arising fron nominal_primrecs
|
file |
diff |
annotate
|
| 2011-07-05 |
Christian Urban |
changed bind to binds in specifications; bind will cause trouble with Monad_Syntax
|
file |
diff |
annotate
|
| 2011-07-05 |
Christian Urban |
added another example which seems difficult to define
|
file |
diff |
annotate
|
| 2011-07-05 |
Christian Urban |
exported various FCB-lemmas to a separate file
|
file |
diff |
annotate
|
| 2011-06-29 |
Christian Urban |
moved Classical and Let temporarily into a section where "sorry" is allowed; this makes all test go through
|
file |
diff |
annotate
|
| 2011-06-28 |
Cezary Kaliszyk |
Experiments with res
|
file |
diff |
annotate
|
| 2011-06-27 |
Christian Urban |
proved the fcb also for sets (no restriction yet)
|
file |
diff |
annotate
|
| 2011-06-27 |
Christian Urban |
streamlined the fcb-proof and made fcb1 a special case of fcb
|
file |
diff |
annotate
|
| 2011-06-27 |
Christian Urban |
completed proof in Classical; the fcb lemma works for any list of atoms (despite what was written earlier)
|
file |
diff |
annotate
|
| 2011-06-27 |
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
|
| 2011-06-26 |
Cezary Kaliszyk |
equality of lst_binder and a few helper lemmas
|
file |
diff |
annotate
|
| 2011-06-26 |
Christian Urban |
only one of the fcb precondistions are needed (probably the same with the perm-conditions)
|
file |
diff |
annotate
|
| 2011-06-26 |
Christian Urban |
another change to the fcb2; this is needed in order to get all proofs through in Lambda.thy
|
file |
diff |
annotate
|
| 2011-06-25 |
Christian Urban |
did all cases, except the multiple binder case
|
file |
diff |
annotate
|
| 2011-06-25 |
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
|
| 2011-06-24 |
Christian Urban |
except for the interated binder case, finished definition in Calssical.thy
|
file |
diff |
annotate
|
| 2011-06-24 |
Cezary Kaliszyk |
Speed-up the completeness proof.
|
file |
diff |
annotate
|
| 2011-06-23 |
Christian Urban |
the simplifier can simplify "sort (atom a)" if a is a concrete atom type declared with atom_decl
|
file |
diff |
annotate
|
| 2011-06-23 |
Christian Urban |
expanded the example
|
file |
diff |
annotate
|
| 2010-12-22 |
Christian Urban |
properly exported strong exhaust theorem; cleaned up some examples
|
file |
diff |
annotate
|
| 2010-08-29 |
Christian Urban |
renamed NewParser to Nominal2
|
file |
diff |
annotate
|