This paper describes dataflow schemas which include higher order objects as the input data of processing nodes. It is demonstrated that higher order dataflow can be described by constructive propositional logic. Rules for safe computations on higher order dataflow schemas are presented and their implementation in hardware is discussed.
