polished

all material

all material

almost finished

more on paper

more on the paper

more on paper

minor

more on paper

more on paper

more on paper

more on the paper

more

more on paper

more

paper

merged

more on paper

more

more on the paper

more on paper

more on the lmcs paper

updated to Isabelle 28 Aug

Use same constructor names as Lambda, remove copies of FCB, remove [eqvt].

Add lmcs-paper to hgignore

Add 'no-brackets' to avoid '[| |]' in papers.

Comment out examples with 'True' that do not work because function still does not work

Update to new Isabelle

a bit more on the paper

made same changes as in main branch

more on the lmcs paper

a little tuning on the paper

more on the intro and correct style-files

uodated to new Isabelle (15. Aug)

updated for new Isabelle (11. Aug.)

merged

started lmcs paper (isabelle make lmcs)

update to 'termination (eqvt)'.

tuned

completed the eqvt-proofs for functions; they are stored under the name function_name.eqvt and added to the eqvt-list

temporary fix

Add an ".hgignore" file

merged

merged

merged

added termination file

preliminary version of automatically generation the eqvt-lemmas for functions defined with nominal_primrec

generated the partial eqvt-theorem for functions

added a flag (eqvt) to termination proofs arising fron nominal_primrecs

moved eqvt for Option.map

some tuning

direct definition of height using bn

defined a function directly over a nominal datatype with bn

more one the NBE example

some improvements to the NBE example

slight tuning

use eqvt_at_perm

Remove copy of FCB and cleanup

Experiment with permuting eqvt_at

combinators for local theories and lists

merged

some more experiments with let and bns

some code refactoring

merged

code refactoring; introduced a record for raw_dt_info

more on NBE

more on the NBE function

a little further with NBE

Setup eqvt_at for first goal

attempt for NBE

added some relatively simple examples from paper by Norrish

changed bind to binds in specifications; bind will cause trouble with Monad_Syntax

side commment for future use

made the tests go through again

added another example which seems difficult to define

added a tactic "all_trivials" which simplifies all trivial constructor cases and leaves the others untouched.

merged

all FCB lemmas

exported various FCB-lemmas to a separate file

Express trans_db with Option.map and Option.bind. Possibly mbind is a copy of bind?

Define a version of aux only for same binders. Completeness is fine.

Move If / Let with 'True' to the end of Lambda

merged

tuned

added an example that recurses over two arguments; the interesting proof-obligation is not yet done

Let with a different invariant; not true.

Add non-working Lambda_F_T using FCB2

Added non-working CPS3 using FCB2

Change CPS1 to FCB2

Did the proofs of height and subst for Let with list-like binders. Having apply_assns allows proving things by alpha_bn

side-by-side tests of lets with single assignment; deep-binder case works if the recursion is avoided using an auxiliary function

Exhaust Issue

clarified a sentence

more code refactoring

combined distributed data for alpha in alpha_result (partially done)

moved Classical and Let temporarily into a section where "sorry" is allowed; this makes all test go through

added a warning if a theorem is already declared as equivariant

merged

Prove bn injectivity and experiment more with Let

some experiments

trying new fcb in let/subst

Leftover only inj and eqvt

eapply fcb ok

Removed Inl and Inr

relaxed type in fcb

fcb with explicit bn function

added let-rec example

Experiments with res

proved the fcb also for sets (no restriction yet)

copied all work to Lambda.thy; had to derive a special version of fcb1 for concrete atom

streamlined the fcb-proof and made fcb1 a special case of fcb

completed proof in Classical; the fcb lemma works for any list of atoms (despite what was written earlier)

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.

renamed ds to dset (disagreement set)

added small lemma about disagreement set

merge

New-style fcb for multiple binders.

equality of lst_binder and a few helper lemmas [l]lst. T = [l]lst. S <-> T = S

only one of the fcb precondistions are needed (probably the same with the perm-conditions)

another change to the fcb2; this is needed in order to get all proofs through in Lambda.thy