sticky card:
this stream is basically about fun mathematics on weekends, which can be codified or visualized in some neat way.
it includes graph theory and computer algebra systems; parsers and compilers; computer graphics and computational geometry; constraint satisfaction problems, mechanism design, decision problems and stochastic processes.
PetitParser
petitparser combines some parser concepts. I read about it a few weeks ago. it was originally implemented in smalltalk by lukas renggli, and there are ports to java, dart, typescript and php.
it seems to be simple but elegant, thus worthwhile to reimplement in kotlin (by jetbrains) or rust (by mozilla). this is generally a good way for me to learn about the internals.
its documentation mentions that it
combines ideas from scannerless parsing, parser combinators, parsing expression grammars and packrat parsers to model grammars and parsers as objects that can be reconfigured dynamically
I once read about object-oriented parser combinators in the german blog denkspuren by prof. herzberg and copy-ran the provided python code. the other concepts are still a bit unclear, but I skimmed through the papers and theses and they seem to be nicely explained there.
speaking of the internals: it would be nice to have a small code example for every concept (for those who primarily think in code — like me) and a reference to the paper, that introduced the respective concept (to dive into the history — which I always like).
Graph Theory
Hope I can write some interesting stuff about these gentlemen (and gentlewomen) graphs in the future:
Mr. House of Santa Claus Graph:
Mr. Markov Chain:
Mrs. Constraint Network Graph:
Mrs. Mechanism Design Graph:
They were typesetted in LaTeX with VauCanSon-G (not TikZ).