We present Hakaru, a new probabilistic programming system that allows composable reuse of distributions, queries, and inference algorithms, all expressed in a single language of …
T Rompf, M Odersky - Communications of the ACM, 2012 - dl.acm.org
Good software engineering practice demands generalization and abstraction, whereas high performance demands specialization and concretization. These goals are at odds, and …
This paper studies architecting query compilers. The state of the art in query compiler construction is lagging behind that in the compilers field. We attempt to remedy this by …
E Brady - Proceedings of the 18th ACM SIGPLAN international …, 2013 - dl.acm.org
One often cited benefit of pure functional programming is that pure code is easier to test and reason about, both formally and informally. However, real programs have side-effects …
J Gibbons, N Wu - Proceedings of the 19th ACM SIGPLAN international …, 2014 - dl.acm.org
A domain-specific language can be implemented by embedding within a general-purpose host language. This embedding may be deep or shallow, depending on whether terms in the …
E Crockett, C Peikert, C Sharp - Proceedings of the 2018 ACM SIGSAC …, 2018 - dl.acm.org
Fully Homomorphic Encryption (FHE) is a cryptographic" holy grail" that allows a worker to perform arbitrary computations on client-encrypted data, without learning anything about the …
High level data structures are a cornerstone of modern programming and at the same time stand in the way of compiler optimizations. In order to reason about user-or library-defined …
Haskell programmers have been experimenting with dependent types for at least a decade, using clever encodings that push the limits of the Haskell type system. However, the …
The standard reading of type theory through the lens of category theory is based on the idea of viewing a type system as a category of well-typed terms. We propose a basic revision of …