Log In Sign Up

On Feller Continuity and Full Abstraction (Long Version)

by   Gilles Barthe, et al.

We study the nature of applicative bisimilarity in λ-calculi endowed with operators for sampling from continuous distributions. On the one hand, we show that bisimilarity, logical equivalence, and testing equivalence all coincide with contextual equivalence when real numbers can be manipulated only through continuous functions. The key ingredient towards this result is a novel notion of Feller-continuity for labelled Markov processes, which we believe of independent interest, being a broad class of LMPs for which coinductive and logically inspired equivalences coincide. On the other hand, we show that if no constraint is put on the way real numbers are manipulated, characterizing contextual equivalence turns out to be hard, and most of the aforementioned notions of equivalence are even unsound.


page 1

page 2

page 3

page 4


Program Equivalence for Algebraic Effects via Modalities

This dissertation is concerned with the study of program equivalence and...

Reward Testing Equivalences for Processes

May and must testing were introduced by De Nicola and Hennessy to define...

An axiomatization of verdict equivalence over regular monitors

Monitors are a key tool in the field of runtime verification, where they...

Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm

This work is meant to be a step towards the formal definition of the not...

Coded equivalence of one-sided topological Markov shifts

We introduce a notion of coded equivalence in one-sided topological Mark...

On the Predictive Properties of Binary Link Functions

This paper provides a theoretical and computational justification of the...

Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion

We present a complete reasoning principle for contextual equivalence in ...