Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 11
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Han, Sandie Masuda, Ariane M. Singh, Satyanand and Thiel, Johann 2016. The (u,v)-Calkin–Wilf forest. International Journal of Number Theory, Vol. 12, Issue. 05, p. 1311.


    Nathanson, Melvyn B. 2016. Forests of complex numbers. International Journal of Number Theory, p. 1.


    Ferreira, João F. and Mendes, Alexandra 2015. A calculational approach to path-based properties of the Eisenstein–Stern and Stern–Brocot trees via matrix algebra. Journal of Logical and Algebraic Methods in Programming,


    Nathanson, Melvyn B. 2015. Free monoids and forests of rational numbers. Discrete Applied Mathematics,


    Nathanson, Melvyn B. 2015. A forest of linear fractional transformations. International Journal of Number Theory, Vol. 11, Issue. 04, p. 1275.


    Aviezri S. Fraenkel, 2012. RATWYT. The College Mathematics Journal, Vol. 43, Issue. 2, p. 160.


    Backhouse, Roland and Ferreira, João F. 2011. On Euclid’s algorithm and elementary number theory. Science of Computer Programming, Vol. 76, Issue. 3, p. 160.


    Almada, Carlos 2010. On counting the rational numbers. International Journal of Mathematical Education in Science and Technology, Vol. 41, Issue. 8, p. 1096.


    Bates, Bruce Bunder, Martin and Tognetti, Keith 2010. Locating terms in the Stern–Brocot tree. European Journal of Combinatorics, Vol. 31, Issue. 3, p. 1020.


    HINZE, RALF 2009. The Bird Tree. Journal of Functional Programming, Vol. 19, Issue. 05, p. 491.


    DILCHER, KARL and STOLARSKY, KENNETH B. 2007. A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE. International Journal of Number Theory, Vol. 03, Issue. 01, p. 85.


    ×

FUNCTIONAL PEARL: Enumerating the rationals

  • JEREMY GIBBONS (a1), DAVID LESTER (a2) and RICHARD BIRD (a1)
  • DOI: http://dx.doi.org/10.1017/S0956796806005880
  • Published online: 01 May 2006
Abstract

Every lazy functional programmer knows about the following approach to enumerating the positive rationals: generate a two-dimensional matrix (an infinite list of infinite lists), then traverse its finite diagonals (an infinite list of finite lists).

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×