DeepAI AI Chat
Log In Sign Up

On Randomised Strategies in the λ-Calculus (Long Version)

by   Ugo Dal Lago, et al.

In this work we introduce randomised reduction strategies, a notion already studied in the context of abstract reduction systems, for the λ-calculus. We develop a simple framework that allows us to prove if a probabilistic strategy is positive almost-surely normalising. Then we propose a simple example of probabilistic strategy for the λ-calculus that has such a property and we show why it is non-trivial with respect to classical deterministic strategies such as leftmost-outermost or rightmost-innermost. We conclude studying this strategy for two classical sub-λ-calculi, namely those in which duplication and erasure are syntactically forbidden.


page 1

page 2

page 3

page 4


Decomposing Probabilistic Lambda-calculi

A notion of probabilistic lambda-calculus usually comes with a prescribe...

A note on confluence in typed probabilistic lambda calculi

On the topic of probabilistic rewriting, there are several works studyin...

Lambda Calculus and Probabilistic Computation

We introduce two extensions of λ-calculus with a probabilistic choice op...

The Benefit of Being Non-Lazy in Probabilistic λ-calculus

We consider the probabilistic applicative bisimilarity (PAB), a coinduct...

A Probabilistic Call-by-Need Lambda-Calculus – Extended Version

To support the understanding of declarative probabilistic programming la...

Balancing Cooperativeness and Adaptiveness in the (Noisy) Iterated Prisoner's Dilemma

Ever since Axelrod's seminal work, tournaments served as the main benchm...

Stateful Realizers for Nonstandard Analysis

In this paper we propose a new approach to realizability interpretations...