A tutorial on coinductive stream calculus and signal flow graphs

P. Aczel, N. Mendler, A final coalgebra theorem, in: D.H. Pitt, D.E. Ryeheard, P. Dybjer, A.M. Pitts, A. Poigne (Eds.), Proc. Category Theory and Computer Science, Lecture Notes in Computer Science, Vol. 389, Springer, Berlin, 1989, pp. 357–365. Arbab, 2004, Reo: a channel-based coordination model for component composition, Math. Struct. Comput. Sci., 14, 329, 10.1017/S0960129504004153 F. Arbab, J.J.M.M. Rutten, A coinductive calculus of component connectors, in: M. Wirsing, D. Pattinson, R. Hennicker (Eds.), Proc. WADT 2002, Lecture Notes in Computer Science, Vol. 2755, Springer, Berlin, 2003, pp. 35–56. Arbib, 1980, Machines in a category, J. Pure Appl. Algebra, 19, 9, 10.1016/0022-4049(80)90090-0 CMCS’98-’02, Proc. Internat. Workshop Series Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science, Vols. 11, 19, 33, 44, 65, Elsevier Science B.V., Amsterdam. Lahti, 1998 Manes, 1986 R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, Springer, Berlin, 1980. D.M.R. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proc. 5th GI Conference, Lecture Notes in Computer Science, Vol. 104, Springer, Berlin, 1981, pp. 167–183. Rutten, 2000, Universal coalgebra: a theory of systems, Theoret. Comput. Sci., 249, 3, 10.1016/S0304-3975(00)00056-6 J.J.M.M. Rutten, Elements of stream calculus (an extensive exercise in coinduction) in: S. Brooks, M. Mislove (Eds.), Proc. MFPS 2001, Electronic Notes in Theoretical Computer Science, Vol. 45, Elsevier Science Publishers, Amsterdam, 2001, pp. 1–66. J.J.M.M. Rutten, The differential calculus of bitstreams, Report SEN-E0403, CWI, 2004. J. van Benthem, Modal correspondence theory, Ph.D. Thesis, University of Amsterdam, Amsterdam, 1976.