|
89
|
de Moor, O.: Algebra of Programming
– R Bird
- 1997
|
|
274
|
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
– Erik Meijer, Maarten Fokkinga, Ross Paterson
- 1991
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
2
|
Functional Pearl: the countdown problem
– Graham Hutton
- 2002
|
|
4
|
A calculational approach to program inversion
– S-C Mu
- 2003
|
|
52
|
98 Language and Libraries
– Haskell
- 2003
|
|
13
|
Memo Functions, Polytypically!
– Ralf Hinze
- 2000
|
|
160
|
Planar point location using persistent search trees
– Neil Sarnak, Robert E Tarjan
- 1986
|
|
299
|
The Art of Computer Programming, volume 1 (Fundamental Algorithms
– Donald E Knuth
- 1973
|
|
83
|
Memo functions and machine learning
– Donald Michie
- 1968
|
|
7
|
international conference on mathematics of program construction
– Fourth
|
|
2
|
A diochromatic framework for balanced trees. Pages 8--21 of
– Leo J Guibas
- 1978
|
|
13
|
Polytypic Programming With Ease
– Ralf Hinze
- 1999
|
|
5
|
Numerical Representations as Higher-Order Nested Datatypes
– Ralf Hinze
- 1998
|
|
2
|
Constructing red-black trees. Okasaki, C. (ed
– R Hinze
- 1999
|
|
6
|
Polymorphic type schemes and recursive
– A Mycroft
- 1984
|
|
2
|
On uniquely represented data structures (extended abstract
– L Snyder
- 1977
|
|
1
|
Dependently typed data structures. Okasaki, C. (ed
– H Xi
- 1999
|
|
4
|
Perfect Trees and Bit-reversal Permutations
– Ralf Hinze
- 1999
|
