May's Development Video Update! #49 🎥 https://youtu.be/CwOWngM0b9w 👈 🔹Ohad continued work with Prof. Franconi on the software specification language we have. He's worked with Dr. Kramer on aspects of Social choice theory related to Tau. Further research done on Boolean algebra monomorphisms to enhance the languages we have with further capabilities and started on a plan to implement those. 🔹David has devised an algorithm for solving systems of Boolean inequalities. Continued work on TML's CQC and simplified the implemented branch inbound algorithm. 🔹Lucca has finished his work on the two CNF data structures and is working on integrating them into the rest of the codebase. He's started work on the proof of execution work which will make it into the Tau's blockchain. 🔹Tomas merged the Earley Parser branch into the TML's master branch and updated TML's codebase to C++ 20 standards. He's currently implementing all these into TML's IDE. 🔹Juan continued his work on TML refactoring, focusing on the type resolution transformation. 🔹Umar has been working with Tomas to integrate into the master branch. He's been looking at ways to resolve ambiguities within parse forests, implementing a lambda function-based callback. Umar and Thomas added priorities and reference keywords into TML key grammar to help the ambiguities. As a result, they implemented the Git parse tree function that will extract a single tree, disambiguating the grammar from the entire parse forest, which is all possible ways to parse a program. 🔹Andrei has finished the framework for Agoras live application, and it's in the hands of the tester this week. Report following next week. 🔹Luis continued work on weekly sessions on MSO for the academic panel. Working on additional topics that may be relevant for Tau, including parameterized Boolean equation systems. The focus during May was on infinite games on finite graphs, especially on parity games due to their essential role in game semantics and Automaton logics, crucial for MSO decidability.