3 citations · 7 across the 9 of their papers we have counts for
7 papers · 1 filter
Quantum Hoare Type Theory
Kartik Singhal
As quantum computers become real, it is high time we come up with effective techniques that help programmers write correct quantum programs. Inspired by Hoare Type Theory in classi…
Compiling with Continuations and LLVM
Kavon Farvardin, John Reppy
LLVM is an infrastructure for code generation and low-level optimizations, which has been gaining popularity as a backend for both research and industrial compilers, including many…
Compiling Diderot: From Tensor Calculus to C
Charisee Chiw, Gordon L. Kindlmann, John Reppy
Diderot is a parallel domain-specific language for analysis and visualization of multidimensional scientific images, such as those produced by CT and MRI scanners. In particular, i…
Properties of Normalization for a math based intermediate representation
Charisee Chiw, John Reppy
The Normalization transformation plays a key role in the compilation of Diderot programs. The transformations are complicated and it would be easy for a bug to go undetected. To in…
Practical Inlining of Functions with Free Variables
Lars Bergstrom, Matthew Fluet, John Reppy +1
A long-standing practical challenge in the optimization of higher-order languages is inlining functions with free variables. Inlining code statically at a function call site is saf…
Garbage Collection for Multicore NUMA Machines
Sven Auhagen, Lars Bergstrom, Matthew Fluet +1
Modern high-end machines feature multiple processor packages, each of which contains multiple independent cores and integrated memory controllers connected directly to dedicated ph…