Tag
Paccagnan and Tirlea (Imperial College London) prove that state-of-the-art concentration bounds for preferent (stable) sample compressions are provably tight, using an explicit uniform-distribution/order-statistics construction, while also giving a much simpler elementary counting proof that avoids infinite-dimensional duality.
This article provides an overview of intuitionistic type theory, a logical framework based on dependent types and lambda calculus, originating from Brouwer's intuitionism and Russell's type theory, with applications in proof assistants and constructive mathematics.