Type-Theory

Bernoulli Types: Theory and Construction

Regular Types in the Bernoulli Model: When Equality Isn't Equal

Advanced Topics in Types and Programming Languages

Practical Foundations for Programming Languages

The Little Typer

Types and Programming Languages

Algebraic Cipher Types: A Functorial Framework for Secure Computation

Noisy Turing Machines: Noisy Logic Gates

Analyzing how Bernoulli Boolean types propagate through logic circuits, with correctness probabilities for noisy AND gates and interval arithmetic for composed circuits.

The Bernoulli Model: A Probabilistic Framework for Data Structures and Types

The Bernoulli Model is a framework for reasoning about probabilistic data structures by treating noisy outputs as Bernoulli-distributed approximations of latent values, from Booleans to set-indicator functions.

The Bernoulli Model: A Probabilistic Framework for Data Structures and Types

The Bernoulli Model is a framework for reasoning about probabilistic data structures by treating noisy outputs as Bernoulli-distributed approximations of latent values, from Booleans to set-indicator functions.