An upward planar order on an acyclic directed graph $G$ is a special linear extension of the edge poset of $G$ that satisfies the nesting condition. This order was introduced to combinatorially characterize upward plane graphs and progressive plane graphs (commonly known as plane string diagrams). In this paper, motivated by the theory of graphical calculus for monoidal categories, we establish a composition theory for upward planar orders. The main result is that the composition of upward planar orders is an upward planar order. This theory provides a practical method to calculate the upward planar order of a progressive plane graph or an upward plane graph.