Aigner M. & Ziegler G. M. (2004) Proofs from THE BOOK, 3rd edn.Springer-Verlag.
Backhouse R. & Ferreira J. F. (2008) Recounting the rationals: Twice!, In The 9th International Conference on Mathematics of Program Construction (MPC '08), Audebaud P. & Paulin-Mohring C. (eds), Lecture Notes in Computer Science, vol. 5133. Springer, pp. 79–91.
Bird R. S. (2006) Loopless functional algorithms. In The 8th International Conference on Mathematics of Program Construction (MPC '06), Uustalu T. (ed.), Lecture Notes in Computer Science, vol. 4014. Springer, pp. 90–114.
Calkin N. & Wilf H. (2000) Recounting the rationals, Am. Math. Monthly, 107 (4): 360–363.
Dijkstra E. W. (1976) EWD 570: An exercise for Dr. R. M. Burstall. In Selected Writings on Computing: A Personal Perspective, Dijkstra E. W. Springer, pp. 215–216. ISBN 0–387–90652–5.
Gibbons J., Lester D. & Bird R. (2006) Functional pearl: Enumerating the rationals, J. Funct. Program., 16 (3): 281–291.
Graham R. L., Knuth D. E. & Patashnik O. (1994) Concrete Mathematics, 2nd ed.Addison-Wesley.
Hinze R. (2008) Functional pearl: Streams and unique fixed points. In Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP '08), Thiemann P. (ed.). ACM Press, pp. 189–200.
McBride C. & Paterson R. (2008) Functional pearl: Applicative programming with effects, J. Funct. Program., 18 (1): 1–13.
Peyton Jones S. (2003) Haskell 98 Language and Libraries. Cambridge University Press.
Rutten J. (2003) Fundamental study: Behavioural differential equations: A coinductive calculus of streams, automata, and power series, Theoret. Comp. Sci., 308: 1–53.