DeepAI AI Chat

A note on confluence in typed probabilistic lambda calculi

06/11/2021

∙

by Rafael Romero, et al.

∙

University of Buenos Aires

∙

∙

On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic rewriting rules and strongly normalizing terms. We examine the effect of small modifications in probabilistic rewriting, affine variables, and strategies on the overall confluence in this strongly normalizing probabilistic calculus.

Rafael Romero
2 publications
Alejandro Díaz-Caro
16 publications

page 1

page 2

page 3

page 4

∙ 01/09/2019

Lambda Calculus and Probabilistic Computation

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

0 Claudia Faggian, et al. ∙

∙ 05/10/2018

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

In this work we introduce randomised reduction strategies, a notion alre...

0 Ugo Dal Lago, et al. ∙

∙ 05/09/2023

The Undecidability of Unification Modulo σ Alone

The rewriting system sigma is the set of rules propagating explicit subs...

0 Gilles Dowek, et al. ∙

∙ 04/19/2022

Strategies for Asymptotic Normalization

We present a technique to study normalizing strategies when termination ...

0 Claudia Faggian, et al. ∙

∙ 02/19/2020

Decomposing Probabilistic Lambda-calculi

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

0 Ugo Dal Lago, et al. ∙

∙ 01/17/2022

Probabilistic Alternatives to the Gower Distance: A Note on Deodata Predictors

A probabilistic alternative to the Gower distance is proposed. The proba...

0 Cristian Alb, et al. ∙

∙ 02/05/2018

The Matrix Calculus You Need For Deep Learning

This paper is an attempt to explain all the matrix calculus you need in ...

0 Terence Parr, et al. ∙