publication . Conference object . Article . Other literature type . 1996

Synchronous Kahn networks

Paul Caspi; Marc Pouzet;
  • Published: 15 Jun 1996
  • Publisher: ACM Press
<jats:p> Synchronous data-flow is a programming paradigm which has been successfully applied in reactive systems. In this context, it can be characterized as some class of static bounded memory data-flow networks. In particular, these networks are not recursively defined, and obey some kind of "synchronous" constraints ( <jats:italic>clock calculus</jats:italic> ). Based on Kahn's relationship between data-flow and stream functions, the synchronous constraints can be related to Wadler's listlessness, and can be seen as sufficient conditions ensuring listless evaluation. As a by-product, those networks enjoy efficient compiling techniques. In this paper, we show ...
free text keywords: Software, Computer Graphics and Computer-Aided Design, Partial evaluation, Programming paradigm, Operational semantics, Bounded function, Programming language, computer.software_genre, computer, Computer science, Recursion, Reactive system
Any information missing or wrong?Report an Issue