![]() |
CiteULike | ![]() |
voigt's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Much Ado about Two: A Pearl on Parallel Prefix Computationedited by: Philip WadlerSIGPLAN Notices In 35th Symposium on Principles of Programming Languages, Proceedings, Vol. 43, No. 1. (January 2008), pp. 29-35.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThis pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite enough here. The perfect hammer for the nails we are going to drive in is relational parametricity.
BibTeX record
RIS record