180 citations · 259 across the 7 of their papers we have counts for
6 papers · 1 filter
Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs
Charles Yuan, Christopher McNally, Michael Carbin
Quantum programming languages enable developers to implement algorithms for quantum computers that promise computational breakthroughs in classically intractable tasks. Programming…
Simplifying Dependent Reductions in the Polyhedral Model
Cambridge Yang, Eric Atkinson, Michael Carbin
A Reduction -- an accumulation over a set of values, using an associative and commutative operator -- is a common computation in many numerical computations, including scientific c…
: Computable Semantics for Differentiable Programming with Higher-Order Functions and Datatypes
Benjamin Sherman, Jesse Michel, Michael Carbin
Deep learning is moving towards increasingly sophisticated optimization objectives that employ higher-order functions, such as integration, continuous optimization, and root-findin…
Reactive Probabilistic Programming
Guillaume Baudart, Louis Mandel, Eric Atkinson +3
Synchronous modeling is at the heart of programming languages like Lustre, Esterel, or Scade used routinely for implementing safety critical control software, e.g., fly-by-wire and…
Verifying Programs Under Custom Application-Specific Execution Models
Brett Boston, Zoe Gong, Michael Carbin
Researchers have recently designed a number of application-specific fault tolerance mechanisms that enable applications to either be naturally resilient to errors or include additi…
Verifying Handcoded Probabilistic Inference Procedures
Eric Atkinson, Cambridge Yang, Michael Carbin
Researchers have recently proposed several systems that ease the process of performing Bayesian probabilistic inference. These include systems for automatic inference algorithm syn…