DeepAI AI Chat
Log In Sign Up

Lambda Calculus and Probabilistic Computation

01/09/2019
by   Claudia Faggian, et al.
0

We introduce two extensions of λ-calculus with a probabilistic choice operator, modeling respectively the call-by-value and call-by-name probabilistic computation. We prove that both enjoys confluence and standardization, in an extended way: indeed these two fundamental notions have been revisited to take into account the asymptotic behaviour of terms. The common root of the two calculi is a further calculus based on Linear Logic, which allows us to develop a unified, modular approach.

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...
03/27/2013

Incidence Calculus: A Mechanism for Probabilistic Reasoning

Mechanisms for the automation of uncertainty are required for expert sys...
02/02/2023

A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs

The extensive deployment of probabilistic algorithms has radically chang...
03/21/2022

Curry and Howard Meet Borel

We show that an intuitionistic version of counting propositional logic c...
05/10/2018

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

In this work we introduce randomised reduction strategies, a notion alre...
07/09/2023

A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows

We analyse abstract data types that model numerical structures with a co...