homotopy exas

revisiting an older idea: language where you have both function composition and application represented by juxtaposition (and able to factor out context e.g composing an I → B → C with an I → A → B into an I → A → C), at the cost of unification holes (e.g. see Unification-free ("keyword") type checking). ideally you'd get something that looked somewhere between APL, Forth, and usual mathematical notation. there are some weird cases here though to do with which forms of composition are prioritized and making sure that you don't have to search for compatible arguments in a quadratic-time way.