A reconfigurable dataflow machine for implementing functional programming languages
Christophe G. Giraud-Carrier · ACM SIGPLAN Notices · 1994
Functional languages do away with the current state paradigm and achieve referential transparency .They als o exhibit inherent parallelism .These qualities fit very well on top of a data-driven architecture such as a data flo w machine .In this paper, we propose a fully reconfigurable data flow machine for implementing functiona l programming languages .The design is based on smart memories and nodes interconnected via a hypercube.Important aspects of the proposed model are described and compared with other similar attempts .Advantages of our system include massive parallelism, reconfigurability, and amenability to higher-level, graphica l programming .Current limitations are identified and extensions are suggested.