Arrows are a useful abstraction for representing static computation graphs, but their interface is difficult to use. Arrow notation helps manage this complexity at the cost of requiring users to learn new syntax. We propose a simple interface for arrows built around a type for representing nodes in the computation graph, and a monad for representing programs that build such graphs. The node type is an applicative functor with one adjustment: it’s map function is an operation of the monad rather than an ordinary function.