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.
Type de document :
Communication dans un congrès
ESOP 2017 - 26th European Symposium on Programming, Apr 2017, Uppsala, Sweden. 2017
Liste complète des métadonnées

Littérature citée [34 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01635077
Contributeur : Charles Grellois <>
Soumis le : mardi 14 novembre 2017 - 16:52:47
Dernière modification le : mercredi 15 novembre 2017 - 01:14:26

Fichier

dal-lago-grellois-monadic-affi...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. 2017. 〈hal-01635077〉

Partager

Métriques

Consultations de
la notice

37

Téléchargements du document

2