nominal2: Graph

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
Not much progress about the single existential let case.
2010-03-05, by Cezary Kaliszyk
Fixed LF for one quantifier over 2 premises.
2010-03-05, by Cezary Kaliszyk
Trying to fix the proofs for the single existential... So far failed.
2010-03-05, by Cezary Kaliszyk
Lift distinct.
2010-03-04, by Cezary Kaliszyk
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
2010-03-04, by Cezary Kaliszyk
Lift BV,FV,Permutations and injection :).
2010-03-04, by Cezary Kaliszyk
Comment out Weird and Phd until we have an idea how to handle multiple permutations. Transp that works for multiple existentials.
2010-03-04, by Cezary Kaliszyk
A version that just leaves the supp/\supp goal. Obviously not true.
2010-03-04, by Cezary Kaliszyk
Prove symp and transp of weird without the supp /\ supp = {} assumption.
2010-03-04, by Cezary Kaliszyk
merge
2010-03-03, by Cezary Kaliszyk
Experiments with proving weird transp
2010-03-03, by Cezary Kaliszyk
Code for solving symp goals with multiple existentials.
2010-03-03, by Cezary Kaliszyk
reflp for multiple quantifiers.
2010-03-03, by Cezary Kaliszyk
fixed mess in Test.thy
2010-03-03, by Christian Urban
Fix eqvt for multiple quantifiers.
2010-03-03, by Cezary Kaliszyk
only tuned
2010-03-03, by Christian Urban
merged
2010-03-03, by Christian Urban
start of paper - does not compile yet
2010-03-03, by Christian Urban
added ACM style file for ICFP
2010-03-03, by Christian Urban
weird eqvt
2010-03-03, by Cezary Kaliszyk
Add the supp intersection conditions.
2010-03-03, by Cezary Kaliszyk
Comment out the part that does not work with 2 quantifiers.
2010-03-02, by Cezary Kaliszyk
Fixes for the fv problem and alpha problem.
2010-03-02, by Cezary Kaliszyk
merged
2010-03-02, by Christian Urban
preliinary test about alpha-weirdo
2010-03-02, by Christian Urban
Another problem with permutations in alpha and possibly also in fv
2010-03-02, by Christian Urban
potential problem with the phd-example, where two permutations are generated, but only one is used
2010-03-02, by Christian Urban
Some tests around Term4. Not sure how to fix the generated fv function.
2010-03-02, by Cezary Kaliszyk
merge
2010-03-02, by Cezary Kaliszyk
Porting from Lift to Parser; until defining the Quotient type.
2010-03-02, by Cezary Kaliszyk
Add image_eqvt and atom_eqvt to eqvt bases.
2010-03-02, by Cezary Kaliszyk
Include the raw eqvt lemmas.
2010-03-02, by Cezary Kaliszyk
merged
2010-03-02, by Christian Urban
added some more examples from Peter Sewell's bestiary
2010-03-02, by Christian Urban
merge
2010-03-02, by Cezary Kaliszyk
Minor
2010-03-02, by Cezary Kaliszyk
Working bv_eqvt
2010-03-02, by Cezary Kaliszyk
Moving wrappers out of Lift.
2010-03-02, by Cezary Kaliszyk
merged
2010-03-02, by Christian Urban
added distinctness of perms
2010-03-02, by Christian Urban
updated (added lemma about commuting permutations)
2010-03-02, by Christian Urban
Change type schemes to name set.
2010-03-02, by Cezary Kaliszyk
More fixes for new alpha, the whole lift script should now work again.
2010-03-02, by Cezary Kaliszyk
Length fix for nested recursions.
2010-03-02, by Cezary Kaliszyk
Fix equivp.
2010-03-02, by Cezary Kaliszyk
Fixed eqvt code.
2010-03-02, by Cezary Kaliszyk
most tests work - the ones that do not I commented out
2010-03-02, by Christian Urban
merge
2010-03-02, by Cezary Kaliszyk
Add a check of fv_functions.
2010-03-02, by Cezary Kaliszyk
some tuning
2010-03-02, by Christian Urban
Link calls to Raw permutations, FV definition and alpha_definition into the parser.
2010-03-02, by Cezary Kaliszyk
merged
2010-03-02, by Christian Urban
rawified the bind specs (ready to be used now)
2010-03-02, by Christian Urban
merge
2010-03-01, by Cezary Kaliszyk
Trying to prove equivariance.
2010-03-01, by Cezary Kaliszyk
modified for new binding format - hope it is the intended one
2010-03-01, by Christian Urban
further code-refactoring in the parser
2010-03-01, by Christian Urban
The new alpha-equivalence and testing in Trm2 and Trm5.
2010-03-01, by Cezary Kaliszyk
slight simplification of the raw-decl generation
2010-03-01, by Christian Urban
Example that shows that current alpha is wrong.
2010-03-01, by Cezary Kaliszyk
added example from my phd
2010-03-01, by Christian Urban
streamlined parser
2010-02-27, by Christian Urban
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
2010-02-26, by Christian Urban
More about the general lifting procedure.
2010-02-26, by Cezary Kaliszyk
Update TODO
2010-02-26, by Cezary Kaliszyk
Progress with general lifting procedure.
2010-02-26, by Cezary Kaliszyk
RSP of perms can be shown in one go.
2010-02-26, by Cezary Kaliszyk
Change in signature of prove_const_rsp for general lifting.
2010-02-26, by Cezary Kaliszyk
Permutation and FV_Alpha interface change.
2010-02-26, by Cezary Kaliszyk
To call quotient it is enough to export the alpha frees to proper constants and their respective equivp theorems.
2010-02-26, by Cezary Kaliszyk
merge
2010-02-25, by Cezary Kaliszyk
Preparing the generalized lifting procedure
2010-02-25, by Cezary Kaliszyk
merged
2010-02-25, by Christian Urban
added ott-example about Leroy96
2010-02-25, by Christian Urban
Forgot to add one file.
2010-02-25, by Cezary Kaliszyk
Split Terms into separate files and add them to tests.
2010-02-25, by Cezary Kaliszyk
merge
2010-02-25, by Cezary Kaliszyk
Move the eqvt code out of Terms and fixed induction for single-rule examples.
2010-02-25, by Cezary Kaliszyk
merged
2010-02-25, by Christian Urban
a few simplifications
2010-02-25, by Christian Urban
first attempt to make sense out of the core-haskell definition
2010-02-25, by Christian Urban
Code for proving eqvt, still in Terms.
2010-02-25, by Cezary Kaliszyk
Use eqvt infrastructure.
2010-02-25, by Cezary Kaliszyk
Simple function eqvt code.
2010-02-25, by Cezary Kaliszyk
added IsaMakefile...but so far included only a test for the parser
2010-02-25, by Christian Urban
moved Quot package to Attic (still compiles there with "isabelle make")
2010-02-25, by Christian Urban
merged
2010-02-25, by Christian Urban
moved Nominal to "toplevel"
2010-02-25, by Christian Urban
Export perm_frees.
2010-02-25, by Cezary Kaliszyk
Restructuring the code in Perm
2010-02-24, by Cezary Kaliszyk
Simplified and finised eqvt proofs for t1 and t5
2010-02-24, by Cezary Kaliszyk
merge
2010-02-24, by Cezary Kaliszyk
Define lifted perms.
2010-02-24, by Cezary Kaliszyk
merged
2010-02-24, by Christian Urban
parsing and definition of raw datatype and bv-function work (not very beautiful)
2010-02-24, by Christian Urban
With permute_rsp we can lift the instance proofs :).
2010-02-24, by Cezary Kaliszyk
Note the instance proofs, since they can be easily lifted.
2010-02-24, by Cezary Kaliszyk
More refactoring and removed references to the global simpset in Perm.
2010-02-24, by Cezary Kaliszyk
Factor-out 'prove_perm_empty'; I plan to use it in defining permutations on the lifted type.
2010-02-24, by Cezary Kaliszyk