DeepAI
Log In Sign Up

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

09/06/2022

A Generic Type System for Higher-Order Ψ-calculi

The Higher-Order Ψ-calculus framework (HOΨ) is a generalisation of many ...
04/16/2019

The Geometry of Bayesian Programming

We give a geometry of interaction model for a typed lambda-calculus endo...
04/08/2020

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

We study the differential properties of higher-order statistical probabi...
09/23/2020

Semantics of a Relational λ-Calculus (Extended Version)

We extend the λ-calculus with constructs suitable for relational and fun...
12/11/2020

Modules over monads and operational semantics

This paper is a contribution to the search for efficient and high-level ...
06/26/2020

Denotational recurrence extraction for amortized analysis

A typical way of analyzing the time complexity of functional programs is...
05/01/2019

Discrete time stochastic and deterministic Petri box calculus

We propose an extension with deterministically timed multiactions of dis...