Catching up on these. Last week's notes:
- Sam presented Chai, an arity solver and optimizing compiler for Qi
- running afoul of Greenspun's Tenth Rule
- compiling flows to graph nodes called
connects - should we use syntax properties or IR modifications to encode arity?
- design consideration: analysis vs transformation?
- how to handle sequential information loss across compiler passes?
- a renaissance in Emacs package management??
Previous weeks:
Dope Docstrings, where we considered a design for what could be the best docstrings in any language (powered by Scribble, of course!)
Minimizing the Second Derivative, when we took charge of our ballooning to-do list.