June's Development Video Update is Live! 🎥 https://youtu.be/Axl4iois4I0 👈 🔹Ohad, worked with Professor Franconi on the software specification language and wrote some precise formulations of the ideas, which look even more promising. It's a very exciting new software specification language—the sort of specification language that can speak about itself. A language extension allows us to take virtually any language and extend it with those abilities. We need to choose which language to extend to form the base logic, and Prof. Franconi realized that the logic should be some variant of OWL. Ohad continues implementing this, choosing a certain fragment of OWL for the base logic and further study of how it all comes together. 🔹Lucca continued his work on the two CNF extraction and implemented an efficient intersection algorithm for the union-find data structure. He finished integrating the two CNF data structure into the BDD library. He started testing, working on Proof of Computation algorithms using the sum check protocol resolved computational issues by allowing the prover to use our BDD library. A great solution if we get it to work. 🔹David continued work on Boolean algebra and CQC optimization of TML programs. He developed an algorithm for solving systems of boolean Equations or inequalities that is well suited to BDD representation. 🔹Tomas worked on the TML IDE enhancing build scripts to enable the compilation and translation of the latest parsing logic into JavaScript. He cleaned up the old regression tests, created new ones, and refactored some classes for built-ins. He's also added some priorities for parsing TML syntax to solve instability problems. 🔹Juan continued work on the core TML engine finalizing the bit transform operation, a critical optimization for a TML program. We hope that it will result in a much better runtime. We currently use a fixed instead of a variable number of bits. In doing so, he's doing his best to maintain backward compatibility between the new and old type system. 🔹Umar continued his work on the parse forest generation for the Earley parser re-implemented using a more incremental method that uses less memory at runtime. He's also working on left-right organizations. 🔹Andre resolved all 50 bugs found by Agoras live platform testers and made improvements to the payment systems and the video conferencing systems to make the applications more stable 🔹 Luis delivered weekly sessions for the academic panel; the topic in June was mostly infinite games as decision procedures for logic and formalisms such as episode model calculus and Boolean equation systems. Researching fixed point logics from the viewpoint of finite model theorem. More recently researching Datalog rules with junctions to find efficient algorithms to be adapted for TML.