References

1. Lennart Augustsson (1985): Compiling pattern matching. In: Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 201. Springer-Verlag, pp. 368–381, doi:10.1007/3-540-15975-4_48.
2. George E.P. Box & Gwilym M. Jenkins (1970): Time series analysis: Forecasting and control. Holden–Day, San Francisco.
3. Manfred Broy (1988): Nondeterministic data flow programs: how to avoid the merge anomaly. Science of Computer Programming 10, pp. 65–85, doi:10.1016/0167-6423(88)90016-0.
4. Manfred Broy & Gheorghe Ştefănescu (2001): The algebra of stream processing functions. Theoretical Computer Science 258(1–2), pp. 99–129, doi:10.1016/S0304-3975(99)00322-9.
5. Paul Caspi, Daniel Pilaud, Nicolas Halbwachs & John Plaice (1987): Lustre: A Declarative Language for Programming Synchronous Systems. In: POPL. ACM Press, pp. 178–188, doi:10.1145/41625.41641.
6. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman & F. Kenneth Zadeck (1991): Efficiently computing static single assignment form and the control dependence graph. TOPLAS 13(4), pp. 451–490, doi:10.1145/115372.115320.
7. Esterel Technologies (2013): Scade Suite. Available at http://www.esterel-technologies.com/products/scade-suite/.
8. Thomas A. Henzinger (1996): The Theory of Hybrid Automata. In: Proc. Logic in Computer Science (LICS '96). IEEE Computer Society, pp. 278–292, doi:10.1109/LICS.1996.561342.
9. John Hughes (2000): Generalising monads to arrows. Sci. Comput. Program. 37(1-3), pp. 67–111, doi:10.1016/S0167-6423(99)00023-4.
10. The MathWorks (2000): Simulink, Dynamic System Simulation for Matlab — Using Simulink. Available at http://www.mathworks.com.
11. Eugenio Moggi (1991): Notions of Computation and Monads. Information and Computation 93(1), pp. 55–92, doi:10.1016/0890-5401(91)90052-4.
12. Henrik Nilsson, Antony Courtney & John Peterson (2002): Functional Reactive Programming, Continued. In: Haskell Workshop. ACM, pp. 51–64, doi:10.1145/581690.581695.
13. Milad Niqui & Jan Rutten (2013): Stream processing coalgebraically. Science of Computer Programming 78, pp. 2192–2215, doi:10.1016/j.scico.2012.07.013.
14. Alberto Pardo (1998): Monadic Corecursion – Definition, Fusion Laws and Applications. ENTCS 11, pp. 105–139, doi:10.1016/S1571-0661(04)00055-6.
15. Guy Rouleau & Seth Popinchalk (2008): Initializing Parameters. Matlab Central Blog. Available at http://blogs.mathworks.com/seth/2008/12/25/initializing-parameters/. Retrieved 2013-12-31.
16. Jan J.M.M. Rutten (2000): Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), pp. 3–80, doi:10.1016/S0304-3975(00)00056-6.
17. J. M. Spivey (1988): The Z Notation: a reference manual. International Series in Computer Science. Prentice Hall.
18. (2011): Supercollider Homepage. Available at http://supercollider.sourceforge.net/.
19. Alastair Telford & David A. Turner (1997): Ensuring streams flow. In: Michael Johnson: Algebraic Methodology and Software Technology, Lecture Notes in Computer Science 1349. Springer-Verlag, pp. 509–523, doi:10.1007/BFb0000493.
20. David A. Turner (2004): Total Functional Programming. Univ. Comput. Sci. 10(7), pp. 751–768, doi:10.3217/jucs-010-07-0751.
21. Zhanyong Wan & Paul Hudak (2000): Functional reactive programming from first principles. SIGPLAN Not. 35(5), pp. 242–252, doi:10.1145/358438.349331.
22. Scott Wilson, David Cottle & Nick Collins (2011): The Supercollider Book. The MIT Press. Available at http://supercolliderbook.net.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org