FUNCTIONAL PEARL: Enumerating the rationals

Authors:
Jeremy Gibbons;David Lester;Richard Bird
Affiliations:
University of Oxford, Parks Road, Oxford, UK jeremy.gibbons@comlab.ox.ac.uk, richard.bird@comlab.ox.ac.uk;University of Manchester, Manchester, UK dlester@cs.man.ac.uk;University of Oxford, Parks Road, Oxford, UK jeremy.gibbons@comlab.ox.ac.uk, richard.bird@comlab.ox.ac.uk
Venue:
Journal of Functional Programming
Year:
2006

Citing 4
Cited 6

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Selected writings on computing: a personal perspective

Selected writings on computing: a personal perspective
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Perfect trees and bit-reversal permutations

Journal of Functional Programming

Recounting the Rationals: Twice!

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
The bird tree

Journal of Functional Programming
Locating terms in the Stern-Brocot tree

European Journal of Combinatorics
Datatype-generic programming

SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming
On Euclid's algorithm and elementary number theory

Science of Computer Programming
Counting paths in planar width 2 branching programs

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128

Quantified Score

Hi-index	0.00

Visualization

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).