The essence of dataflow programming

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

Volumn 3780 LNCS, Issue , 2005, Pages 2-18

  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

COMPUTATION THEORY; COMPUTER SCIENCE; CONTEXT SENSITIVE LANGUAGES; DATA FLOW ANALYSIS;

CONTEXT-DEPENDENT COMPUTATION; DATAFLOW COMPUTATION; DATAFLOW PROGRAMMING; GENERIC COMONADIC INTERPRETER;

COMPUTER PROGRAMMING;

EID: 33646744717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575467_2     Document Type: Conference Paper

References (37)

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, 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. P. Caspi. Clocks in dataflow languages. Theoret. Comput. Sci., 94(1), pp. 125-140, 1992.
10. 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.
11. Also in SIGPLAN Notices, 31(6), pp. 226-238, 1996.
12. 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.
13. J.-L. Colaço, A. Girault, G. Hamon, M. Pouzet. Towards a higher-order synchronous data-flow language. In Proc. of 4th ACM Int. Conf. on Embedded Software, EMSOFT'04, pp. 230-239. ACM Press, New York, 2004.
14. 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.
15. R. Davies, F. Pfenning. A modal analysis of staged computation. J. of ACM, 48(3), pp. 555-604, 2001.
16. 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.
17. 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.
18. J. Hughes. Generalising monads to arrows. Sci. of Comput. Program., 37(1-3), pp. 67-111, 2000.
19. 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. Sci., pp. 73-129. Springer-Verlag, Berlin, 2005.
20. R. B. Kieburtz. Codata and comonads in Haskell. Unpublished manuscript, 1999.
21. R. B. Kieburtz. Coalgebraic techniques for reactive functional programming, In Actes limes Journées Francophones des Langages Applicatifs, JFLA 2000, pp. 131-157. 2000.
22. 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.
23. E. Moggi. Notions of computation and monads. Inform, and Comput, 93(1), pp. 55-92, 1991.
24. 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.
25. A. Pardo. Generic accumulations. J. Gibbons, J. Jeuring, eds., Proc. of IFIP TC2/WG2.1 Working Conference on Generic Programming, v. 243 of IFIP Conf. Proc., pp. 49-78. Kluwer, Dordrecht, 2003.
26. 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.
27. Also in SIGPLAN Notices, 36(10), pp. 229-240, 2001.
28. R. Paterson. Arrows and computation. In J. Gibbons, O. de Moor, eds., The Fun of Programming, Cornerstones of Computing, pp. 201-222. Palgrave Macillan, Basingstoke / New York, 2003.
29. M. Pouzet. Lucid Synchrone: tutorial and reference manual. Unpublished manuscript, 2001.
30. J. Power, E. Robinson. Premonoidal categories and notions of computation. Math. Structures in Comput. Sci., 7(5), pp. 453-468, 1997.
31. J. Power, H. Watanabe. Combining a monad and a comonad. Theoret. Comput. Sci., 280(1-2), pp. 137-162, 2002.
32. J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Theoret. Comput. Sci., 249(1), pp. 3-80, 2000.
33. 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.
34. 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.
35. T. Uustalu, V. Vene. Signals and comonads. In M. A. Musicante, R. M. F. Lima, ed., Proc. of 9th Brazilian Symp. on Programming Languages, SBLP 2005, pp. 215-228. Univ. de Pernambuco, Recife, PE, 2005.
36. T. Uustalu, V. Vene, A. Pardo. Recursion schemes from comonads. Nordic J. of Computing, 8(3), pp. 366-390, 2001.
37. 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.