Universal Semantics for the Stochastic Lambda-Calculus

11/26/2020
by   Pedro Amorim, et al.
0

We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs, but for the first time admit an adequacy theorem relating the operational and denotational views. This resolves the main issue left open in (Bacci et al. 2018).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2023

Weak Similarity in Higher-Order Mathematical Operational Semantics

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's f...
research
04/16/2019

The Geometry of Bayesian Programming

We give a geometry of interaction model for a typed lambda-calculus endo...
research
10/11/2017

Abductive functional programming, a semantic approach

We propose a call-by-value lambda calculus extended with a new construct...
research
04/08/2020

Densities of almost-surely terminating probabilistic programs are differentiable almost everywhere

We study the differential properties of higher-order statistical probabi...
research
12/11/2020

Modules over monads and operational semantics

This paper is a contribution to the search for efficient and high-level ...
research
09/23/2020

Semantics of a Relational λ-Calculus (Extended Version)

We extend the λ-calculus with constructs suitable for relational and fun...
research
06/26/2020

Denotational recurrence extraction for amortized analysis

A typical way of analyzing the time complexity of functional programs is...

Please sign up or login with your details

Forgot password? Click here to reset