nominal2: Graph

merge part: delete_rsp
2010-04-14, by Cezary Kaliszyk
merge part1: none_memb_nil
2010-04-14, by Cezary Kaliszyk
added header and more tuning
2010-04-14, by Christian Urban
more tuning
2010-04-14, by Christian Urban
tuned
2010-04-14, by Christian Urban
Working FSet with additional lemmas.
2010-04-13, by Cezary Kaliszyk
Much more in FSet (currently non-working)
2010-04-13, by Cezary Kaliszyk
made everything to compile
2010-04-13, by Christian Urban
merged
2010-04-13, by Christian Urban
some small tunings (incompleted work in Lambda.thy)
2010-04-13, by Christian Urban
moved equivariance of map into Nominal2_Eqvt file
2010-04-13, by Christian Urban
early ott paper
2010-04-12, by Christian Urban
Porting lemmas from Quotient package FSet to new FSet.
2010-04-12, by Cezary Kaliszyk
added alpha-caml paper
2010-04-12, by Christian Urban
implemented in thmdecls the case where eqvt-lemmas are of the form _ ==> _
2010-04-12, by Christian Urban
fixed bug in thmdecls with destructing Trueprop; some initial infrastructure for eqvt-theorems of the form _ ==> _
2010-04-11, by Christian Urban
folded changes from the conference version
2010-04-11, by Christian Urban
added TODO item about parser creating syntax for the wrong type
2010-04-11, by Christian Urban
corrected imports header
2010-04-11, by Christian Urban
tuned
2010-04-11, by Christian Urban
a few tests
2010-04-11, by Christian Urban
added eqvt rules that are more standard
2010-04-11, by Christian Urban
used warning instead of tracing (does not seem to produce stable output)
2010-04-11, by Christian Urban
added small ittems about equivaraince of alpha_gens and name of lam.perm
2010-04-11, by Christian Urban
added more robust tracing infrastructure; a strict version of the eqvt_tac raises an error if not all permutations cannot be analysed
2010-04-11, by Christian Urban
changed the eqvt-tac to move only outermost permutations inside; added tracing infrastructure for the eqvt-tac
2010-04-09, by Christian Urban
rewrite paragraph introducing equivariance, add citation to Pitts03
2010-04-09, by Brian Huffman
edit 'contributions' section so we do not just quote directly from the reviewer
2010-04-09, by Brian Huffman
renamed ExLam to Lambda and completed the proof of the strong ind principle; tuned paper
2010-04-09, by Christian Urban
clarified comment about distinct lists in th efuture work section
2010-04-08, by Christian Urban
tuned type-schemes example
2010-04-08, by Christian Urban
updated (comment about weirdo example)
2010-04-08, by Christian Urban
check whether the "weirdo" example from the binding bestiary works with shallow binders
2010-04-08, by Christian Urban
properly separated the example from my PhD and gave the correct alpha-equivalence relation (according to the paper)
2010-04-08, by Christian Urban
merged
2010-04-08, by Christian Urban
some further changes
2010-04-08, by Christian Urban
merged
2010-04-08, by Brian Huffman
change some wording in conclusion
2010-04-08, by Brian Huffman
remove extra word
2010-04-08, by Brian Huffman
merged
2010-04-08, by Christian Urban
added new paper directory for further work
2010-04-08, by Christian Urban
use qualified name as string in concrete atom example
2010-04-08, by Brian Huffman
merged
2010-04-08, by Brian Huffman
simplify instance proof
2010-04-08, by Brian Huffman
polish explanation of additive group syntax
2010-04-07, by Brian Huffman
final version of the pearl paper
2010-04-08, by Christian Urban
my final version of the paper
2010-04-07, by Christian Urban
added an induction principle for permutations; removed add_perm construction
2010-04-07, by Christian Urban
isarfied proof about existence of a permutation list
2010-04-06, by Christian Urban
added reference to E. Gunter's work
2010-04-06, by Christian Urban
typos in paper
2010-04-06, by Christian Urban
separated general nominal theory into separate folder
2010-04-04, by Christian Urban
added README and moved examples into separate directory
2010-04-03, by Christian Urban
merged pearl paper with this repository; started litrature subdirectory
2010-04-03, by Christian Urban
submitted version (just in time ;o)
2010-04-02, by Christian Urban
first complete version (slightly less than 3h more to go)
2010-04-02, by Christian Urban
tuned
2010-04-02, by Christian Urban
tuned strong ind section
2010-04-02, by Christian Urban
polished infrastruct section
2010-04-02, by Christian Urban
completed lifting section
2010-04-02, by Christian Urban
more on the lifting section
2010-04-02, by Christian Urban
more on the strong induction section
2010-04-02, by Christian Urban
completed conclusion
2010-04-01, by Christian Urban
merged
2010-04-01, by Christian Urban
merged
2010-04-01, by Christian Urban
updated related work section
2010-04-01, by Christian Urban
fv_fv_bn
2010-04-01, by Cezary Kaliszyk
Update fv_bn definition for bindings allowed in types for which bn is present.
2010-04-01, by Cezary Kaliszyk
fv_perm_bn
2010-04-01, by Cezary Kaliszyk
Minor formula fixes.
2010-04-01, by Cezary Kaliszyk
fixed alpha_bn
2010-04-01, by Christian Urban
current state
2010-04-01, by Christian Urban
merged
2010-04-01, by Christian Urban
added alpha_bn definition
2010-04-01, by Christian Urban
hfill for right aligning single table cells.
2010-04-01, by Cezary Kaliszyk
Cleaning the strong induction example.
2010-04-01, by Cezary Kaliszyk
minor
2010-04-01, by Cezary Kaliszyk
Fighting with space in displaying strong induction...
2010-04-01, by Cezary Kaliszyk
starting strong induction
2010-04-01, by Cezary Kaliszyk
General paper minor fixes.
2010-04-01, by Cezary Kaliszyk
Forgot to save before commit.
2010-04-01, by Cezary Kaliszyk
Let with multiple bindings.
2010-04-01, by Cezary Kaliszyk
Fill the space below the figure.
2010-04-01, by Cezary Kaliszyk
last commit for now.
2010-04-01, by Christian Urban
more on the conclusion
2010-04-01, by Christian Urban
completed related work section
2010-04-01, by Christian Urban
more on the paper
2010-04-01, by Christian Urban
added an item about alpha-equivalence (the existential should be closer to the abstraction)
2010-04-01, by Christian Urban
polished everything up to TODO
2010-03-31, by Christian Urban
merged
2010-03-31, by Christian Urban
added alpha-definition for ~~ty
2010-03-31, by Christian Urban
permute_bn
2010-03-31, by Cezary Kaliszyk
abbreviations for \<otimes> and \<oplus>
2010-03-31, by Christian Urban
merged
2010-03-31, by Christian Urban
a test with let having multiple bodies
2010-03-31, by Christian Urban
polished and removed tys from bn-functions.
2010-03-31, by Christian Urban
merge
2010-03-31, by Cezary Kaliszyk
More on paper
2010-03-31, by Cezary Kaliszyk
started to polish alpha-equivalence section, but needs more work
2010-03-31, by Christian Urban
started with a related work section
2010-03-31, by Christian Urban
polished and added an example for fvars
2010-03-30, by Christian Urban
cleaned up the section about fv's
2010-03-30, by Christian Urban
tuned beginning of section 4
2010-03-30, by Christian Urban
More on section 5.
2010-03-30, by Cezary Kaliszyk
More on section 5.
2010-03-30, by Cezary Kaliszyk
merged
2010-03-30, by Christian Urban
removed "raw" distinction
2010-03-30, by Christian Urban
More on Section 5
2010-03-30, by Cezary Kaliszyk
Beginning of section 5.
2010-03-30, by Cezary Kaliszyk
merged
2010-03-30, by Christian Urban
Avoid mentioning other nominal datatypes as it makes things too complicated.
2010-03-30, by Cezary Kaliszyk
merged
2010-03-30, by Christian Urban
close the missing parenthesis on both sides.
2010-03-30, by Cezary Kaliszyk
merged
2010-03-30, by Christian Urban
changes to section 2
2010-03-30, by Christian Urban
Clean alpha
2010-03-30, by Cezary Kaliszyk
clean fv_bn
2010-03-30, by Cezary Kaliszyk
alpha_bn
2010-03-30, by Cezary Kaliszyk
Change @{text} to @{term}
2010-03-30, by Cezary Kaliszyk
alpha
2010-03-30, by Cezary Kaliszyk
more
2010-03-30, by Cezary Kaliszyk
fv and fv_bn
2010-03-30, by Cezary Kaliszyk
more of the paper
2010-03-30, by Christian Urban
merged
2010-03-29, by Christian Urban
Updated strong induction to modified definitions.
2010-03-29, by Cezary Kaliszyk
Initial renaming
2010-03-29, by Cezary Kaliszyk
small changes in the core-haskell spec
2010-03-29, by Christian Urban
Update according to paper
2010-03-29, by Cezary Kaliszyk
merge
2010-03-29, by Cezary Kaliszyk
merge
2010-03-29, by Cezary Kaliszyk
Changed to Lists.
2010-03-29, by Cezary Kaliszyk
clarified core-haskell example
2010-03-29, by Christian Urban
spell check
2010-03-29, by Christian Urban
merge
2010-03-29, by Cezary Kaliszyk
Abs_gen and Abs_let simplifications.
2010-03-29, by Cezary Kaliszyk
more on the paper
2010-03-29, by Christian Urban
fixed a problem due to a change in type-def (needs new Isabelle)
2010-03-29, by Christian Urban
merged
2010-03-29, by Christian Urban
more on the paper
2010-03-29, by Christian Urban
got rid of the aux-function on the raw level, by defining it with function on the quotient level
2010-03-28, by Christian Urban
Lets finally abstract lists.
2010-03-27, by Cezary Kaliszyk
Core Haskell can now use proper strings.
2010-03-27, by Cezary Kaliszyk
Automatically lift theorems and constants only using the new quotient types. Requires new Isabelle.
2010-03-27, by Cezary Kaliszyk
Remove list_eq notation.
2010-03-27, by Cezary Kaliszyk
Get lifted types information from the quotient package.
2010-03-27, by Cezary Kaliszyk
Equivariance when bn functions are lists.
2010-03-27, by Cezary Kaliszyk
Accepts lists in FV.
2010-03-27, by Cezary Kaliszyk
Parsing of list-bn functions into components.
2010-03-27, by Cezary Kaliszyk
Automatically compute support if only one type of Abs is present in the type.
2010-03-27, by Cezary Kaliszyk
Manually proved TySch support; All properties of TySch now true.
2010-03-27, by Cezary Kaliszyk
Generalize Abs_eq_iff.
2010-03-27, by Cezary Kaliszyk
Minor fix.
2010-03-27, by Cezary Kaliszyk
New compose lemmas. Reverted alpha_gen sym/trans changes. Equivp for alpha_res should work now.
2010-03-27, by Cezary Kaliszyk
Initial proof modifications for alpha_res
2010-03-27, by Cezary Kaliszyk
merge
2010-03-27, by Cezary Kaliszyk
Fv/Alpha now takes into account Alpha_Type given from the parser.
2010-03-27, by Cezary Kaliszyk
Minor cleaning.
2010-03-27, by Cezary Kaliszyk
merged
2010-03-27, by Christian Urban
more on the paper
2010-03-27, by Christian Urban
Removed some warnings.
2010-03-27, by Cezary Kaliszyk
merge
2010-03-26, by Cezary Kaliszyk
Modified abs_gen_sym and abs_gen_trans so it becomes usable in the proofs.
2010-03-26, by Cezary Kaliszyk
merged
2010-03-26, by Christian Urban
more on the paper
2010-03-26, by Christian Urban
simplification
2010-03-26, by Christian Urban
merge
2010-03-26, by Cezary Kaliszyk
Describe 'nominal_datatype2'.
2010-03-26, by Cezary Kaliszyk
Fixed renamings.
2010-03-26, by Cezary Kaliszyk
merged
2010-03-26, by Christian Urban
Removed remaining cheats + some cleaning.
2010-03-26, by Cezary Kaliszyk
Extract PS7 and PS8 from Test. PS7 needs the same fix as Core Haskell.
2010-03-26, by Cezary Kaliszyk
Update cheats in TODO.
2010-03-26, by Cezary Kaliszyk
Removed another cheat and cleaned the code a bit.
2010-03-26, by Cezary Kaliszyk
Fix Manual/LamEx for experiments.
2010-03-26, by Cezary Kaliszyk
Proper bn_rsp, for bn functions calling each other.
2010-03-25, by Cezary Kaliszyk
Gathering things to prove by induction together; removed cheat_bn_eqvt.
2010-03-25, by Cezary Kaliszyk
Update TODO
2010-03-25, by Cezary Kaliszyk
Showed ACons_subst.
2010-03-25, by Cezary Kaliszyk
Only ACons_subst left to show.
2010-03-25, by Cezary Kaliszyk
Solved all boring subgoals, and looking at properly defning permute_bv
2010-03-25, by Cezary Kaliszyk
One more copy-and-paste in core-haskell.
2010-03-25, by Cezary Kaliszyk
Properly defined permute_bn. No more sorry's in Let strong induction.
2010-03-25, by Cezary Kaliszyk
Showed Let substitution.
2010-03-25, by Cezary Kaliszyk
Only let substitution is left.
2010-03-25, by Cezary Kaliszyk
further in the proof
2010-03-25, by Cezary Kaliszyk
trying to prove the string induction for let.
2010-03-25, by Cezary Kaliszyk
added experiemental permute_bn
2010-03-25, by Christian Urban
first attempt of strong induction for lets with assignments
2010-03-25, by Christian Urban
more on the paper
2010-03-25, by Christian Urban
more on the paper
2010-03-24, by Christian Urban
Further in the strong induction proof.
2010-03-24, by Cezary Kaliszyk
Solved one of the strong-induction goals.
2010-03-24, by Cezary Kaliszyk
avoiding for atom.
2010-03-24, by Cezary Kaliszyk
Started proving strong induction.
2010-03-24, by Cezary Kaliszyk
stating the strong induction; further.
2010-03-24, by Cezary Kaliszyk
Working on stating induct.
2010-03-24, by Cezary Kaliszyk
some tuning; possible fix for strange paper generation
2010-03-24, by Christian Urban
more on the paper
2010-03-24, by Christian Urban
merge
2010-03-24, by Cezary Kaliszyk
Showed support of Core Haskell
2010-03-24, by Cezary Kaliszyk
Support proof modification for Core Haskell.
2010-03-24, by Cezary Kaliszyk
Experiments with Core Haskell support.
2010-03-24, by Cezary Kaliszyk
Export all the cheats needed for Core Haskell.
2010-03-24, by Cezary Kaliszyk
Compute Fv for non-recursive bn functions calling other bn functions
2010-03-24, by Cezary Kaliszyk
Core Haskell experiments.
2010-03-24, by Cezary Kaliszyk
tuned paper
2010-03-24, by Christian Urban
more of the paper
2010-03-23, by Christian Urban
merged
2010-03-23, by Christian Urban
more tuning in the paper
2010-03-23, by Christian Urban
merge
2010-03-23, by Cezary Kaliszyk
Parsing bn functions that call other bn functions and transmitting this information to fv/alpha.
2010-03-23, by Cezary Kaliszyk
merged
2010-03-23, by Christian Urban
more tuning
2010-03-23, by Christian Urban
tuned paper
2010-03-23, by Christian Urban
more on the paper
2010-03-23, by Christian Urban
merge
2010-03-23, by Cezary Kaliszyk
Modification to Core Haskell to make it accepted with an empty binding function.
2010-03-23, by Cezary Kaliszyk
merged
2010-03-23, by Christian Urban
tuned paper
2010-03-23, by Christian Urban
Initial list unfoldings in Core Haskell.
2010-03-23, by Cezary Kaliszyk
compiles
2010-03-23, by Cezary Kaliszyk
More modification needed for compilation
2010-03-23, by Cezary Kaliszyk
Moved let properties from Term5 to ExLetRec.
2010-03-23, by Cezary Kaliszyk
Move Let properties to ExLet
2010-03-23, by Cezary Kaliszyk
Added missing file
2010-03-23, by Cezary Kaliszyk
More reorganization.
2010-03-23, by Cezary Kaliszyk
Move Leroy out of Test, rename accordingly.
2010-03-23, by Cezary Kaliszyk
Term1 is identical to Example 3
2010-03-23, by Cezary Kaliszyk
Move example3 out.
2010-03-23, by Cezary Kaliszyk
Move Ex1 and Ex2 out of Test
2010-03-23, by Cezary Kaliszyk
Move examples which create more permutations out
2010-03-23, by Cezary Kaliszyk
Move LamEx out of Test.
2010-03-23, by Cezary Kaliszyk
Move lambda examples to manual
2010-03-23, by Cezary Kaliszyk
Move manual examples to a subdirectory.
2010-03-23, by Cezary Kaliszyk
Removed compat tests.
2010-03-23, by Cezary Kaliszyk
merge
2010-03-23, by Cezary Kaliszyk
Move Non-respectful examples to NotRsp
2010-03-23, by Cezary Kaliszyk
merged
2010-03-23, by Christian Urban
more on the paper
2010-03-23, by Christian Urban
Move the comment to appropriate place.
2010-03-23, by Cezary Kaliszyk
Remove compose_eqvt
2010-03-23, by Cezary Kaliszyk
sym proof with compose.
2010-03-22, by Cezary Kaliszyk
Marked the place where a compose lemma applies.
2010-03-22, by Cezary Kaliszyk
merge
2010-03-22, by Cezary Kaliszyk
equivp_cheat can be removed for all one-permutation examples.
2010-03-22, by Cezary Kaliszyk
merged
2010-03-22, by Christian Urban
more on the paper
2010-03-22, by Christian Urban
merged
2010-03-22, by Christian Urban
tuned paper
2010-03-22, by Christian Urban
Got rid of alpha_bn_rsp_cheat.
2010-03-22, by Cezary Kaliszyk
alpha_bn_rsp_pre automatized.
2010-03-22, by Cezary Kaliszyk
merge
2010-03-22, by Cezary Kaliszyk
fv_rsp proved automatically.
2010-03-22, by Cezary Kaliszyk
more on the paper
2010-03-22, by Christian Urban
merged
2010-03-22, by Christian Urban
tuned paper
2010-03-22, by Christian Urban
some tuning
2010-03-22, by Christian Urban
Strong induction for Type Schemes.
2010-03-22, by Cezary Kaliszyk
Fixed missing colon.
2010-03-22, by Cezary Kaliszyk
tuned paper
2010-03-21, by Christian Urban
merged
2010-03-20, by Christian Urban
proved at_set_avoiding2 which is needed for strong induction principles
2010-03-20, by Christian Urban
moved lemmas supp_perm_eq and exists_perm to Nominal2_Supp
2010-03-20, by Christian Urban
Size experiments.
2010-03-20, by Cezary Kaliszyk
Use 'alpha_bn_refl' to get rid of one of the sorrys.
2010-03-20, by Cezary Kaliszyk
Build alpha-->alphabn implications
2010-03-20, by Cezary Kaliszyk
Prove reflp for all relations.
2010-03-20, by Cezary Kaliszyk
started cleaning up and introduced 3 versions of ~~gen
2010-03-20, by Christian Urban
moved infinite_Un into mainstream Isabelle; moved permute_boolI/E lemmas
2010-03-20, by Christian Urban
more work on the paper
2010-03-19, by Christian Urban
Described automatically created funs.
2010-03-19, by Cezary Kaliszyk
merge
2010-03-19, by Cezary Kaliszyk
Automatically derive support for datatypes with at-most one binding per constructor.
2010-03-19, by Cezary Kaliszyk
picture
2010-03-19, by Christian Urban
merged
2010-03-19, by Christian Urban
polished
2010-03-19, by Christian Urban
Update Test to use fset.
2010-03-19, by Cezary Kaliszyk
merge
2010-03-19, by Cezary Kaliszyk
Use fs typeclass in showing finite support + some cheat cleaning.
2010-03-19, by Cezary Kaliszyk
merged
2010-03-19, by Christian Urban
more one the paper
2010-03-19, by Christian Urban
Keep only one copy of infinite_Un.
2010-03-19, by Cezary Kaliszyk
Added a missing 'import'.
2010-03-19, by Cezary Kaliszyk
Showed the instance: fset::(at) fs
2010-03-19, by Cezary Kaliszyk
merge
2010-03-19, by Cezary Kaliszyk
Remove atom_decl from the parser.
2010-03-19, by Cezary Kaliszyk
TySch strong induction looks ok.
2010-03-19, by Cezary Kaliszyk
Working on TySch strong induction.
2010-03-19, by Cezary Kaliszyk
Something is wrong with the statement of strong induction for TySch, as the All case is trivial and Fun case unprovable...
2010-03-19, by Cezary Kaliszyk
merged
2010-03-19, by Christian Urban
more tuning on the paper
2010-03-19, by Christian Urban
The nominal infrastructure for fset. 'fs' missing, but not needed so far.
2010-03-19, by Cezary Kaliszyk
A few more theorems in FSet.
2010-03-19, by Cezary Kaliszyk
merge 2
2010-03-19, by Cezary Kaliszyk
merge 1
2010-03-19, by Cezary Kaliszyk
support of fset_to_set, support of fmap_atom.
2010-03-19, by Cezary Kaliszyk
merged
2010-03-18, by Christian Urban
more tuning on the paper
2010-03-18, by Christian Urban
added item about size functions
2010-03-18, by Christian Urban
merge
2010-03-18, by Cezary Kaliszyk
Reached strong_induction in fset-based TySch. Will not work until isabelle changes are pushed.
2010-03-18, by Cezary Kaliszyk
tuned
2010-03-18, by Christian Urban
another little bit for the introduction
2010-03-18, by Christian Urban
Leroy96 supp=fv and fixes to make it compile
2010-03-18, by Cezary Kaliszyk
merged
2010-03-18, by Christian Urban
more of the introduction
2010-03-18, by Christian Urban
merge
2010-03-18, by Cezary Kaliszyk
Added a cleaned version of FSet.
2010-03-18, by Cezary Kaliszyk
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
2010-03-18, by Christian Urban
Continued description of alpha.
2010-03-18, by Cezary Kaliszyk
Rename "_property" to ".property"
2010-03-18, by Cezary Kaliszyk
First part of the description of alpha_ty.
2010-03-18, by Cezary Kaliszyk
Description of generation of alpha_bn.
2010-03-18, by Cezary Kaliszyk
case names also for _induct
2010-03-18, by Cezary Kaliszyk
Case_Names for _inducts. Does not work for _induct yet.
2010-03-18, by Cezary Kaliszyk
Added fv,bn,distinct,perm to the simplifier.
2010-03-18, by Cezary Kaliszyk
merge
2010-03-18, by Cezary Kaliszyk
Simplified the description.
2010-03-18, by Cezary Kaliszyk
merged
2010-03-18, by Christian Urban
slightly more in the paper
2010-03-18, by Christian Urban
Update the description of the generation of fv function.
2010-03-18, by Cezary Kaliszyk
fv_bn may need to call other fv_bns.
2010-03-18, by Cezary Kaliszyk
Update TODO.
2010-03-18, by Cezary Kaliszyk
Which proofs need a 'sorry'.
2010-03-18, by Cezary Kaliszyk
added TODO
2010-03-18, by Christian Urban
vixed variable names
2010-03-18, by Christian Urban
simplified strong induction proof by using flip
2010-03-18, by Christian Urban
Rename bound variables + minor cleaning.
2010-03-18, by Cezary Kaliszyk
Move most of the exporting out of the parser.
2010-03-18, by Cezary Kaliszyk
Prove pseudo-inject (eq-iff) on the exported level and rename appropriately.
2010-03-18, by Cezary Kaliszyk
Prove eqvts on exported terms.
2010-03-18, by Cezary Kaliszyk
Clean 'Lift', start working only on exported things in Parser.
2010-03-18, by Cezary Kaliszyk
slightly more of the paper
2010-03-18, by Christian Urban
merged
2010-03-17, by Christian Urban
paper uses now a heap file - does not compile so long anymore
2010-03-17, by Christian Urban
merge
2010-03-17, by Cezary Kaliszyk
compose_sym2 works also for term5
2010-03-17, by Cezary Kaliszyk
Updated Term1, including statement of strong induction.
2010-03-17, by Cezary Kaliszyk
Proper compose_sym2
2010-03-17, by Cezary Kaliszyk
merged
2010-03-17, by Christian Urban
temporarily disabled tests in Nominal/ROOT
2010-03-17, by Christian Urban
made paper to compile
2010-03-17, by Christian Urban
added partial proof for the strong induction principle
2010-03-17, by Christian Urban
Trying to find a compose lemma for 2 arguments.
2010-03-17, by Cezary Kaliszyk
merge
2010-03-17, by Cezary Kaliszyk
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
2010-03-17, by Cezary Kaliszyk
merged
2010-03-17, by Christian Urban
added proof of supp/fv for type schemes
2010-03-17, by Christian Urban
Updated Type Schemes to automatic lifting. One goal is not true because of the restriction.
2010-03-17, by Cezary Kaliszyk
Remove Term5a, since it is now identical to Term5.
2010-03-17, by Cezary Kaliszyk
merge
2010-03-17, by Cezary Kaliszyk
Finished all proofs in Term5 and Term5n.
2010-03-17, by Cezary Kaliszyk
added partial proof of supp for type schemes
2010-03-17, by Christian Urban
Fix in alpha; support of the recursive Let works :)
2010-03-17, by Cezary Kaliszyk
The recursive supp just has one equation too much.
2010-03-17, by Cezary Kaliszyk
Fix for the change of alpha_gen.
2010-03-17, by Cezary Kaliszyk
merge
2010-03-17, by Cezary Kaliszyk
Generate compound FV and Alpha for recursive bindings.
2010-03-17, by Cezary Kaliszyk
Lifting theorems with compound fv and compound alpha.
2010-03-17, by Cezary Kaliszyk
commented out examples that should not work; but for example type-scheme example should work
2010-03-17, by Christian Urban
added another supp-proof for the non-recursive case
2010-03-17, by Christian Urban
Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
2010-03-16, by Cezary Kaliszyk
merge
2010-03-16, by Cezary Kaliszyk
The old recursive alpha works fine.
2010-03-16, by Cezary Kaliszyk
added the final unfolded result
2010-03-16, by Christian Urban
merge and proof of support for non-recursive case
2010-03-16, by Christian Urban
Added Term5 non-recursive. The bug is there only for the recursive case.
2010-03-16, by Cezary Kaliszyk
Alpha is wrong.
2010-03-16, by Cezary Kaliszyk
alpha_bn doesn't need the permutation in non-recursive case.
2010-03-16, by Cezary Kaliszyk
alpha5_transp and equivp
2010-03-16, by Cezary Kaliszyk
alpha5_symp proved.
2010-03-16, by Cezary Kaliszyk
FV_bn generated for recursive functions as well, and used in main fv for bindings.
2010-03-16, by Cezary Kaliszyk
The proof in 'Test' gets simpler.
2010-03-16, by Cezary Kaliszyk
Removed pi o bn = bn' assumption in alpha
2010-03-16, by Cezary Kaliszyk
merged (confirmed to work with Isabelle from 6th March)
2010-03-15, by Christian Urban
another synchronisation
2010-03-15, by Christian Urban
proof for support when bn-function is present, but fb_function is empty
2010-03-15, by Christian Urban
fv_eqvt_cheat no longer needed.
2010-03-15, by Cezary Kaliszyk
derive "inducts" from "induct" instead of lifting again is much faster.
2010-03-15, by Cezary Kaliszyk
build_eqvts works with recursive case if proper induction rule is used.
2010-03-15, by Cezary Kaliszyk
cheat_alpha_eqvt no longer needed; the proofs work.
2010-03-15, by Cezary Kaliszyk
LF works with new alpha...?
2010-03-15, by Cezary Kaliszyk
explicit flag "cheat_equivp"
2010-03-15, by Cezary Kaliszyk
Prove alpha_gen_compose_eqvt
2010-03-15, by Cezary Kaliszyk
Use eqvt.
2010-03-15, by Cezary Kaliszyk
added preliminary test version....but Test works now
2010-03-15, by Christian Urban
added an eqvt-proof for bi
2010-03-15, by Christian Urban
synchronised with main hg-repository; used add_typedef_global in nominal_atoms
2010-03-15, by Christian Urban
localised the typedef in Attic (requires new Isabelle)
2010-03-14, by Christian Urban
started supp-fv proofs (is going to work)
2010-03-13, by Christian Urban
Even with pattern simplified to a single clause, the supp equation doesn't seem true.
2010-03-12, by Cezary Kaliszyk
Still don't know how to prove supp=fv for simplest Let...
2010-03-12, by Cezary Kaliszyk
Do not fail if the finite support proof fails.
2010-03-11, by Cezary Kaliszyk
generalised the supp for atoms to all concrete atoms (not just names)
2010-03-11, by Christian Urban
support of atoms at the end of Abs.thy
2010-03-11, by Christian Urban
Trying to prove atom_image_fresh_swap
2010-03-11, by Cezary Kaliszyk
Finite_support proof no longer needed in LF.
2010-03-11, by Cezary Kaliszyk
Show that the new types are in finite support typeclass.
2010-03-11, by Cezary Kaliszyk
mk_supports_eq and supports_tac.
2010-03-11, by Cezary Kaliszyk
merge
2010-03-11, by Cezary Kaliszyk
Fixes for term1 for new alpha. Still not able to show support equations.
2010-03-11, by Cezary Kaliszyk
merged
2010-03-11, by Christian Urban
finally the proof that new and old alpha agree
2010-03-11, by Christian Urban
Remove "_raw" from lifted theorems.
2010-03-11, by Cezary Kaliszyk
looking at trm5_equivp
2010-03-11, by Cezary Kaliszyk
The cheats described explicitely.
2010-03-11, by Cezary Kaliszyk
The alpha5_eqvt tactic works if I manage to build the goal.
2010-03-11, by Cezary Kaliszyk
With the 4 cheats, all examples fully lift.
2010-03-11, by Cezary Kaliszyk
Lift alpha_bn_constants.
2010-03-11, by Cezary Kaliszyk
Lifting constants.
2010-03-11, by Cezary Kaliszyk
Proper error message.
2010-03-11, by Cezary Kaliszyk
Lifting constants works for all examples.
2010-03-11, by Cezary Kaliszyk
Remove tracing from fv/alpha.
2010-03-11, by Cezary Kaliszyk
Equivp working only on the standard alpha-equivalences.
2010-03-11, by Cezary Kaliszyk
explicit cheat_fv_eqvt
2010-03-11, by Cezary Kaliszyk
extract build_eqvts_tac.
2010-03-11, by Cezary Kaliszyk
build_eqvts no longer requires permutations.
2010-03-11, by Cezary Kaliszyk
Add explicit alpha_eqvt_cheat.
2010-03-11, by Cezary Kaliszyk
Export tactic out of alpha_eqvt.
2010-03-11, by Cezary Kaliszyk
merge
2010-03-10, by Cezary Kaliszyk
More tries about the proofs in trm5
2010-03-10, by Cezary Kaliszyk
merged
2010-03-10, by Christian Urban
almost done with showing the equivalence between old and new alpha-equivalence (one subgoal remaining)
2010-03-10, by Christian Urban
alpha_equivp for trm5
2010-03-10, by Cezary Kaliszyk
Undoing mistakenly committed parser experiments.
2010-03-10, by Cezary Kaliszyk
alpha_eqvt for recursive term1.
2010-03-10, by Cezary Kaliszyk
Looking at alpha_eqvt for term5, not much progress.
2010-03-10, by Cezary Kaliszyk
Reordered examples in Test.
2010-03-10, by Cezary Kaliszyk
Allows multiple bindings with same lhs.
2010-03-10, by Cezary Kaliszyk
Linked parser to fv and alpha.
2010-03-10, by Cezary Kaliszyk
merge
2010-03-10, by Cezary Kaliszyk
A minor fix for shallow binders. LF works again.
2010-03-10, by Cezary Kaliszyk
merged
2010-03-10, by Christian Urban
parser produces ordered bn-fun information
2010-03-10, by Christian Urban
Testing equalities in trm5, all seems good.
2010-03-10, by Cezary Kaliszyk
Fv&Alpha seem to work.
2010-03-10, by Cezary Kaliszyk
include alpha in the definitions.
2010-03-10, by Cezary Kaliszyk
Filled the algorithm for alpha_bn_arg
2010-03-10, by Cezary Kaliszyk
rhs of alpha_bn, and template for the arguments.
2010-03-10, by Cezary Kaliszyk
alpha_bn_constr template
2010-03-10, by Cezary Kaliszyk
exported template for alpha_bn
2010-03-10, by Cezary Kaliszyk
merge
2010-03-10, by Cezary Kaliszyk
Use alpha_bns in normal alpha defs.
2010-03-10, by Cezary Kaliszyk
alpha_bn_frees
2010-03-10, by Cezary Kaliszyk
merged
2010-03-09, by Christian Urban
added bn-information, but it is not yet ordered according to the dts
2010-03-09, by Christian Urban
Separate lists for separate constructors, to match bn_eqs.
2010-03-09, by Cezary Kaliszyk
All examples should work.
2010-03-09, by Cezary Kaliszyk
Fix to get old alpha.
2010-03-09, by Cezary Kaliszyk
Separate primrecs in Fv.
2010-03-09, by Cezary Kaliszyk
A version of Fv that takes into account recursive and non-recursive bindings.
2010-03-09, by Cezary Kaliszyk
Trying to prove that old alpha is the same as new recursive one. Lets still to do.
2010-03-09, by Cezary Kaliszyk
fv_bi and alpha_bi
2010-03-09, by Cezary Kaliszyk
merged
2010-03-09, by Christian Urban
added first test about new compat
2010-03-09, by Christian Urban
fv_compat
2010-03-09, by Cezary Kaliszyk
added another compat example
2010-03-09, by Christian Urban
added a test-file for compatibility
2010-03-08, by Christian Urban
added compat definitions to some examples
2010-03-08, by Christian Urban
Proper recognition of atoms and atom sets.
2010-03-08, by Cezary Kaliszyk
deleted comments about "weird"
2010-03-08, by Christian Urban
merged
2010-03-08, by Christian Urban
updated to new Isabelle
2010-03-08, by Christian Urban
Term5 written as nominal_datatype is the recursive let.
2010-03-08, by Cezary Kaliszyk
With restricted_nominal=1, exp7 and exp8 work. Not sure about proving bn_rsp there.
2010-03-08, by Cezary Kaliszyk
More fine-grained nominal restriction for debugging.
2010-03-08, by Cezary Kaliszyk
Fix permutation addition.
2010-03-08, by Cezary Kaliszyk
Update the comments
2010-03-08, by Cezary Kaliszyk
Gather bindings with same binder, and generate only one permutation for them.
2010-03-08, by Cezary Kaliszyk
Undo effects of simp.
2010-03-08, by Cezary Kaliszyk
merged
2010-03-07, by Christian Urban
updated to renamings in Isabelle
2010-03-07, by Christian Urban
merged
2010-03-04, by Christian Urban
merged
2010-03-04, by Christian Urban
more proofs in Abs and work on Core Haskell
2010-03-04, by Christian Urban
added a lemma that permutations can be represented as sums of swapping
2010-03-03, by Christian Urban
Still unable to show supp=fv for let with one existential.
2010-03-05, by Cezary Kaliszyk
Ported LF to the parser interface.
2010-03-05, by Cezary Kaliszyk
merge
2010-03-05, by Cezary Kaliszyk
Lift fv and bn eqvts; no need to lift alpha_eqvt.
2010-03-05, by Cezary Kaliszyk