Perfect Trees and Bit-reversal Permutations (1999)

Cached

Download Links

by Ralf Hinze
Citations:4 - 2 self

Active Bibliography

5 Numerical Representations as Higher-Order Nested Datatypes – Ralf Hinze - 1998
31 Generalizing Generalized Tries – Ralf Hinze - 1999
24 Manufacturing Datatypes – Ralf Hinze - 1999
11 Efficient Generalized Folds – Ralf Hinze - 1999
96 A New Approach to Generic Functional Programming – Ralf Hinze - 1999
68 De Bruijn notation as a nested datatype – Richard S. Bird, Ross Paterson, Sir Arthur, Conan Doyle - 1999
Perfect Trees and Bit-Reversal Permutations – Funct I Onal Pearl, Perfect Trees, Bit-reversal Permutations, Ralf Hinze - 1999
34 Generalised Folds for Nested Datatypes – Richard Bird, Ross Paterson - 1999
13 Polytypic Programming With Ease – Ralf Hinze - 1999
Adjoint Folds and Unfolds Or: Scything Through the Thicket of Morphisms – Ralf Hinze
4 Generic Operations on Nested Datatypes – Ian Bayley - 2001
65 Generic Haskell: practice and theory – Ralf Hinze, Johan Jeuring - 2003
9 Constructing Red-Black Trees – Ralf Hinze - 1999
2 Functional Pearls - Three Algorithms on Braun Trees – Chris Okasaki - 1997
3 Generic programming, now – Ralf Hinze, Andres Löh - 2006
8 A Simple Implementation Technique for Priority Search Queues – Ralf Hinze - 2001
9 Dimension Inference under Polymorphic Recursion – Mikael Rittri - 1995
107 Polytypic Values Possess Polykinded Types – Ralf Hinze - 2000
7 An Algebra of Scans – Ralf Hinze - 2004