Probabilistic operational semantics for the lambda calculus

  title={Probabilistic operational semantics for the lambda calculus},
  author={Ugo Dal Lago and Margherita Zorzi},
Probabilistic operational semantics for a nondeterminis- tic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics, inductively and coinductively defined, are given. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by-value and in call-by-name. Plotkin's CPS translation is extended to accommodate the choice operator and shown correct with… 

Figures and Tables from this paper

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

A lambda-calculus with a fair binary probabilistic choice that chooses between its arguments with equal probability is introduced and techniques to prove equivalences are developed including a context lemma, two derived criteria to show equivalences and a syntactic diagram-based method.

The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus

It is proved that extending this calculus with a let-in operator allows for achieving the full abstraction, and it is recalled Larsen and Skou’s testing language, which is known to correspond with PAB, and every test is representable by a context of this calculus.

Decomposing Probabilistic Lambda-Calculi

The resulting calculus, the Probabilistic Event Lambda-Calculus, is confluent, and interprets the call-by-name and call- by-value strategies through different interpretations of the probabilistic operator into the authors' generator and consumer constructs.

Probabilistic lambda-theories

The purpose is to give a more equational representation of this calculus, by handling the probabilities inside the reduction rather than as a side effect, and gives a deterministic and contextual operational semantics for the call-by-name probabilistic lambda-calculus.

On Intersection Types and Probabilistic Lambda Calculi

We define two intersection type systems for the pure, untyped, probabilistic λ-calculus, and prove that type derivations precisely reflect the probability of convergence of the underlying term. We

On coinductive equivalences for higher-order probabilistic functional programs

A technique for proving congruence of probabilistic applicative bisimilarity of Levy-Longo trees, generally accepted as the finest extensional equivalence on pure lambda-terms under a lazy regime is shown.

On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi

The Probabilistic applicative bisimulation technique is applied to a typed, call-by-value, lambda-calculus and the obtained relation coincides with context equivalence, contrary to what happens when call- by-name evaluation is considered.

On continuation-passing transformations and expected cost analysis

We define a continuation-passing style (CPS) translation for a typed λ-calculus with probabilistic choice, unbounded recursion, and a tick operator — for modeling cost. The target language is a

A Meta-theory for Big-step Semantics

A general proof technique to show that a predicate is sound, that is, it prevents stuck computation, with respect to a big-step semantics is described, and it is illustrated by several examples, showing that it is applicable also in cases where subject reduction does not hold, and hence the standard technique for small- step semantics cannot be used.

The Benefit of Being Non-Lazy in Probabilistic {\lambda}-calculus

It is proved that PAB is fully abstract with respect to the standard head reduction contextual equivalence, based on the Leventis Separation Theorem, showing that the probabilistic applicative similarity is strictly contained in the contextual preorder.



Non Deterministic Extensions of Untyped Lambda-Calculus

The main concern of this paper is the interplay between functionality and nondeterminism. We ask whether the analysis of parallelism in terms of sequentiality and nondeterminism, which is usual in

Notions of Computation and Monads

  • E. Moggi
  • Computer Science
    Inf. Comput.
  • 1991

Non deterministic extensions of untyped-calculus

The main concern of this paper is the study of the interplay between functionality and non determinism. Indeed the rst question we ask is whether the analysis of parallelism in terms of sequentiality

Stochastic lambda calculus and monads of probability distributions

A translation of stochastic lambda calculus into measure terms is given, which can not only denote discrete probability distributions but can also support the best known modeling techniques.

LCF Considered as a Programming Language

A calculus for probabilistic languages

A probabilistic calculus by extending the traditional lambda calculus is developed, which is founded upon sampling functions, which map the unit interval to probability domains and achieves a unified representation scheme for all types of probability distributions.

A Monadic Probabilistic Language

A monadic probabilistic language based upon the mathematical notion of sampling function is proposed, which provides a unified representation scheme for probability distributions, enjoys rich expressiveness, and offers high versatility in encoding probability distributions.

Computational lambda-calculus and monads

  • E. Moggi
  • Computer Science
    [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
  • 1989
The author gives a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence of programs, independent from any specific computational model.

A lambda calculus for quantum computation with classical control

A functional programming language for quantum computers by extending the simply-typed lambda calculus with quantum types and operations, and gives a type system using affine intuitionistic linear logic.

The duality of computation

The μ -calculus is presented, a syntax for λ-calculus + control operators exhibiting symmetries such as program/context and call-by-name/call- by-value, derived from implicational Gentzen's sequent calculus LK.