On Sunday, I was reading about arrows in Haskell, and I noticed that these diagrams of the primitive arrow functions looked rather like diagrams of data flow in concatenative (stack-based) languages. This suggested that they might be related, or transformable. (IRC log of the early discussion) I have now found that simple concatenative code is quite easily expressed with arrows, but there are appa
![Concatenative programming in Haskell's Arrows](https://cdn-ak-scissors.b.st-hatena.com/image/square/74e90599656ceadb00e4e45cf296cc44473e9e7e/height=288;version=1;width=512/https%3A%2F%2Fl-stat.livejournal.net%2Fimg%2Fsign.png)