Skip to main content

Parberry’s pairwise sorting network revealed

  • RALF HINZE (a1) and CLARE MARTIN (a2)
Hide All
Bove, A. & Coquand, T. (2006) Formalising bitonic sort in type theory. In Types for Proofs and Programs, Filliâtre, J.-C., Paulin-Mohring, C., and Werner, B. (eds), Lecture Notes in Computer Science, vol. 3839. Berlin, Heidelberg: Springer, pp. 8297.
Codish, M. & Zazon-Ivry, M. (2010) Pairwise cardinality networks. In Proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2010. Berlin, Heidelberg: Springer-Verlag, pp. 154172.
Hinze, R. (2000) Functional Pearl: Perfect trees and bit-reversal permutations. J. Funct. Program. 10(3), 305317.
Hinze, R. & Martin, C. (2018) Functional Pearl: Batcher’s odd-even merging network revealed. J. Funct. Program. 28(e14), 113.
Knuth, D. E. (1998) The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd edn. Reading, MA: Addison-Wesley Publishing Company.
Parberry, I. (1992) The pairwise sorting network. Parallel Process. Lett. 2(2&3), 205211.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Parberry’s pairwise sorting network revealed

  • RALF HINZE (a1) and CLARE MARTIN (a2)
Submit a response


No Discussions have been published for this article.


Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *