  The prop formalism allows representation of processes withstring diagrams and
has been successfully applied in various areas such as quantum computing,
electric circuits and control flow graphs. However, these graphical approaches
suffer from scalability problems when it comes to writing large diagrams. A
proposal to tackle this issue has been investigated for ZX-calculus using
colored props. This paper extends the approach to any prop, making it a general
tool for graphical languages manipulation.
