FUNCTIONAL PEARL: Enumerating the rationals

DOI10.1017/S0956796806005880zbMath1103.68444DBLPjournals/jfp/GibbonsLB06OpenAlexW2171866795WikidataQ29041679 ScholiaQ29041679MaRDI QIDQ5472307

Richard S. Bird, Jeremy Gibbons, David R. Lester

Publication date: 9 June 2006

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796806005880

Mathematics Subject Classification ID

Trees (05C05) Functional programming and lambda calculus (68N18) Other combinatorial number theory (11B75)

Related Items (17)

A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra ⋮ Forests of complex numbers ⋮ Stern-Brocot tree and Ducci map ⋮ On Euclid's algorithm and elementary number theory ⋮ Recounting the Rationals: Twice! ⋮ Unnamed Item ⋮ Left–right pairs and complex forests of infinite rooted binary trees ⋮ Euclid, Calkin \& Wilf --- playing with rationals ⋮ Reversing the paths in the Ducci tree ⋮ Free monoids and forests of rational numbers ⋮ Locating terms in the Stern-Brocot tree ⋮ Diophantine aspects of the Calkin-Wilf iteration ⋮ On counting the rational numbers ⋮ The Bird Tree ⋮ An alternative approach to generalized Pythagorean scales. Generation and properties derived in the frequency domain ⋮ A forest of linear fractional transformations ⋮ A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE

This page was built for publication: FUNCTIONAL PEARL: Enumerating the rationals