DeepAI AI Chat
Log In Sign Up

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

05/10/2018
by   Ugo Dal Lago, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/19/2020

Decomposing Probabilistic Lambda-calculi

A notion of probabilistic lambda-calculus usually comes with a prescribe...
06/11/2021

A note on confluence in typed probabilistic lambda calculi

On the topic of probabilistic rewriting, there are several works studyin...
01/09/2019

Lambda Calculus and Probabilistic Computation

We introduce two extensions of λ-calculus with a probabilistic choice op...
04/27/2020

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

We consider the probabilistic applicative bisimilarity (PAB), a coinduct...
05/30/2022

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

To support the understanding of declarative probabilistic programming la...
03/06/2023

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

Ever since Axelrod's seminal work, tournaments served as the main benchm...
10/11/2022

Stateful Realizers for Nonstandard Analysis

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