Signals and comonads

Journal of Universal Computer Science

Volumn 11, Issue 7, 2005, Pages 1310-1326

  Uustalu, Tarmo ^a   Vene, Varmo ^b  

^a TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

^b UNIVERSITY OF TARTU   (Estonia)

Author keywords

Comonads; Dataflow computation; Distributive laws; Stream functions

Indexed keywords

EID: 24944434990     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (25)

1. [Aczel et al. 2003] Aczel, P., Adámek, J., Milius, S., Velebil, J.: "Infinite trees and completely iterative theories: A coalgebraic view"; Theoret. Comput. Sci., 300, 1-3 (2003), 1-45.
2. [Aschroft and Wadge 1985] Ashcroft, E. A., Wadge W. W.: "LUCID, The Dataflow Programming Language"; Academic Press, New York (1985).
3. [Barbier 2002] Barbier, B.: "Solving stream equation systems"; Actes 13mes Journées Francophones des Langages Applicatifs, JFLA 2002 (2002), 117-139.
4. [Benton et al. 2002] Benton, N., Hughes, J., E. Moggi, E.: "Monads and effects"; Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.), Advanced Lectures from Int. Summer School on Applied Semantics, APPSEM 2000, Lect. Notes in Comput. Sci., 2395, Springer-Verlag, Berlin (2002), 42-122.
5. [Brookes and Geva 1992] Brookes, S., Geva, S.: "Computational comonads and intensional semantics"; Fourman, M. P., Johnstone, P. T., Pitts, A. M. (eds.), Applications of Categories in Computer Science, London Math. Society Lecture Note Series, 177, Cambridge University Press, Cambridge (1992), 1-44.
6. [Caspi and Pouzet 1996] Caspi, P., Pouzet, M.: "Synchronous Kahn networks"; Proc. of 1st ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'96, ACM Press, New York (1996), 226-238;
7. also SIGPLAN Notices, 31, 6 (1996), 226-238.
8. [Caspi and Pouzet 1998] Caspi, P., Pouzet, M.: "A co-iterative characterization of synchronous stream functions"; Jacobs, B., Moss, L., Reichel, H., Rutten, J. (eds.), Proc. of 1st Wksh. on Coalgebraic Methods in Computer Science, CMCS'98, Electron. Notes in Theoret. Comput. Sci., 11, Elsevier, Amsterdam (1998).
9. [Halbwachs 1991] Halbwachs, N., Caspi, P., Raymond, P., Pilaud, D.: "The synchronous data flow programming language LUSTRE"; Proc. of the IEEE, 79, 9 (1991), 1305-1320.
10. [Hughes 2000] Hughes, J.: "Generalising monads to arrows"; Sci. of Comput. Program., 37, 1-3 (2000), 67-111.
11. [Kieburtz 1999] Kieburtz, R. B.: "Codata and comonads in Haskell"; unpublished manuscript (1999).
12. [Kieburtz 2000] Kieburtz, R. B.: "Coalgebraic techniques for reactive functional programming"; Actes 11mes Journées Francophones des Langages Applicatifs, JFLA 2000 (2000), 131-157.
13. [Lewis et al. 2000] Lewis, J. R., Shields, M. B., Meijer, E., Launchbury, J.: "Implicit parameters: Dynamic scoping with static types"; Proc. of 27th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL'00, ACM Press, New York (2000), 108-118.
14. [Moggi 1991] Moggi, E.: "Notions of computation and monads"; Inform, and Comput., 93, 1 (1991), 55-92.
15. [Nilsson et al. 2002] Nilsson, H., Courtney, A., Peterson, J.: "Functional reactive programming, continued"; Proc. of 2002 ACM SIGPLAN Wksh. on Haskell, Haskell'02, ACM Press, New York (2002), 51-64.
16. [Paterson 2001] Paterson, R.: "A new notation for arrows"; Proc. of 6th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'01, ACM Press, New York (2001),229-240;
17. also SIGPLAN Notices, 36, 10 (2001), 229-240.
18. [Paterson 2003] Paterson, R.: "Arrows and computation"; Gibbons, J., de Moor, O. (Eds.), The Fun of Programming, Cornerstones of Computing, Palgrave MacMillan, Basingstoke / New York (2003), 201-222.
19. [Pouzet 2001] Pouzet, M.: "Lucid Synchrone: tutorial and reference manual"; unpublished manuscript (2001).
20. [Power and Robinson 1997] Power, J., Robinson, E.: "Premonoidal categories and notions of computation"; Math. Structures in Comput. Sci., 7, 5 (1997), 453-468.
21. [Power and Watanabe 2002] Power, J., Watanabe, H.: "Combining a monad and a comonad"; Theoret. Comput. Sci., 280, 1-2 (2002), 137-162.
22. [Rutten 2000] Rutten, J. J. M. M.: "Universal coalgebra: a theory of systems"; Theoret. Comput. Sci., 249, 1 (2000), 3-80.
23. [Rutten 2003] Rutten, J. J. M. M.: "Behavioural differential equations: a coinductive calculus of streams, automata, and power series"; Theoret. Comput. Sci., 308, 1-3 (2003), 1-53.
24. [Uustalu and Vene 2002] Uustalu, T., Vene, V.: "The dual of substitution is redecoration"; Hammond, K., Curtis, S. (eds.), Trends in Functional Programming 3, Intellect, Bristol / Portland, OR (2002), 99-110.
25. [Wadler 1992] Wadler, P.: "The essence of functional programming"; Conf. Record of 19th Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL'92, ACM Press, New York (1992), 1-14.