Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
As research in programming language design, implementation, and application advances, we must regularly revisit the undergraduate curriculum to ensure course content advances simi...
Abstract—Recent years have seen a trend in using graphic processing units (GPU) as accelerators for general-purpose computing. The inexpensive, single-chip, massively parallel ar...
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...
Adaptive applications have computational workloads and communication patterns which change unpredictably at runtime, requiring dynamic load balancing to achieve scalable performan...
Hongzhang Shan, Jaswinder Pal Singh, Leonid Oliker...