Higher Order Dataflow Schemas

@article{Tyugu1991HigherOD,
  title={Higher Order Dataflow Schemas},
  author={Enn Tyugu},
  journal={Theor. Comput. Sci.},
  year={1991},
  volume={90},
  pages={185-198}
}
Abstract 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. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Synthesis of parallel programs and systems on computational models (Nauka Publishers, Novosibirsk

V. Valkovski, V. Malyshkin
  • 1988

Principles of Project Beta, in: Programming Languages and Sysrems

S. Pokrovski
  • Comp. Center of the Siberian Branch of the Academy of Sciences of the USSR (Novosibirsk,
  • 1979

Problem solving on computational models

E. Tyugu
  • J. Appl. Math. Math. Phys
  • 1970