| 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
|
| Tue, 14 Jun 2011 11:43:06 +0100 |
Christian Urban |
tuned
|
changeset |
files
|
| Fri, 10 Jun 2011 15:52:17 +0900 |
Cezary Kaliszyk |
Move working examples before non-working ones
|
changeset |
files
|
| Fri, 10 Jun 2011 15:45:49 +0900 |
Cezary Kaliszyk |
Optimized proofs and removed some garbage.
|
changeset |
files
|
| Fri, 10 Jun 2011 15:31:14 +0900 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| Fri, 10 Jun 2011 15:30:09 +0900 |
Cezary Kaliszyk |
Slightly modify fcb for list1 and put in common place.
|
changeset |
files
|
| Fri, 10 Jun 2011 09:00:24 +0900 |
Cezary Kaliszyk |
Experiments with Let
|
changeset |
files
|
| Thu, 09 Jun 2011 15:34:51 +0900 |
Cezary Kaliszyk |
Eval can be defined with additional freshness
|
changeset |
files
|
| Thu, 09 Jun 2011 15:03:58 +0900 |
Cezary Kaliszyk |
Minor simplification
|
changeset |
files
|
| Thu, 09 Jun 2011 11:10:41 +0900 |
Cezary Kaliszyk |
abs_res_fcb will be enough to finish the multiple-recursive proof, if we have a working 'default'.
|
changeset |
files
|
| Thu, 09 Jun 2011 09:44:51 +0900 |
Cezary Kaliszyk |
More experiments with 'default'
|
changeset |
files
|
| Wed, 08 Jun 2011 21:44:03 +0900 |
Cezary Kaliszyk |
Finished the proof with the invariant
|
changeset |
files
|
| Wed, 08 Jun 2011 21:32:35 +0900 |
Cezary Kaliszyk |
Issue with 'default'
|
changeset |
files
|
| Wed, 08 Jun 2011 12:30:56 +0100 |
Christian Urban |
merged
|
changeset |
files
|
| Wed, 08 Jun 2011 12:30:46 +0100 |
Christian Urban |
merged
|
changeset |
files
|
| Wed, 08 Jun 2011 08:44:01 +0100 |
Christian Urban |
using the option "default" the function package allows one to give an explicit default value
|
changeset |
files
|
| Wed, 08 Jun 2011 17:52:06 +0900 |
Cezary Kaliszyk |
Simpler proof of TypeSchemes/substs
|
changeset |
files
|
| Wed, 08 Jun 2011 17:25:54 +0900 |
Cezary Kaliszyk |
Simplify fcb_res
|
changeset |
files
|
| Wed, 08 Jun 2011 09:56:39 +0900 |
Cezary Kaliszyk |
FCB for res binding and simplified proof of subst for type schemes
|
changeset |
files
|
| Wed, 08 Jun 2011 07:06:20 +0900 |
Cezary Kaliszyk |
Simplify ln-trans proof
|
changeset |
files
|
| Wed, 08 Jun 2011 07:02:52 +0900 |
Cezary Kaliszyk |
cbvs can be easily defined without an invariant
|
changeset |
files
|
| Tue, 07 Jun 2011 20:58:00 +0100 |
Christian Urban |
defined the "count-bound-variables-occurences" function which has an accumulator like trans
|
changeset |
files
|
| Tue, 07 Jun 2011 17:45:38 +0100 |
Christian Urban |
merged
|
changeset |
files
|
| Tue, 07 Jun 2011 23:42:12 +0900 |
Cezary Kaliszyk |
remove garbage (proofs that assumes the invariant outside function)
|
changeset |
files
|
| Tue, 07 Jun 2011 23:38:39 +0900 |
Cezary Kaliszyk |
Proof of trans with invariant
|
changeset |
files
|
| Tue, 07 Jun 2011 23:22:58 +0900 |
Cezary Kaliszyk |
Testing invariant in Lambda_F_T
|
changeset |
files
|
| Tue, 07 Jun 2011 10:40:06 +0100 |
Christian Urban |
cleaned ups a bit the examples with the invariant framework; exported nominal_function_config datatype into separate structure and file
|
changeset |
files
|
| Tue, 07 Jun 2011 08:52:59 +0100 |
Christian Urban |
fixed problem with earlier commit about nominal_function_common; added facility for specifying an invariant - added a definition of frees_set which need a finiteness invariant
|
changeset |
files
|