This is an automated archive made by the Lemmit Bot.

The original was posted on /r/programminglanguages by /u/OptimizedGarbage on 2023-10-21 04:28:59.

I feel like this is a bit of a longshot, but:

Has anybody seen work on type systems that attempt to encode statistical guarantees instead of logical ones? Eg, a function f(x, N) that’s guaranteed to have a < epsilon(N) chance of returning Null. The reason I ask is that it seems like standard type systems are wholy unable to deal with the needs of machine learning algorithms, where there are no absolute guarantees, but statistical guarantees are plentiful. What would a type system where I could bound the probability of an event have to look like?