In that case, you can help out with the programming language side. I am writing it in the wiki area of git hub (falcon2 project, it is easy to find) .
While I was working at that, last week, I realised that an axiom of the cr_algebra theory that is not very limiting in math (the composition must be commutative) turns out to be very limiting as a programming language device (I. E. We would be forced to ignore the position or rank of the parameters of the input functions in node/concepts).
Rather than saying "we use this theory, but with this exception" I preferred to improve the theory so that we can use it directly.
Removing that axiom has turned out to improve the theory a lot, and has also made other assumptions and limitations to fall, with the result that now the math maps the usage I have in mind for the CREL programming paradigm much better. Having math behind this idea is important, as it will help automatic code analysis and massive parallelization.
Otoh, I had to rewrite most of the math expressions, which took a lot of time. The good news is that I have been forced to make them simpler (the necessity of taking ordering into account required stronger math, and this means more intermediate definitions).
It was a bit like refactoring a program breaking a big bunch of code into smaller, more readable functions.
Ad said, I am proofreading it and I think I should be done by Monday.