Synchronous Kahn Networks

Synchronous Kahn Networks (1996)

Cached

Download Links

[www-spi.lip6.fr]
[ftp.imag.fr]
[www-spi.lip6.fr]

Other Repositories/Bibliography

DBLP

by Paul Caspi , Marc Pouzet

Citations:

48 - 7 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Synchronous Kahn Networks	user correction - Legacy Corrections
AUTHOR NAME	Paul Caspi Verimag	user correction - Legacy Corrections
AUTHOR NAME	Paul Caspi	user correction - Legacy Corrections
AUTHOR AFFIL	; Miniparc-ZIRST	user correction - Legacy Corrections
AUTHOR ADDR	; 38330 Montbonnot St-Martin; France	user correction - Legacy Corrections
AUTHOR NAME	Marc Pouzet	user correction - Legacy Corrections
AUTHOR AFFIL	School Of Computer Science; McGill University	user correction - Legacy Corrections
AUTHOR ADDR	3486 University Street; Montr'eal, H3A 2A7; Canada	user correction - Legacy Corrections
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.	user correction - Legacy Corrections
YEAR	1996	user correction - Legacy Corrections
CITATIONS	26 found	ParsCit 1.0