| 2011-06-20 |
Cezary Kaliszyk |
Move lst_fcb to Nominal2_Abs
|
changeset |
files
|
| 2011-06-20 |
Cezary Kaliszyk |
More minor TODOs
|
changeset |
files
|
| 2011-06-20 |
Cezary Kaliszyk |
Update TODO
|
changeset |
files
|
| 2011-06-20 |
Cezary Kaliszyk |
Let/minor
|
changeset |
files
|
| 2011-06-19 |
Cezary Kaliszyk |
Update Quotient/TODO and remove some attic code
|
changeset |
files
|
| 2011-06-19 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| 2011-06-19 |
Cezary Kaliszyk |
little on cps2
|
changeset |
files
|
| 2011-06-16 |
Christian Urban |
got rid of the boolean flag in the raw_equivariance function
|
changeset |
files
|
| 2011-06-16 |
Cezary Kaliszyk |
Fix
|
changeset |
files
|
| 2011-06-16 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| 2011-06-16 |
Cezary Kaliszyk |
CPS3 can be defined with eqvt_rhs.
|
changeset |
files
|
| 2011-06-16 |
Christian Urban |
moved for the moment CPS translations into the example directory
|
changeset |
files
|
| 2011-06-16 |
Christian Urban |
merged
|
changeset |
files
|
| 2011-06-16 |
Christian Urban |
added eqvt_at and invariant for boths sides of the equations
|
changeset |
files
|
| 2011-06-16 |
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
|
| 2011-06-16 |
Christian Urban |
added a test that every function must be of pt-sort
|
changeset |
files
|
| 2011-06-16 |
Christian Urban |
all tests work again
|
changeset |
files
|
| 2011-06-15 |
Christian Urban |
added size-lemmas to simplifier; as a result termination can be proved by the standard lexicographic_order method
|
changeset |
files
|
| 2011-06-15 |
Christian Urban |
added an abstract
|
changeset |
files
|
| 2011-06-15 |
Christian Urban |
added a stub for function paper; "isabelle make fnpaper"
|
changeset |
files
|
| 2011-06-15 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| 2011-06-15 |
Cezary Kaliszyk |
one TODO and one Problem?
|
changeset |
files
|
| 2011-06-15 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| 2011-06-15 |
Cezary Kaliszyk |
Some TODOs
|
changeset |
files
|
| 2011-06-15 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| 2011-06-15 |
Cezary Kaliszyk |
TypeSchemes work with 'default'.
|
changeset |
files
|
| 2011-06-14 |
Christian Urban |
tuned some proofs
|
changeset |
files
|
| 2011-06-14 |
Christian Urban |
fixed the problem when giving a complex default-term; the fundef lemmas in Nominal_Base were not general enough
|
changeset |
files
|
| 2011-06-14 |
Christian Urban |
tuned
|
changeset |
files
|
| 2011-06-10 |
Cezary Kaliszyk |
Move working examples before non-working ones
|
changeset |
files
|
| 2011-06-10 |
Cezary Kaliszyk |
Optimized proofs and removed some garbage.
|
changeset |
files
|
| 2011-06-10 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| 2011-06-10 |
Cezary Kaliszyk |
Slightly modify fcb for list1 and put in common place.
|
changeset |
files
|
| 2011-06-10 |
Cezary Kaliszyk |
Experiments with Let
|
changeset |
files
|
| 2011-06-09 |
Cezary Kaliszyk |
Eval can be defined with additional freshness
|
changeset |
files
|
| 2011-06-09 |
Cezary Kaliszyk |
Minor simplification
|
changeset |
files
|
| 2011-06-09 |
Cezary Kaliszyk |
abs_res_fcb will be enough to finish the multiple-recursive proof, if we have a working 'default'.
|
changeset |
files
|
| 2011-06-09 |
Cezary Kaliszyk |
More experiments with 'default'
|
changeset |
files
|
| 2011-06-08 |
Cezary Kaliszyk |
Finished the proof with the invariant
|
changeset |
files
|
| 2011-06-08 |
Cezary Kaliszyk |
Issue with 'default'
|
changeset |
files
|
| 2011-06-08 |
Christian Urban |
merged
|
changeset |
files
|
| 2011-06-08 |
Christian Urban |
merged
|
changeset |
files
|
| 2011-06-08 |
Christian Urban |
using the option "default" the function package allows one to give an explicit default value
|
changeset |
files
|
| 2011-06-08 |
Cezary Kaliszyk |
Simpler proof of TypeSchemes/substs
|
changeset |
files
|
| 2011-06-08 |
Cezary Kaliszyk |
Simplify fcb_res
|
changeset |
files
|
| 2011-06-08 |
Cezary Kaliszyk |
FCB for res binding and simplified proof of subst for type schemes
|
changeset |
files
|
| 2011-06-07 |
Cezary Kaliszyk |
Simplify ln-trans proof
|
changeset |
files
|
| 2011-06-07 |
Cezary Kaliszyk |
cbvs can be easily defined without an invariant
|
changeset |
files
|
| 2011-06-07 |
Christian Urban |
defined the "count-bound-variables-occurences" function which has an accumulator like trans
|
changeset |
files
|
| 2011-06-07 |
Christian Urban |
merged
|
changeset |
files
|
| 2011-06-07 |
Cezary Kaliszyk |
remove garbage (proofs that assumes the invariant outside function)
|
changeset |
files
|
| 2011-06-07 |
Cezary Kaliszyk |
Proof of trans with invariant
|
changeset |
files
|
| 2011-06-07 |
Cezary Kaliszyk |
Testing invariant in Lambda_F_T
|
changeset |
files
|
| 2011-06-07 |
Christian Urban |
cleaned ups a bit the examples with the invariant framework; exported nominal_function_config datatype into separate structure and file
|
changeset |
files
|
| 2011-06-07 |
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
|
| 2011-06-06 |
Christian Urban |
slightly stronger property in fundef_ex_prop
|
changeset |
files
|
| 2011-06-05 |
Christian Urban |
added an option for an invariant (at the moment only a stub)
|
changeset |
files
|
| 2011-06-05 |
Christian Urban |
added a more general lemma fro fundef_ex1
|
changeset |
files
|
| 2011-06-04 |
Cezary Kaliszyk |
Trying the induction on the graph
|
changeset |
files
|
| 2011-06-04 |
Cezary Kaliszyk |
Finish and test the locale approach
|
changeset |
files
|