Numerical Representations as Higher-Order Nested Datatypes (1998)

Cached

Download Links

by Ralf Hinze
Citations:5 - 2 self

Active Bibliography

13 Purely Functional, Real-Time Deques with Catenation – Haim Kaplan, Robert E. Tarjan - 1999
11 Simple Confluently Persistent Catenable Lists – Haim Kaplan, Chris Okasaki, Robert E. Tarjan - 1998
2 Benchmarking Purely Functional Data Structures – Graeme E. Moss - 1999
5 Finger Search Trees – Gerth Stølting Brodal - 2005
10 Persistent data structures – Haim Kaplan - 1995
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996
Finger Search on Balanced Search Trees – Maverick Woo - 2006
10 Space-efficient finger search on degree-balanced search trees – Guy E. Blelloch, Bruce M. Maggs, Shan Leung, Maverick Woo - 2003
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
10 Making Data Structures Confluently Persistent – Amos Fiat, Haim Kaplan, Albert Einstein - 2001
8 Real-time Garbage Collection of a Functional Persistent Heap – Tekij"a Kenneth Oksanen - 1999
5 Automated Benchmarking of Functional Data Structures – Graeme E. Moss, Colin Runciman - 1999
4 Generic Operations on Nested Datatypes – Ian Bayley - 2001
24 Manufacturing Datatypes – Ralf Hinze - 1999
13 Polytypic Programming With Ease – Ralf Hinze - 1999
13 Polytypic Functions Over Nested Datatypes – Ralf Hinze - 1999
4 Disciplined, efficient, generalised folds for nested datatypes – Clare Martin, Jeremy Gibbons, Ian Bayley
5 Functional Pearls: Explaining Binomial Heaps – Ralf Hinze - 1999
Loopless Functional Algorithms – Jamie Snape - 2005