| 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
|