A pointless derivation of radix sort

Journal of Functional Programming

Volumn 9, Issue 3, 1999, Pages 339-346

  Gibbons, Jeremy ^a  

^a OXFORD BROOKES UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033463214     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003354     Document Type: Article

References (6)

1. Bird, R. S. (1998) Introduction to Functional Programming using Haskell. Prentice-Hall.
2. Cormen, T. H., Leiserson, C. E. and Rivest, R. L. (1990) Introduction to Algorithms. MIT Press.
3. Gibbons, J. and Jones, G. (1998) The under-appreciated unfold. ACM International Conference on Functional Programming.
4. Knuth, D. E. (1973) The Art of Computer Programming, Volume 3: Sorting and searching. Addison-Wesley.
5. Malcolm, G. (1990) Data structures and program transformation. Science of computer programming, 14, 255-279.
6. Meijer, E., Fokkinga, M. and Paterson, R. (1991) Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed), Functional Programming Languages and Computer Architecture: Lecture Notes in Computer Science 523, pp. 124-144. Springer-Verlag.