Parallel Functional Arrays Ananya Kumar Carnegie Mellon University ananyak@andrew.cmu.edu Guy E. Blelloch Carnegie Mellon University blelloch@cs.cmu.edu Robert Harper Carnegie Mellon University rwh@cs.cmu.edu Abstract The goal of our paper is to come up with functional arrays (se- quences) that are as efficient as imperative arrays, can be used in parallel, and have well defined cost-semantics. Our
PREV IEW Practical Foundations for Programming Languages SECOND EDITION Robert Harper Carnegie Mellon University PREV IEW Copyright © 2015 by Robert Harper. All Rights Reserved. This is a draft version of a book published by Cambridge University Press (http: //www.cambridge.org). This draft is made available for the personal use of a single individual. The reader may make one copy for personal us
Purely Functional Data Structures Chris Okasaki September 1996 CMU-CS-96-177 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy. Thesis Committee: Peter Lee, Chair Robert Harper Daniel Sleator Robert Tarjan, Princeton University Copyright c 1996 Chris Okasaki This research was sponso
Papers A verified cost analysis of joinable red-black trees. Runming Li, Harrison Grodin, and Robert Harper. October, 2023. Logical Relations for Session-Typed Concurrency. Stephanie Balzer, Farzaneh Derakhshan, Robert Harper, and Yue Yao. July 2023. Decalf: A Directed, Effectful Cost-Aware Logical Framework. Harrison Grodin, Robert Harper, Yue Niu, and Jonathan Sterling. July 2023. (Repository: D
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く