| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875167 | Science of Computer Programming | 2018 | 17 Pages |
Abstract
We evaluated the expressiveness of the library by proving that red-black tree insertion and search, merge sort, insertion sort, various Fibonacci number implementations, iterated list insertion, various BigNum operations, and Okasaki's Braun Tree algorithms all have their expected running times.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jay McCarthy, Burke Fetscher, Max S. New, Daniel Feltey, Robert Bruce Findler,