Recounting the Rationals: Twice!

DOI10.1007/978-3-540-70594-9_6zbMath1156.11308OpenAlexW1830536334MaRDI QIDQ3521981

João F. Ferreira, Roland C. Backhouse

Publication date: 28 August 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70594-9_6

zbMATH Keywords

rational numbersStern-Brocot treeCalkin-Wilf treeenumeration algorithmalgorithm derivation

Mathematics Subject Classification ID

Trees (05C05) Functional programming and lambda calculus (68N18) Number-theoretic algorithms; complexity (11Y16) Other combinatorial number theory (11B75)

Related Items (4)

A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra ⋮ Cluster duality between Calkin-Wilf tree and Stern-Brocot tree ⋮ On Euclid's algorithm and elementary number theory ⋮ The Bird Tree

Cites Work

• Recounting the Rationals
• Guarded commands, nondeterminacy and formal derivation of programs
• FUNCTIONAL PEARL: Enumerating the rationals
• Unnamed Item
• Unnamed Item

This page was built for publication: Recounting the Rationals: Twice!