Definitional Trees : Coding Phase - Main task 1 completed

Hello all,

Sorry for the delay in reporting about my progress in the project. There has been quite a lot of changes and progress over the last few days.

Firstly, the N function(used to evaluate constructor expressions) is implemented and tested with a simple example of "Pair" operation. Also one of the sub-tasks to check the robustness and consistency of the replace function of Box has been tested .

Apart from this, there were some minor changes to H like the function directly replaces the input expression expr in all cases instead of returning a new expression in some cases.

I also worked on implementing the operations for a basic datatype called Boolean. This can now be used to test code or implement complex operations.

As always my progress can be tracked here

Looking forward to the next steps in the project :)