Article

Sampling, splitting and merging in coinductive stream calculus

Authors:

Jan RuttenAuthors Info & Claims

MPC'10: Proceedings of the 10th international conference on Mathematics of program construction

Pages 310 - 330

Published: 21 June 2010 Publication History

Abstract

We study various operations for partitioning, projecting and merging streams of data. These operations are motivated by their use in dataflow programming and the stream processing languages. We use the framework of stream calculus and stream circuits for defining and proving properties of such operations using behavioural differential equations and coinduction proof principles. We study the invariance of certain well patterned classes of streams, namely rational and algebraic streams, under splitting and merging. Finally we show that stream circuits extended with gates for dyadic split and merge are expressive enough to realise some non-rational algebraic streams, thereby going beyond ordinary stream circuits.

References

[1]

Arbab, F.: Reo: a channel-based coordination model for component composition. Mathematical Structures in Computer Science 14, 329-366 (2004).

Digital Library

[2]

Allouche, J.-P., Shallit, J.: Automatic sequences: theory, applications, generalizations. Cambridge University Press, Cambridge (2003).

Digital Library

[3]

Berstel, J., Reutenauer, C.: Rational series and their languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988).

Digital Library

[4]

Broy, M., Stefanescu, G.: The algebra of stream processing functions. Theoret. Comput. Sci. 258(1-2), 99-129 (2001).

Digital Library

[5]

Christol, G.: Ensembles presque periodiques k-reconnaissables. Theoret. Comput. Sci. 9(1), 141-145 (1979).

[6]

Cobham, A.: On the base-dependence of sets of numbers recognizable by finite automata. Math. Systems Theory 3, 186-192 (1969).

[7]

Pytheas Fogg, N.: Substitutions in dynamics, arithmetics and combinatorics. In: Berthé, V., Ferenczi, S., Mauduit, C., Siegel, A. (eds.). Lecture Notes in Math., vol. 1794. Springer, Berlin (2002).

[8]

Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete mathematics, 2nd edn. Addison-Wesley, Reading (1994).

[9]

Hungerford, T.W.: Algebra. Graduate Texts in Mathematics, vol. 73, Springer, New York (1980); Reprint of the 1974 original.

[10]

Kahn, G.: The semantics of a simple language for parallel programming. In: Information Processing 74: Proceedings of IFIP Congress 74, Stockholm, August 1974, vol. 74, pp. 471-475. North Holland Publishing Co., Amsterdam (1974).

[11]

Kim, J.: Coinductive properties of causal maps. In: Meseguer, J., Rosu, G. (eds.) AMAST 2008. LNCS, vol. 5140, pp. 253-267. Springer, Heidelberg (2008).

Digital Library

[12]

Lucanu, D., Rosu, G.: CIRC: A circular coinductive prover. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 372-378. Springer, Heidelberg (2007).

Digital Library

[13]

Mak, R.H.: Design and Performance Analysis of Data-independent Stream Processing Systems. PhD thesis, Technische Universiteit Eindhoven (2008).

[14]

Rutten, J.J.M.M.: A coinductive calculus of streams. Mathematical Structures in Computer Science 15, 93-147 (2005).

Digital Library

[15]

Rutten, J.J.M.M.: A tutorial on coinductive stream calculus and signal flow graphs. Theoretical Computer Science 343(3), 443-481 (2005).

Digital Library

[16]

Rutten, J.J.M.M.: Algebraic specification and coalgebraic synthesis of Mealy automata. In: Proceedings of FACS 2005. ENTCS, vol. 160, pp. 305-319. Elsevier Science Publishers, Amsterdam (2006).

[17]

Rutten, J.J.M.M.: Rational streams coalgebraically. Logic. Methods in Comput. Sci. 4(3:9), 1-22 (2008).

[18]

Uustalu, T., Vene, V.: Comonadic notions of computation. In: Adámek, J., Kupke, C. (eds.) Proc. of CMCS 2008. ENTCS, vol. 203(5), pp. 263-284. Elsevier, Amsterdam (June 2008).

Digital Library

[19]

Wilf, H.S.: Generatingfunctionology. Academic Press, London (1994).

Digital Library

Cited By

Hinze RJames DChakravarty MHu ZDanvy O(2011)Proving the unique fixed-point principle correctProceedings of the 16th ACM SIGPLAN international conference on Functional programming10.1145/2034773.2034821(359-371)Online publication date: 19-Sep-2011
https://dl.acm.org/doi/10.1145/2034773.2034821
Hinze RJames D(2011)Proving the unique fixed-point principle correctACM SIGPLAN Notices10.1145/2034574.203482146:9(359-371)Online publication date: 19-Sep-2011
https://dl.acm.org/doi/10.1145/2034574.2034821
Goriac ELucanu DRoşu G(2010)Automating coinduction with case analysisProceedings of the 12th international conference on Formal engineering methods and software engineering10.5555/1939864.1939884(220-236)Online publication date: 17-Nov-2010
https://dl.acm.org/doi/10.5555/1939864.1939884
Show More Cited By

Recommendations

Stream processing coalgebraically

We study various operations for splitting, partitioning, projecting and merging streams of data. These operations are motivated by their use in dataflow programming and stream processing languages. We use the framework of stream calculus and stream ...
Coinductive big-step operational semantics

Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to describe diverging evaluations in addition to terminating evaluations. We ...
Coinductive Axiomatization of Recursive Type Equality and Subtyping

We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

MPC'10: Proceedings of the 10th international conference on Mathematics of program construction

June 2010

426 pages

ISBN:3642133207

Editors:
Claude Bolduc
Université Laval, Département d'informatique et de génie logiciel Pavillon Adrien-Pouliot, Québec, QC, Canada
,
Jules Desharnais
Université Laval, Département d'informatique et de génie logiciel Pavillon Adrien-Pouliot, Québec, QC, Canada
,
Béchir Ktari
Université Laval, Département d'informatique et de génie logiciel Pavillon Adrien-Pouliot, Québec, QC, Canada

Sponsors

l'Universite Laval: l'Universite Laval
Université de Montréal

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 21 June 2010

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hinze RJames DChakravarty MHu ZDanvy O(2011)Proving the unique fixed-point principle correctProceedings of the 16th ACM SIGPLAN international conference on Functional programming10.1145/2034773.2034821(359-371)Online publication date: 19-Sep-2011
https://dl.acm.org/doi/10.1145/2034773.2034821
Hinze RJames D(2011)Proving the unique fixed-point principle correctACM SIGPLAN Notices10.1145/2034574.203482146:9(359-371)Online publication date: 19-Sep-2011
https://dl.acm.org/doi/10.1145/2034574.2034821
Goriac ELucanu DRoşu G(2010)Automating coinduction with case analysisProceedings of the 12th international conference on Formal engineering methods and software engineering10.5555/1939864.1939884(220-236)Online publication date: 17-Nov-2010
https://dl.acm.org/doi/10.5555/1939864.1939884
Hinze R(2010)Concrete stream calculusJournal of Functional Programming10.1017/S095679681000021320:5-6(463-535)Online publication date: 1-Nov-2010
https://dl.acm.org/doi/10.1017/S0956796810000213

View Options

View options

Figures

Tables

Media

View Table of Conten