Re:Graphical linear algebra: from matrices to monoids
by evincarofautumn on Saturday February 17, 2018 @07:37PM
(#16403706)
It’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.
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-masca...