On Probabilistic Term Rewriting

Martin Avanzini 1 Ugo Dal Lago 1, 2 Akihisa Yamada 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 termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems are considered. Two instances of the interpretation method-polynomial and matrix interpretations-are analyzed and shown to capture interesting and non-trivial examples when automated. We capture probabilistic computation in a novel way by means of multidistribution reduction sequences, thus accounting for both the nondeterminism in the choice of the redex and the probabilism intrinsic in firing each rule.
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

Contributor : Ugo Dal Lago <>
Submitted on : Monday, November 19, 2018 - 11:57:53 AM
Last modification on : Tuesday, April 16, 2019 - 3:08:03 PM
Long-term archiving on : Wednesday, February 20, 2019 - 2:00:54 PM


Files produced by the author(s)


  • HAL Id : hal-01926502, version 1



Martin Avanzini, Ugo Dal Lago, Akihisa Yamada. On Probabilistic Term Rewriting. Functional and Logic Programming - 14th International Symposium, Proceedings, May 2018, Nagoya, Japan. ⟨hal-01926502⟩



Record views


Files downloads