Synchronous Kahn Networks

Synchronous Kahn Networks (1996)

by Paul Caspi , Marc Pouzet

Citations:

48 - 7 self

Datum	Value	Source
TITLE	Rue Lavoisier	SVM HeaderParse 0.1
AUTHOR NAME	Paul Caspi	SVM HeaderParse 0.1
AUTHOR AFFIL	; Miniparc-ZIRST	SVM HeaderParse 0.2
AUTHOR ADDR	; 38330 Montbonnot St-Martin; France	SVM HeaderParse 0.1
AUTHOR NAME	Marc Pouzet	SVM HeaderParse 0.1
AUTHOR AFFIL	School Of Computer Science; McGill University	SVM HeaderParse 0.2
AUTHOR ADDR	3486 University Street; Montr'eal, H3A 2A7; Canada	SVM HeaderParse 0.1
ABSTRACT	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 (clock calculus). 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 that it is possible to extend the class of static synchronous data-flow to higher order and dynamical networks, thus giving sense to a larger class of synchronous data-flow networks. This is done by extending both the synchronous operational semantics, the clock calculus and the compiling technique of static data-flow networks, to these more general networks.	SVM HeaderParse 0.1
CITATIONS	26 found	ParsCit 1.0