Probabilistic Termination by Monadic Affine Sized Typing

Ugo Dal Lago 1, 2 Charles Grellois 1
1 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : We introduce a system of monadic affine sized types, which substantially generalise usual sized types, and allows this way to capture probabilistic higher-order programs which terminate almost surely. Going beyond plain, strong normalisation 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.
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01635077
Contributor : Charles Grellois <>
Submitted on : Tuesday, November 14, 2017 - 4:52:47 PM
Last modification on : Wednesday, October 10, 2018 - 10:08:50 AM
Long-term archiving on : Thursday, February 15, 2018 - 3:19:57 PM

File

dal-lago-grellois-monadic-affi...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01635077, version 1

Collections

Citation

Ugo Dal Lago, Charles Grellois. Probabilistic Termination by Monadic Affine Sized Typing. ESOP 2017 - 26th European Symposium on Programming, Apr 2017, Uppsala, Sweden. ⟨hal-01635077⟩

Share

Metrics

Record views

200

Files downloads

125