|
4
|
Perfect Trees and Bit-reversal Permutations
– Ralf Hinze
- 1999
|
|
7
|
A Simple Implementation Technique for Priority Search Queues
– Ralf Hinze
- 2001
|
|
5
|
An Algebra of Scans
– Ralf Hinze
- 2004
|
|
22
|
Manufacturing Datatypes
– Ralf Hinze
- 1999
|
|
3
|
Generic programming, now
– Ralf Hinze, Andres Löh
- 2006
|
|
4
|
Automated Benchmarking of Functional Data Structures
– Graeme E. Moss, Colin Runciman
- 1999
|
|
15
|
Optimal Purely Functional Priority Queues
– Gerth Stølting Brodal, Gerth Stlting Brodal, Chris Okasaki, Chris Okasaki
- 1996
|
|
15
|
Purely Functional Random-Access Lists
– Chris Okasaki
- 1995
|
|
19
|
Fast Mergeable Integer Maps
– Chris Okasaki, Andrew Gill
- 1998
|
|
13
|
A New Method for Functional Arrays
– Melissa O'Neill, F. Warren Burton
- 1997
|
|
|
Purity, Impurity and Efficiency in Graph Algorithms
– n.n.
|
|
|
Quicksort via Bird's Tree Fusion Transformation
– Tjark Weber And, Tjark Weber, James Caldwell
|
|
2
|
Polytypic Abstraction in Type Theory
– H. Pfeifer, H. Rueß
- 1998
|
|
9
|
Constructing Red-Black Trees
– Ralf Hinze
- 1999
|
|
2
|
Linked Lists Calculated
– Copyright C Fl Bernhard Moller, Bernhard Möller, Bernhard Moller
- 1997
|
|
1
|
An iterator construct for the refinement calculus
– Steve King, Carroll Morgan
- 2000
|
|
|
Are Anamorphisms Reasonable Abstractions?
– Bernhard Möller
- 1998
|
|
|
Scientific Report of the HDR application file.
– unknown authors
- 1998
|
|
3
|
Constructively characterizing fold and unfold
– Tjark Weber, James Caldwell
- 2003
|
