🛠 Our latest Development Monthly update is here!
🎥 https://youtu.be/Pw6q3mfbJH0
Timestamps:👇
00:12 - Karim's Summary (Development Team Overview)
• Andrei’s contributions, including deep dives with Ohad, David, and others into advanced language concepts and Boolean algebra.
• Andrei researched using large language models (LLMs) as a bridge between natural language and Tau Language.
• He Developed a bot for generating logical tests for language models, verified using the Z3 solver, revealing limitations of current LLMs like Claude and Gemini in handling simple logical questions.
• Substantially rewrote a Twitter bot for bridging tweets to other social media channels and upgraded its performance based on frequency and engagement.
• Created a Telegram bot to enhance GitHub commit messages and improve backup reliability and consistency.
07:24 - David (Lead Developer)
• Refined tests for Tau program execution, added new tests, and improved failure condition tracking.
• Added a demo to showcase the executor, updated command structure, and supported recursive function execution.
• Made grammar adjustments, added input/output variable checks, and resolved numerous solver and executor issues.
• Enhanced REPL functions, implemented default types for NSO Factory as Singletons, simplified grammar, and packaged artifacts for easy use with significant help from Tomáš.
• Worked on README and documentation for release preparation.
11:43 - Tomáš (Senior Developer)
• Enhanced readability of formulas by adding syntax highlighting and compact printing for Boolean functions.
• Worked with Umar to address ambiguities in Tau grammar, notably Boolean function conjunction.
• Added a "charar" option to toggle variable name formats, allowing for concise or expanded naming conventions in the REPL.
• Enabled grammar rule adjustments without reloading parsers, cleaned the global namespace, and began porting Tau Language to Windows, adding terminal support and executable packaging.
13:57 - Lucca (Tau Language Developer)
• Completed the full satisfiability algorithm for Tau formulas, including support for constant time positions.
• Implemented eventual variable transformations to handle "sometimes" statements efficiently.
• Developed an advanced simplification procedure for Boolean functions, optimized DNF/CNF conversions, and enhanced quantifier elimination.
• Reviewed caching for normalization to reduce unnecessary computations, made numerous bug fixes, and optimized overall performance.
16:16 - Ohad (Founder & CTO)
• Continued collaboration with Professor Parys on the network specification language, exploring Henkin quantifiers and their generality.
• Faced challenges as the approach turned out to be undecidable, leading to a pivot towards a more specialized form called “split conditional semi-simple Boolean functions.”
• Focused on adapting these concepts to support a software specification network for Tau Language, working towards practical implementation.
