Displaying similar documents to “Probabilistic operational semantics for the lambda calculus”

Probabilistic operational semantics for the lambda calculus

Ugo Dal Lago, Margherita Zorzi (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

Probabilistic operational semantics for a nondeterministic 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...

Probabilistic operational semantics for the lambda calculus

Ugo Dal Lago, Margherita Zorzi (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Probabilistic operational semantics for a nondeterministic 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...

An abstract monadic semantics for value recursion

Eugenio Moggi, Amr Sabry (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

This paper proposes an operational semantics for value recursion in the context of monadic metalanguages. Our technique for combining value recursion with computational effects works for all monads. The operational nature of our approach is related to the implementation of recursion in Scheme and its monadic version proposed by Friedman and Sabry, but it defines a different semantics and does not rely on assignments. When contrasted to the axiomatic approach proposed by Erkök and Launchbury,...

On global induction mechanisms in a -calculus with explicit approximations

Christoph Sprenger, Mads Dam (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We investigate a Gentzen-style proof system for the first-order -calculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge condition which ensures the well-foundedness of inductive reasoning. As the main result of this paper we propose a new syntactic discharge condition based on traces and establish its equivalence with...

Call-by-value Solvability

Luca Paolini, Simona Ronchi Della Rocca (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

The notion of solvability in the call-by-value -calculus is defined and completely characterized, both from an operational and a logical point of view. The operational characterization is given through a reduction machine, performing the classical -reduction, according to an innermost strategy. In fact, it turns out that the call-by-value reduction rule is too weak for capturing the solvability property of terms. The logical characterization is given through an intersection type assignment...