April's #Tau Dev Update! (Episode 47): 🎥 https://youtu.be/eWnLVP0D5KI 👈 Summary: 🔹Ohad now has a new temporal logic and software specification language that is very attractive compared to other temporal logics and software specification logics. It supports the law of changing the laws but is compelling from a much broader perspective! He continues to study what such a language can do with Prof. Franconi. 🔹David is working on an algorithm for the procedure to do a consistency check on systems of Boolean inequalities, a feature that allows Tau's law of changing the laws. He's also done further TML program optimizations 🔹Lucca has been researching monadic second-order logic over infinite binary trees and presenting two-hour lectures to the academic panel. He's continued his work covering the two CNF extraction from BDDs, a program optimization that will help avoid the exponential growth of BDDs. 🔹Umar with Ohad has made further optimizations to Binary optimization forest generation in the case of highly ambiguous grammar. 🔹Tomas has finished working on character built-ins and implemented a new EOF character as a built-in. He's resolved some ambiguities in the TML language specification itself, which will help with the parsing speed of TML programs. He's updated the Github repository readme file repository, which is still in progress, and is merging his recent work into the main domain TML branch. 🔹Juan has made optimizations and managed to remove all type info from BDDs, which will help keep the size of BDD's reduced. 🔹Andrei has continued updating the application changing many front-end components to improve cross-platform compatibility between mobile and online versions of browsers. 🔹Luis has delivered weekly sessions on MSO to the academic panel. He's also been exploring topics relevant to Tau, like hyper logics and two-level grammars.