nominal2: Graph

Mercurial Mercurial > hg > nominal2 / graph

summary | shortlog | changelog | graph | tags | bookmarks | branches | files | help
less more | (0) -1000 -300 -100 -50 -30 +30 +50 +100 tip

code refactoring; introduced a record for raw_dt_info
2011-07-07, by Christian Urban
more on NBE
2011-07-06, by Christian Urban
more on the NBE function
2011-07-06, by Christian Urban
a little further with NBE
2011-07-06, by Christian Urban
Setup eqvt_at for first goal
2011-07-06, by Cezary Kaliszyk
attempt for NBE
2011-07-06, by Christian Urban
added some relatively simple examples from paper by Norrish
2011-07-05, by Christian Urban
changed bind to binds in specifications; bind will cause trouble with Monad_Syntax
2011-07-05, by Christian Urban
side commment for future use
2011-07-05, by Christian Urban
made the tests go through again
2011-07-05, by Christian Urban
added another example which seems difficult to define
2011-07-05, by Christian Urban
added a tactic "all_trivials" which simplifies all trivial constructor cases and leaves the others untouched.
2011-07-05, by Christian Urban
merged
2011-07-05, by Christian Urban
all FCB lemmas
2011-07-05, by Christian Urban
exported various FCB-lemmas to a separate file
2011-07-05, by Christian Urban
Express trans_db with Option.map and Option.bind. Possibly mbind is a copy of bind?
2011-07-05, by Cezary Kaliszyk
Define a version of aux only for same binders. Completeness is fine.
2011-07-05, by Cezary Kaliszyk
Move If / Let with 'True' to the end of Lambda
2011-07-05, by Cezary Kaliszyk
merged
2011-07-04, by Christian Urban
tuned
2011-07-04, by Christian Urban
added an example that recurses over two arguments; the interesting proof-obligation is not yet done
2011-07-04, by Christian Urban
Let with a different invariant; not true.
2011-07-04, by Cezary Kaliszyk
Add non-working Lambda_F_T using FCB2
2011-07-03, by Cezary Kaliszyk
Added non-working CPS3 using FCB2
2011-07-03, by Cezary Kaliszyk
Change CPS1 to FCB2
2011-07-03, by Cezary Kaliszyk
Did the proofs of height and subst for Let with list-like binders. Having apply_assns allows proving things by alpha_bn
2011-07-02, by Cezary Kaliszyk
side-by-side tests of lets with single assignment; deep-binder case works if the recursion is avoided using an auxiliary function
2011-07-02, by Christian Urban
Exhaust Issue
2011-07-01, by Cezary Kaliszyk
clarified a sentence
2011-06-30, by Christian Urban
more code refactoring
2011-06-30, by Christian Urban

less more | (0) -1000 -300 -100 -50 -30 +30 +50 +100 tip

nominal2