The essence of dataflow programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4164 LNCS, Issue , 2006, Pages 135-167

  Uustalu, Tarmo ^a   Vene, Varmo ^b  

^a TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

^b UNIVERSITY OF TARTU   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA FLOW ANALYSIS; DATA STRUCTURES; FUNCTIONS;

COKLEISLI ARROWS; CONTEXT-DEPENDENT COMPUTATION; DISTRIBUTIVE LAWS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33751405362     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11894100_5     Document Type: Conference Paper

References (45)

1. P. Aczel, J. Adámek, S. Milius, J. Velebil. Infinite trees and completely iterative theories: A coalgebraic view. Theoret. Comput. Sci., 300 (1-3), pp. 1-45, 2003.
2. E. A. Ashcroft, W. W. Wadge. LUCID, The Dataflow Programming Language. Academic Press, New York, 1985.
3. E. A. Ashcroft, A. A. Faustini, R. Jagannathan, W. W. Wadge. Multidimensional Programming. Oxford University Press, New York, 1995.
4. B. Barbier. Solving stream equation systems. In Actes 13mes Journées Francophones des Langages Applicatifs, JFLA 2002, pp. 117-139. 2002.
5. N. Benton, G. Bierman, V. de Paiva, M. Hyland. Linear lambda-calculus and categorical models revisited. In E. Börger et al., eds. Proc. of 6th Wksh. on Computer Science Logic, CSL '92, v. 702 of Lect. Notes in Comput. Sci., pp. 61-84. Springer-Verlag, Berlin, 1993.
6. N. Benton, J. Hughes, E. Moggi. Monads and effects. In G. Barthe, P. Dybjer, L. Pinto, J. Saraiva, eds., Advanced Lectures from Int. Summer School on Applied Semantics, APPSEM 2000, v. 2395 of Lect. Notes in Comput. Sci., pp. 42-122. Springer-Verlag, Berlin, 2002.
7. G. Bierman, V. de Paiva. On an intuitionistic modal logic. Studia Logica, 65(3), pp. 383-416, 2000.
8. S. Brookes, S. Geva. Computational comonads and intensional semantics. In M. P. Fourman, P. T. Johnstone, and A. M. Pitts, eds., Applications of Categories in Computer Science, v. 177 of London Math. Society Lecture Note Series, pp. 1-44. Cambridge Univ. Press, Cambridge, 1992.
9. V. Capretta, T. Uustalu, V. Vene. Recursive coalgebras from comonads. Inform. and Comput., 204(4), pp. 437-468, 2006.
10. P. Caspi. Clocks in dataflow languages. Theoret. Comput. Sci., 94(1), pp. 125-140, 1992.
11. P. Caspi, M. Pouzet. Synchronous Kahn networks. In Proc. of 1st ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'96, pp. 226-238. ACM Press, New York, 1996.
12. Also in ACM SIGPLAN Notices, 31(6), pp. 226-238, 1996.
13. P. Caspi, M. Pouzet. A co-iterative characterization of synchronous stream functions. In B. Jacobs, L. Moss, H. Reichel, J. Rutten, eds., Proc. of 1st Wksh. on Coalgebraic Methods in Computer Science, CMCS'98, v. 11 of Electron. Notes in Theoret. Comput. Sci. Elsevier, Amsterdam, 1998.
14. th ACM Int. Conf. on Embedded Software, EMSOFT'04, pp. 230-239. ACM Press, New York, 2004.
15. J.-L. Colaço, M. Pouzet. Clocks and first class abstract types. In R. Alur, I. Lee, eds., Proc. of 3rd Int. Conf. on Embedded Software, EMSOFT 2003, v. 2855 of Lect. Notes in Comput. Sci., pp. 134-155. Springer-Verlag, Berlin, 2003.
16. R. Davies, F. Pfenning. A modal analysis of staged computation. J. of ACM, 48(3), pp. 555-604, 2001.
17. L. Erkök, J. Launchbury. Monadic recursive bindings. In Proc. of 5th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'00, pp. 174-185. ACM Press, New York, 2000.
18. Also in ACM SIGPLAN Notices, 35(9), pp. 174-185, 2000.
19. N. Halbwachs, P. Caspi, P. Raymond, D. Pilaud. The synchronous data flow programming language LUSTRE. Proc. of the IEEE, 79(9), pp. 1305-1320, 1991.
20. P. Hudak, A. Courtney, H. Nilsson, J. Peterson. Arrows, robots, and functional programming. In J. Jeuring, S. Peyton Jones, eds., Revised Lectures from 4th Int. School on Advanced Functional Programming, AFP 2002, v. 2638 of Lect. Notes in Comput. Sci., pp. 159-187. Springer-Verlag, Berlin, 2003.
21. J. Hughes. Generalising monads to arrows. Sci. of Comput. Program., 37(1-3), pp. 67-111, 2000.
22. J. Hughes. Programming with arrows. In V. Vene, T. Uustalu, eds., Revised Lectures from 5th Int. School on Advanced Functional Programming, AFP 2004, v. 3622 of Lect Notes in Comput. Sei., pp. 73-129. Springer-Verlag, Berlin, 2005.
23. C. Heunen, B. Jacobs. Arrows, like monads, are monoids. In S. Brookes, M. Mislove, eds., Proc. of 22nd Ann. Conf. on Mathematical Foundations of Programming Semantics, MFPS XXII, v. 158 of Electron. Notes in Theoret. Comput. Sci., pp. 219-236. Elsevier, Amsterdam, 2006.
24. B. Jacobs, I. Hasuo. Freyd is Kleisli, for arrows. In C. McBride, T. Uustalu, Proc. of Wksh. on Mathematically Structured Programming, MSFP 2006, Electron. Wkshs. in Computing. BCS, 2006.
25. R. B. Kieburtz. Codata and comonads in Haskell. Unpublished manuscript, 1999.
26. R. B. Kieburtz. Coalgebraic techniques for reactive functional programming, In Actes 11mes Journées Francophones des Langages Applicatifs, JFLA 2000, pp. 131-157. 2000.
27. J. R. Lewis, M. B. Shields, E. Meijer, J. Launchbury. Implicit parameters: Dynamic scoping with static types. In Proc. of 27th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL'00, pp. 108-118. ACM Press, New York, 2000.
28. E. Moggi. Notions of computation and monads. Inform, and Comput., 93(1), pp. 55-92, 1991.
29. H. Nilsson, A. Courtney, J. Peterson. Functional reactive programming, continued. In Proc. of 2002 ACM SIGPLAN Wksh. on Haskell, Haskell'02, pp. 51-64. ACM Press, New York, 2002.
30. A. Pardo. Generic accumulations. J. Gibbons, J. Jeuring, eds., Proc. of IFIP TC2/WG2.1 Working Conf. on Generic Programming, v. 243 of IFIP Conf. Proc., pp. 49-78. Kluwer, Dordrecht, 2003.
31. R. Paterson. A new notation for arrows. In Proc. of 6th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'01, ACM Press, New York, pp. 229-240, 2001.
32. Also in ACM SIGPLAN Notices, 36(10), pp. 229-240, 2001.
33. R. Paterson. Arrows and computation. In J. Gibbons, O. de Moor, eds., The Fun of Programming, Cornerstones of Computing, pp. 201-222. Palgrave MacMillan, Basingstoke / New York, 2003.
34. M. Pouzet. Lucid Synchrone: tutorial and reference manual. Unpublished manuscript, 2001.
35. J. Power, E. Robinson. Premonoidal categories and notions of computation. Math. Structures in Comput. Sci., 7(5), pp. 453-468, 1997.
36. J. Power, H. Watanabe. Combining a monad and a comonad. Theoret. Comput. Sci., 280(1-2), pp. 137-162, 2002.
37. J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Theoret. Comput. Sci., 249(1). pp. 3-80, 2000.
38. J. J. M. M. Rutten. Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoret. Comput. Sci., 308(1-3), pp. 1-53, 2003.
39. T. Uustalu, V. Vene. The dual of substitution is redecoration. In K. Hammond, S. Curtis (Eds.), Trends in Functional Programming 3, pp. 99-110. Intellect, Bristol / Portland, OR, 2002.
40. T. Uustalu, V. Vene. Signals and comonads. J. of Univ. Comput. Sci., 11(7), pp. 1310-1326, 2005.
41. T. Uustalu. V. Vene. The essence of dataflow programming (short version). In K. Yi, ed., Proc. of 3rd Asian Symp. on Programming Languages and Systems, APLAS 2005, v. 3780 of Lect. Notes in Comput. Sci., pp. 2-18. Springer-Verlag, Berlin, 2005.
42. T. Uustalu, V. Vene, A. Pardo. Recursion schemes from cornonads. Nordic J. of Computing, 8(3), pp. 366-390, 2001.
43. P. Wadler. The essence of functional programming. In Conf. Record of 19th Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL'92, pp. 1-14. ACM Press, New York, 1992.
44. P. Wadler. Monads for functional programming. In M. Broy, ed., Program Design Calculi: Proc. of Marktoberdorf Summer School 1992, v. 118 of NATO ASI Series F, pp. 233-264. Springer-Verlag, Berlin, 1993.
45. Also in J. Jeuring, E. Meijer, eds., Tutorial Text from 1st Int. Spring School on Advanced Functional Programming Techniques AFP '95, v. 925 of Lect. Notes in Comput. Sci., pp. 24-52. Springer-Verlag, Berlin, 1995.