We introduce a system of monadic affine sized types, which substantially generalizes usual sized types and allows in this way to capture probabilistic higher-order programs that terminate almost surely. Going beyond plain, strong normalization without losing soundness turns out to be a hard task, which cannot be accomplished without a richer, quantitative notion of types, but also without imposing some affinity constraints. The proposed type system is powerful enough to type classic examples of probabilistically terminating programs such as random walks. The way typable programs are proved to be almost surely terminating is based on reducibility but requires a substantial adaptation of the technique.

@article{paperbot713,
  title = {Probabilistic Termination by Monadic Affine Sized Typing},
  author = {Ugo Dal Lago and Charles Grellois},
  journal = {ACM Transactions on Programming Languages and Systems},
  volume = {41},
  number = {2},
  year = {2019},
  doi = {10.1145/3293605}
}