Skip to Main content Skip to Navigation
Conference papers

On Higher-Order Probabilistic Subrecursion

Flavien Breuvart 1 Ugo Dal Lago 1, 2 Agathe Herrou 3
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 study the expressive power of subrecursive probabilistic higher-order calculi. More specifically, we show that endowing a very expressive deterministic calculus like Gödel's T with various forms of probabilistic choice operators may result in calculi which are not equivalent as for the class of distributions they give rise to, although they all guarantee almost-sure termination. Along the way, we introduce a probabilistic variation of the classic reducibility technique, and we prove that the simplest form of probabilistic choice leaves the expressive power of T essentially unaltered. The paper ends with some observations about functional expressivity: expectedly, all the considered calculi represent precisely the functions which T itself represents.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Ugo Dal Lago Connect in order to contact the contributor
Submitted on : Monday, November 20, 2017 - 1:18:36 PM
Last modification on : Tuesday, December 8, 2020 - 10:18:03 AM
Long-term archiving on: : Wednesday, February 21, 2018 - 2:41:14 PM


Files produced by the author(s)





Flavien Breuvart, Ugo Dal Lago, Agathe Herrou. On Higher-Order Probabilistic Subrecursion. FoSSaCS 2017 - 20th International Conference on Foundations of Software Science and Computation Structures, Apr 2017, Uppsala, Sweden. pp.370-386, ⟨10.1007/978-3-662-54458-7_22⟩. ⟨hal-01639379⟩



Record views


Files downloads