h

comprehension

some minor changes

minor changes

readable version

just in case of some accidents from erasing my work

added mkeps and pder, still have not proof read it

now will compile

still wont comiple hhh

still will not compile

will not compile, just text

proofread

spell check

another changes. have written more. but havent typed them. tomorrow will continue.

s?

s

example

proof reading

changes

half easy changes

new changes

chages

psuedocode added

hope works

hope this works

resolved i guess?

made changes that are necessary for a successful push

changed file name to ninems

augmented the ecoop paper to make it more like a 9m report. still continuing to update. todo: will add the psuedocode for the simplification function and then briefly talk about its slowness.

created folder for 9mth report

footnote

initial version

fixed latex bug

easy changes, url to misc, author info format changing, mysterious bug on line 49

delete data unnecessary

now correct

added stackexchange url and contact details

another superflous file

deleted further generated files (including pdf)

deleted data-files and further unnecessary parts in data.sty

hi

new version of slides

hello

the property retrieve ar v = retrieve (bsimp ar) (decode erase(bsimp(ar)) code(v)) if |- v : r does not hold

test of retrieve r v = retrieve (bsimp r) (decode bsimp r code v)

removed C(c) The retrieve and code in the previous version is still not correct and will crash. no prob now.

The C(Char) construct is incompatible with the code and retrieve in Fahad's thesis. This causes the exception. Two ways of fixing this: delete C(C) construct (easy way around) or amend retrieve code etc. since the C(C) construct is intended for decoding Pred, and we don't use pred now, we shall delete this. This is the last veersion that contains C(CHAR)

exp and proof

augmented version of proof sketch

pf

found the difference: caused by flats in ders_simp, the alts is at top most level , so no fuse and bits stay at the alts level whereas in ders + singele simp, the alts that should be the final top-level alts is not at the topmost level initially before simplification so it is opened up and bits fused. later it finds out itself the top level only aalts remaining, but the fuse is not reversible we do not know what happened either.

random test failed on the new simplification function. ("super_blexing_simp")

correctness test with enumeration

:test whether bsimp(bders(r, s)) == ders_simp(r,s) This does not hold. As illustrated by the output of the example where string is abaa and regex is (a* + ab)* this property still holds when s = aba but after the derivative of the last character a, the result is negative. However this seems easily fixable as the difference is relatively small, it might be possible to find where the difference happens and by taking that difference into accound we have some function f s.t. f(bsimp(r,s)) = ders_simp(r,s) and mkeps(f(r)) = mkeps(r) This will complete the correctness proof. Even if finding such f is hard, it would still provide insights for the real difference between simp(der(simp(der(simp(der...... and simp(ders

removing PRED why should it still be there after so many rounds of experiments? It should have been removed long ago since its existence will always make the compiler report errors. mysterious.:

more comments