close the missing parenthesis on both sides.

merged

changes to section 2

Clean alpha

clean fv_bn

alpha_bn

Change @{text} to @{term}

alpha

more

fv and fv_bn

more of the paper

merged

Updated strong induction to modified definitions.

Initial renaming

small changes in the core-haskell spec

Update according to paper

merge

merge

Changed to Lists.

clarified core-haskell example

spell check

merge

Abs_gen and Abs_let simplifications.

more on the paper

fixed a problem due to a change in type-def (needs new Isabelle)

merged

more on the paper

got rid of the aux-function on the raw level, by defining it with function on the quotient level

Lets finally abstract lists.

Core Haskell can now use proper strings.

Automatically lift theorems and constants only using the new quotient types. Requires new Isabelle.

Remove list_eq notation.

Get lifted types information from the quotient package.

Equivariance when bn functions are lists.

Accepts lists in FV.

Parsing of list-bn functions into components.

Automatically compute support if only one type of Abs is present in the type.

Manually proved TySch support; All properties of TySch now true.

Generalize Abs_eq_iff.

Minor fix.

New compose lemmas. Reverted alpha_gen sym/trans changes. Equivp for alpha_res should work now.

Initial proof modifications for alpha_res

merge

Fv/Alpha now takes into account Alpha_Type given from the parser.

Minor cleaning.

merged

more on the paper

Removed some warnings.

merge

Modified abs_gen_sym and abs_gen_trans so it becomes usable in the proofs.

merged

more on the paper

simplification

merge

Describe 'nominal_datatype2'.

Fixed renamings.

merged

Removed remaining cheats + some cleaning.

Extract PS7 and PS8 from Test. PS7 needs the same fix as Core Haskell.

Update cheats in TODO.

Removed another cheat and cleaned the code a bit.

Fix Manual/LamEx for experiments.

Proper bn_rsp, for bn functions calling each other.

Gathering things to prove by induction together; removed cheat_bn_eqvt.

Update TODO

Showed ACons_subst.

Only ACons_subst left to show.

Solved all boring subgoals, and looking at properly defning permute_bv

One more copy-and-paste in core-haskell.

Properly defined permute_bn. No more sorry's in Let strong induction.

Showed Let substitution.

Only let substitution is left.

further in the proof

trying to prove the string induction for let.

added experiemental permute_bn

first attempt of strong induction for lets with assignments

more on the paper

more on the paper

Further in the strong induction proof.

Solved one of the strong-induction goals.

avoiding for atom.

Started proving strong induction.

stating the strong induction; further.

Working on stating induct.

some tuning; possible fix for strange paper generation

more on the paper

merge

Showed support of Core Haskell

Support proof modification for Core Haskell.

Experiments with Core Haskell support.

Export all the cheats needed for Core Haskell.

Compute Fv for non-recursive bn functions calling other bn functions

Core Haskell experiments.

tuned paper

more of the paper

merged

more tuning in the paper

merge

Parsing bn functions that call other bn functions and transmitting this information to fv/alpha.

merged

more tuning

tuned paper

more on the paper

merge

Modification to Core Haskell to make it accepted with an empty binding function.

merged

tuned paper

Initial list unfoldings in Core Haskell.

compiles

More modification needed for compilation

Moved let properties from Term5 to ExLetRec.

Move Let properties to ExLet

Added missing file

More reorganization.

Move Leroy out of Test, rename accordingly.

Term1 is identical to Example 3

Move example3 out.

Move Ex1 and Ex2 out of Test

Move examples which create more permutations out

Move LamEx out of Test.

Move lambda examples to manual

Move manual examples to a subdirectory.

Removed compat tests.

merge

Move Non-respectful examples to NotRsp

merged

more on the paper

Move the comment to appropriate place.

Remove compose_eqvt

sym proof with compose.

Marked the place where a compose lemma applies.

merge

equivp_cheat can be removed for all one-permutation examples.

merged

more on the paper

merged

tuned paper

Got rid of alpha_bn_rsp_cheat.

alpha_bn_rsp_pre automatized.

merge

fv_rsp proved automatically.

more on the paper

merged

tuned paper

some tuning

Strong induction for Type Schemes.

Fixed missing colon.

tuned paper

merged

proved at_set_avoiding2 which is needed for strong induction principles

moved lemmas supp_perm_eq and exists_perm to Nominal2_Supp

Size experiments.

Use 'alpha_bn_refl' to get rid of one of the sorrys.

Build alpha-->alphabn implications

Prove reflp for all relations.

started cleaning up and introduced 3 versions of ~~gen

moved infinite_Un into mainstream Isabelle; moved permute_boolI/E lemmas

more work on the paper

Described automatically created funs.

merge

Automatically derive support for datatypes with at-most one binding per constructor.

picture

merged

polished

Update Test to use fset.

merge

Use fs typeclass in showing finite support + some cheat cleaning.

merged

more one the paper

Keep only one copy of infinite_Un.

Added a missing 'import'.

Showed the instance: fset::(at) fs

merge

Remove atom_decl from the parser.

TySch strong induction looks ok.

Working on TySch strong induction.

Something is wrong with the statement of strong induction for TySch, as the All case is trivial and Fun case unprovable...

merged

more tuning on the paper

The nominal infrastructure for fset. 'fs' missing, but not needed so far.

A few more theorems in FSet.

merge 2

merge 1

support of fset_to_set, support of fmap_atom.

merged

more tuning on the paper

added item about size functions

merge

Reached strong_induction in fset-based TySch. Will not work until isabelle changes are pushed.

tuned

another little bit for the introduction

Leroy96 supp=fv and fixes to make it compile

merged

more of the introduction

merge

Added a cleaned version of FSet.

corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant

Continued description of alpha.

Rename "_property" to ".property"

First part of the description of alpha_ty.

Description of generation of alpha_bn.

case names also for _induct

Case_Names for _inducts. Does not work for _induct yet.

Added fv,bn,distinct,perm to the simplifier.

merge

Simplified the description.

merged

slightly more in the paper

Update the description of the generation of fv function.

fv_bn may need to call other fv_bns.

Update TODO.

Which proofs need a 'sorry'.

added TODO

vixed variable names

simplified strong induction proof by using flip

Rename bound variables + minor cleaning.

Move most of the exporting out of the parser.

Prove pseudo-inject (eq-iff) on the exported level and rename appropriately.

Prove eqvts on exported terms.

Clean 'Lift', start working only on exported things in Parser.

slightly more of the paper

merged

paper uses now a heap file - does not compile so long anymore

merge

compose_sym2 works also for term5

Updated Term1, including statement of strong induction.

Proper compose_sym2

merged

temporarily disabled tests in Nominal/ROOT

made paper to compile

added partial proof for the strong induction principle

Trying to find a compose lemma for 2 arguments.

merge

cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.

merged

added proof of supp/fv for type schemes

Updated Type Schemes to automatic lifting. One goal is not true because of the restriction.

Remove Term5a, since it is now identical to Term5.

merge

Finished all proofs in Term5 and Term5n.