{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:24:46Z","timestamp":1725891886716},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540468431"},{"type":"electronic","value":"9783540468455"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11894100_5","type":"book-chapter","created":{"date-parts":[[2006,11,9]],"date-time":"2006-11-09T13:11:30Z","timestamp":1163077890000},"page":"135-167","source":"Crossref","is-referenced-by-count":11,"title":["The Essence of Dataflow Programming"],"prefix":"10.1007","author":[{"given":"Tarmo","family":"Uustalu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Varmo","family":"Vene","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00728-4","volume":"300","author":"P. Aczel","year":"2003","unstructured":"Aczel, P., Ad\u00e1mek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative theories: A coalgebraic view. Theoret. Comput. Sci.\u00a0300(1-3), 1\u201345 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR2","volume-title":"LUCID, The Dataflow Programming Language","author":"E.A. Ashcroft","year":"1985","unstructured":"Ashcroft, E.A., Wadge, W.W.: LUCID, The Dataflow Programming Language. Academic Press, New York (1985)"},{"key":"5_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195075977.001.0001","volume-title":"Multidimensional Programming","author":"E.A. Ashcroft","year":"1995","unstructured":"Ashcroft, E.A., Faustini, A.A., Jagannathan, R., Wadge, W.W.: Multidimensional Programming. Oxford University Press, New York (1995)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Barbier, B.: Solving stream equation systems. In: Actes 13mes Journ\u00e9es Francophones des Langages Applicatifs, JFLA 2002, pp. 117\u2013139 (2002)","DOI":"10.1016\/S0375-6505(02)00003-2"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-56992-8_6","volume-title":"Computer Science Logic","author":"N. Benton","year":"1993","unstructured":"Benton, N., Bierman, G., de Paiva, V., Hyland, M.: Linear lambda-calculus and categorical models revisited. In: Martini, S., B\u00f6rger, E., Kleine B\u00fcning, H., J\u00e4ger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol.\u00a0702, pp. 61\u201384. Springer, Heidelberg (1993)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-45699-6_2","volume-title":"Applied Semantics","author":"N. Benton","year":"2002","unstructured":"Benton, N., Hughes, J., Moggi, E.: Monads and Effects. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol.\u00a02395, pp. 42\u2013122. Springer, Heidelberg (2002)"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1023\/A:1005291931660","volume":"65","author":"G. Bierman","year":"2000","unstructured":"Bierman, G., de Paiva, V.: On an intuitionistic modal logic. Studia Logica\u00a065(3), 383\u2013416 (2000)","journal-title":"Studia Logica"},{"key":"5_CR8","series-title":"London Math. Society Lecture Note Series","first-page":"1","volume-title":"Applications of Categories in Computer Science","author":"S. Brookes","year":"1992","unstructured":"Brookes, S., Geva, S.: Computational comonads and intensional semantics. In: Fourman, M.P., Johnstone, P.T., Pitts, A.M. (eds.) Applications of Categories in Computer Science. London Math. Society Lecture Note Series, vol.\u00a0177, pp. 1\u201344. Cambridge Univ. Press, Cambridge (1992)"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ic.2005.08.005","volume":"204","author":"V. Capretta","year":"2006","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Inform. and Comput.\u00a0204(4), 437\u2013468 (2006)","journal-title":"Inform. and Comput."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(92)90326-B","volume":"94","author":"P. Caspi","year":"1992","unstructured":"Caspi, P.: Clocks in dataflow languages. Theoret. Comput. Sci.\u00a094(1), 125\u2013140 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/232627.232651","volume-title":"Proc. of 1st ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 1996","author":"P. Caspi","year":"1996","unstructured":"Caspi, P., Pouzet, M.: Synchronous Kahn networks. In: Proc. of 1st ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 1996, pp. 226\u2013238. ACM Press, New York (1996); Also in ACM SIGPLAN Notices, 31(6), pp.\u00a0226\u2013238 (1996)"},{"key":"5_CR12","series-title":"Electron. Notes in Theoret. Comput. Sci.","volume-title":"Proc. of 1st Wksh. on Coalgebraic Methods in Computer Science, CMCS 1998","author":"P. Caspi","year":"1998","unstructured":"Caspi, P., Pouzet, M.: A co-iterative characterization of synchronous stream functions. In: Jacobs, B., Moss, L., Reichel, H., Rutten, J. (eds.) Proc. of 1st Wksh. on Coalgebraic Methods in Computer Science, CMCS 1998. Electron. Notes in Theoret. Comput. Sci., vol.\u00a011. Elsevier, Amsterdam (1998)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/1017753.1017792","volume-title":"Proc. of 4th ACM Int. Conf. on Embedded Software, EMSOFT 2004","author":"J.-L. Cola\u00e7o","year":"2004","unstructured":"Cola\u00e7o, J.-L., Girault, A., Hamon, G., Pouzet, M.: Towards a higher-order synchronous data-flow language. In: Proc. of 4th ACM Int. Conf. on Embedded Software, EMSOFT 2004, pp. 230\u2013239. ACM Press, New York (2004)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-45212-6_10","volume-title":"Embedded Software","author":"J.-L. Cola\u00e7o","year":"2003","unstructured":"Cola\u00e7o, J.-L., Pouzet, M.: Clocks as first class abstract types. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol.\u00a02855, pp. 134\u2013155. Springer, Heidelberg (2003)"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/382780.382785","volume":"48","author":"R. Davies","year":"2001","unstructured":"Davies, R., Pfenning, F.: A modal analysis of staged computation. J. of ACM\u00a048(3), 555\u2013604 (2001)","journal-title":"J. of ACM"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1145\/351240.351257","volume-title":"Proc. of 5th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 2000","author":"L. Erk\u00f6k","year":"2000","unstructured":"Erk\u00f6k, L., Launchbury, J.: Monadic recursive bindings. In: Proc. of 5th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 2000, pp. 174\u2013185. ACM Press, New York (2000); Also in ACM SIGPLAN Notices,vol.\u00a035(9), pp.\u00a0174\u2013185 (2000)"},{"issue":"9","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/5.97300","volume":"79","author":"N. Halbwachs","year":"1991","unstructured":"Halbwachs, N., Caspi, P., Raymond, P., Pilaud, D.: The synchronous data flow programming language LUSTRE. Proc. of the IEEE\u00a079(9), 1305\u20131320 (1991)","journal-title":"Proc. of the IEEE"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-44833-4_6","volume-title":"Advanced Functional Programming","author":"P. Hudak","year":"2003","unstructured":"Hudak, P., Courtney, A., Nilsson, H., Peterson, J.: Arrows, robots, and functional programming. In: Jeuring, J., Jones, S.L.P. (eds.) AFP 2002. LNCS, vol.\u00a02638, pp. 159\u2013187. Springer, Heidelberg (2003)"},{"issue":"1\u20133","key":"5_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0167-6423(99)00023-4","volume":"37","author":"J. Hughes","year":"2000","unstructured":"Hughes, J.: Generalising monads to arrows. Sci. of Comput. Program\u00a037(1\u20133), 67\u2013111 (2000)","journal-title":"Sci. of Comput. Program"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11546382_2","volume-title":"Advanced Functional Programming","author":"J. Hughes","year":"2005","unstructured":"Hughes, J.: Programming with arrows. In: Vene, V., Uustalu, T. (eds.) AFP 2004. LNCS, vol.\u00a03622, pp. 73\u2013129. Springer, Heidelberg (2005)"},{"key":"5_CR21","series-title":"Electron. Notes in Theoret. Comput. Sci","first-page":"219","volume-title":"Proc. of 22nd Ann. Conf. on Mathematical Foundations of Programming Semantics, MFPS XXII","author":"C. Heunen","year":"2006","unstructured":"Heunen, C., Jacobs, B.: Arrows, like monads, are monoids. In: Brookes, S., Mislove, M. (eds.) Proc. of 22nd Ann. Conf. on Mathematical Foundations of Programming Semantics, MFPS XXII. Electron. Notes in Theoret. Comput. Sci, vol.\u00a0158, pp. 219\u2013236. Elsevier, Amsterdam (2006)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Jacobs, B., Hasuo, I.: Freyd is Kleisli, for arrows. In: McBride, C., Uustalu, T. (eds.) Proc. of Wksh. on Mathematically Structured Programming, MSFP 2006. Electron. Wkshs. in Computing. BCS (2006)","DOI":"10.14236\/ewic\/MSFP2006.9"},{"key":"5_CR23","unstructured":"Kieburtz, R.B.: Codata and comonads in Haskell (unpublished) (manuscript, 2001)"},{"key":"5_CR24","unstructured":"Kieburtz, R.B.: Coalgebraic techniques for reactive functional programming. In: Actes 11mes Journ\u00e9es Francophones des Langages Applicatifs, JFLA 2000, pp. 131\u2013157 (2000)"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/325694.325708","volume-title":"Proc. of 27th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2000","author":"J.R. Lewis","year":"2000","unstructured":"Lewis, J.R., Shields, M.B., Meijer, E., Launchbury, J.: Implicit parameters: Dynamic scoping with static types. In: Proc. of 27th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2000, pp. 108\u2013118. ACM Press, New York (2000)"},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inform. and Comput.\u00a093(1), 55\u201392 (1991)","journal-title":"Inform. and Comput."},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/581690.581695","volume-title":"Proc. of 2002 ACM SIGPLAN Wksh. on Haskell, Haskell 2002","author":"H. Nilsson","year":"2002","unstructured":"Nilsson, H., Courtney, A., Peterson, J.: Functional reactive programming, continued. In: Proc. of 2002 ACM SIGPLAN Wksh. on Haskell, Haskell 2002, pp. 51\u201364. ACM Press, New York (2002)"},{"key":"5_CR28","first-page":"49","volume-title":"Proc. of IFIP TC2\/WG2.1 Working Conf. on Generic Programming","author":"A. Pardo","year":"2003","unstructured":"Pardo, A.: Generic accumulations. In: Gibbons, J., Jeuring, J. (eds.) Proc. of IFIP TC2\/WG2.1 Working Conf. on Generic Programming. IFIP Conf. Proc., vol.\u00a0243, pp. 49\u201378. Kluwer, Dordrecht (2003)"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/507635.507664","volume-title":"Proc. of 6th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 2001","author":"R. Paterson","year":"2001","unstructured":"Paterson, R.: A new notation for arrows. In: Proc. of 6th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 2001, pp. 229\u2013240. ACM Press, New York (2001); Also in ACM SIGPLAN Notices, vol.\u00a036(10), pp.\u00a0229\u2013240 (2001)"},{"key":"5_CR30","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-1-349-91518-7_10","volume-title":"The Fun of Programming, Cornerstones of Computing","author":"R. Paterson","year":"2003","unstructured":"Paterson, R.: Arrows and computation. In: Gibbons, J., de Moor, O. (eds.) The Fun of Programming, Cornerstones of Computing, pp. 201\u2013222. Palgrave MacMillan, Basingstoke \/ New York (2003)"},{"key":"5_CR31","unstructured":"Pouzet, M.: Lucid Synchrone: tutorial and reference manual (unpublished) (manuscript, 2001)"},{"issue":"5","key":"5_CR32","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129597002375","volume":"7","author":"J. Power","year":"1997","unstructured":"Power, J., Robinson, E.: Premonoidal categories and notions of computation. Math. Structures in Comput. Sci.\u00a07(5), 453\u2013468 (1997)","journal-title":"Math. Structures in Comput. Sci."},{"issue":"1\u20132","key":"5_CR33","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(01)00024-X","volume":"280","author":"J. Power","year":"2002","unstructured":"Power, J., Watanabe, H.: Combining a monad and a comonad. Theoret. Comput. Sci.\u00a0280(1\u20132), 137\u2013162 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"5_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00895-2","volume":"308","author":"J.J.M.M. Rutten","year":"2003","unstructured":"Rutten, J.J.M.M.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoret. Comput. Sci.\u00a0308(1\u20133), 1\u201353 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR36","first-page":"99","volume-title":"Trends in Functional Programming","author":"T. Uustalu","year":"2002","unstructured":"Uustalu, T., Vene, V.: The dual of substitution is redecoration. In: Hammond, K., Curtis, S. (eds.) Trends in Functional Programming, vol.\u00a03, pp. 99\u2013110. Intellect, Bristol \/ Portland (2002)"},{"issue":"7","key":"5_CR37","first-page":"1310","volume":"11","author":"T. Uustalu","year":"2005","unstructured":"Uustalu, T., Vene, V.: Signals and comonads. J. of Univ. Comput. Sci.\u00a011(7), 1310\u20131326 (2005)","journal-title":"J. of Univ. Comput. Sci."},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/11575467_2","volume-title":"Programming Languages and Systems","author":"T. Uustalu","year":"2005","unstructured":"Uustalu, T., Vene, V.: The Essence of Dataflow Programming (short version). In: Yi, K. (ed.) APLAS 2005. LNCS, vol.\u00a03780, pp. 2\u201318. Springer, Heidelberg (2005)"},{"issue":"3","key":"5_CR39","first-page":"366","volume":"8","author":"T. Uustalu","year":"2001","unstructured":"Uustalu, T., Vene, V., Pardo, A.: Recursion schemes from comonads. Nordic J. of Computing\u00a08(3), 366\u2013390 (2001)","journal-title":"Nordic J. of Computing"},{"key":"5_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/143165.143169","volume-title":"Conf. Record of 19th Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1992","author":"P. Wadler","year":"1992","unstructured":"Wadler, P.: The essence of functional programming. In: Conf. Record of 19th Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1992, pp. 1\u201314. ACM Press, New York (1992)"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-59451-5_2","volume-title":"Advanced Functional Programming","author":"P. Wadler","year":"1995","unstructured":"Wadler, P.: Monads for functional programming. In: Broy, M. (ed.), Program Design Calculi: Proc. of Marktoberdorf Summer School 1992. NATO ASI Series F, vol.\u00a0118, pp. 233\u2013264. Springer, Berlin (1993); Also in Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol.\u00a0925, pp. 24\u201352. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Central European Functional Programming School"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11894100_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T18:07:38Z","timestamp":1683655658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11894100_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540468431","9783540468455"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/11894100_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}