<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>7024</REFNUM><AUTHORS><AUTHOR>Gay,S.J.</AUTHOR><AUTHOR>Nagarajan,R.</AUTHOR></AUTHORS><YEAR>2003</YEAR><TITLE>Intensional and Extensional Semantics of Dataflow Programs</TITLE><PLACE_PUBLISHED>Formal Aspects of Computing, Volume 15 DOI: 10.1007/s00165-003-0018-1</PLACE_PUBLISHED><PUBLISHER>Springer</PUBLISHER><PAGES>299-318</PAGES><ISBN>0934-5043</ISBN><LABEL>Gay:2003:7024</LABEL><KEYWORDS><KEYWORD>dataflow</KEYWORD></KEYWORDS<ABSTRACT>We compare two semantic models of dataflow programs: a synchronous version of the classical Kahn semantics, and a new semantics in a category of synchronous processes. We consider the Kahn semantics to be extensional, as it describes the functions computed by dataflow nodes, and the categorical semantics to be intensional, as it describes the step-by-step production of output tokens from input tokens. Assuming that programs satisfy Wadge's cycle sum condition and are therefore deadlock-free, we prove that the two semantics are equivalent. This equivalence result amounts to a proof that function composition in the extensional semantics is faithfully modelled by the detailed interactions of the intensional semantics, and provides further insight into the nature of dataflow computation.</ABSTRACT></RECORD></RECORDS></XML>