merged

added bn-information, but it is not yet ordered according to the dts

Separate lists for separate constructors, to match bn_eqs.

All examples should work.

Fix to get old alpha.

Separate primrecs in Fv.

A version of Fv that takes into account recursive and non-recursive bindings.

Trying to prove that old alpha is the same as new recursive one. Lets still to do.

fv_bi and alpha_bi

merged

added first test about new compat

fv_compat

added another compat example

added a test-file for compatibility

added compat definitions to some examples

Proper recognition of atoms and atom sets.

deleted comments about "weird"

merged

updated to new Isabelle

Term5 written as nominal_datatype is the recursive let.

With restricted_nominal=1, exp7 and exp8 work. Not sure about proving bn_rsp there.

More fine-grained nominal restriction for debugging.

Fix permutation addition.

Update the comments

Gather bindings with same binder, and generate only one permutation for them.

Undo effects of simp.

merged

updated to renamings in Isabelle

merged

merged

more proofs in Abs and work on Core Haskell

added a lemma that permutations can be represented as sums of swapping

Still unable to show supp=fv for let with one existential.

Ported LF to the parser interface.

merge

Lift fv and bn eqvts; no need to lift alpha_eqvt.

Not much progress about the single existential let case.

Fixed LF for one quantifier over 2 premises.

Trying to fix the proofs for the single existential... So far failed.

Lift distinct.

Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.

Lift BV,FV,Permutations and injection :).

Comment out Weird and Phd until we have an idea how to handle multiple permutations. Transp that works for multiple existentials.

A version that just leaves the supp/\supp goal. Obviously not true.

Prove symp and transp of weird without the supp /\ supp = {} assumption.

merge

Experiments with proving weird transp

Code for solving symp goals with multiple existentials.

reflp for multiple quantifiers.

fixed mess in Test.thy

Fix eqvt for multiple quantifiers.

only tuned

merged

start of paper - does not compile yet

added ACM style file for ICFP

weird eqvt

Add the supp intersection conditions.

Comment out the part that does not work with 2 quantifiers.

Fixes for the fv problem and alpha problem.

merged