2011-06-21 Cezary Kaliszyk Quotients/TODO addtion
2011-06-21 Cezary Kaliszyk Minor
2011-06-21 Cezary Kaliszyk merge
2011-06-21 Cezary Kaliszyk spelling
2011-06-20 Cezary Kaliszyk merge
2011-06-20 Cezary Kaliszyk Abs_set_fcb
2011-06-20 Cezary Kaliszyk function for let-rec
2011-06-20 Cezary Kaliszyk TODO/minor
2011-06-20 Cezary Kaliszyk Move lst_fcb to Nominal2_Abs
2011-06-20 Cezary Kaliszyk More minor TODOs
2011-06-20 Cezary Kaliszyk Update TODO
2011-06-20 Cezary Kaliszyk Let/minor
2011-06-19 Cezary Kaliszyk Update Quotient/TODO and remove some attic code
2011-06-19 Cezary Kaliszyk merge
2011-06-19 Cezary Kaliszyk little on cps2
2011-06-16 Christian Urban got rid of the boolean flag in the raw_equivariance function
2011-06-16 Cezary Kaliszyk Fix
2011-06-16 Cezary Kaliszyk merge
2011-06-16 Cezary Kaliszyk CPS3 can be defined with eqvt_rhs.
2011-06-16 Christian Urban moved for the moment CPS translations into the example directory
2011-06-16 Christian Urban merged
2011-06-16 Christian Urban added eqvt_at and invariant for boths sides of the equations
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.
2011-06-16 Christian Urban added a test that every function must be of pt-sort
2011-06-16 Christian Urban all tests work again
2011-06-15 Christian Urban added size-lemmas to simplifier; as a result termination can be proved by the standard lexicographic_order method
2011-06-15 Christian Urban added an abstract
2011-06-15 Christian Urban added a stub for function paper; "isabelle make fnpaper"
2011-06-15 Cezary Kaliszyk merge
2011-06-15 Cezary Kaliszyk one TODO and one Problem?
2011-06-15 Cezary Kaliszyk merge
2011-06-15 Cezary Kaliszyk Some TODOs
2011-06-15 Cezary Kaliszyk merge
2011-06-15 Cezary Kaliszyk TypeSchemes work with 'default'.
2011-06-14 Christian Urban tuned some proofs
2011-06-14 Christian Urban fixed the problem when giving a complex default-term; the fundef lemmas in Nominal_Base were not general enough
2011-06-14 Christian Urban tuned
2011-06-10 Cezary Kaliszyk Move working examples before non-working ones
2011-06-10 Cezary Kaliszyk Optimized proofs and removed some garbage.
2011-06-10 Cezary Kaliszyk merge
2011-06-10 Cezary Kaliszyk Slightly modify fcb for list1 and put in common place.
2011-06-10 Cezary Kaliszyk Experiments with Let
2011-06-09 Cezary Kaliszyk Eval can be defined with additional freshness
2011-06-09 Cezary Kaliszyk Minor simplification
2011-06-09 Cezary Kaliszyk abs_res_fcb will be enough to finish the multiple-recursive proof, if we have a working 'default'.
2011-06-09 Cezary Kaliszyk More experiments with 'default'
2011-06-08 Cezary Kaliszyk Finished the proof with the invariant
2011-06-08 Cezary Kaliszyk Issue with 'default'
2011-06-08 Christian Urban merged
2011-06-08 Christian Urban merged
2011-06-08 Christian Urban using the option "default" the function package allows one to give an explicit default value
2011-06-08 Cezary Kaliszyk Simpler proof of TypeSchemes/substs
2011-06-08 Cezary Kaliszyk Simplify fcb_res
2011-06-08 Cezary Kaliszyk FCB for res binding and simplified proof of subst for type schemes
2011-06-07 Cezary Kaliszyk Simplify ln-trans proof
2011-06-07 Cezary Kaliszyk cbvs can be easily defined without an invariant
(0) -1000 -300 -100 -56 +56 +100 +300 tip