Meeting - Present the algorithm

 This week, I present the algorithm about producing g'-extend expression. Some important notes that I need to re-check after the meeting are:

1. When present the algorithm, it must be avoid the description of technique behind the scene (in implementation). 
2. The algorithm should be describe as simple as possible so that the audience can catch-up in the fastest way.
3. The symbol and the notation in the algorithm must be clear. The question is that How clear? When the audience can understand the notation as the meaning you want to say. That's clear! If the notation conveys other meaning, it's mean that you have to reconsider anther one.
4. About the proof of correctness, the approaches are ok.
1. In induction method, change from variables to database so that we can prove the algorithm in general case.
2. In assertion method, update the current notation by adding a small db to g'-extend expression to convey that there will be some variables are use in the formula.

 Now, let's try! Again and again!