Probabilistic Termination by Monadic Affine Sized Typing - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Programming Languages and Systems (TOPLAS) Année : 2019

Probabilistic Termination by Monadic Affine Sized Typing

Résumé

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.
Fichier principal
Vignette du fichier
main.pdf (636.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02399423 , version 1 (07-01-2020)

Identifiants

Citer

Ugo Dal Lago, Charles Grellois. Probabilistic Termination by Monadic Affine Sized Typing. ACM Transactions on Programming Languages and Systems (TOPLAS), 2019, 41 (2), pp.1-65. ⟨10.1145/3293605⟩. ⟨hal-02399423⟩
79 Consultations
86 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More