4 ms·
Really interesting. As well he seems to re-derive and implementation of Forth. In episode 6, Right under the diagran for Crema di Marscapone he has a formula.
by BoiledCabbage 9y ago
Really interesting. As well he seems to re-derive and implementation of Forth.
In episode 6, Right under the diagran for Crema di Marscapone he has a formula.
Does anyone that uses Forth know if it has that circle-plus operator? It seems to really lend to conciseness - and I hadn't remembered anything like it last time I looked at Forth.
https://graphicallinearalgebra.net/2015/05/06/crema-di-mascarpone-rules-of-the-game-part-2-and-diagrammatic-reasoning/ https://graphicallinearalgebra.net/2015/05/06/crema-di-masca...
- pubby 9y agoThere's no operator because composition and direct sum are implicit in the order of your program words.
- evincarofautumn 9y agoIt’s not surprising—there’s a deep relationship among concatenative languages, Hughes’ arrows, combinator calculus, category theory, linear algebra, logic, even topology. I haven’t read through this but I guess the ⊕ operator would be “* * *” (parallel composition) in arrow notation; in Haskell it has the type “Arrow a ⇒ a b c → a b′ c′ → a (b, b′) (c, c′)”, or “(b → c) → (b′ → c′) → (b, b′) → (c, c′)” specialised to the function arrow.