This paper investigates operationally based theories of a simply typed functional programming language with countable non determinism The theories are based upon lower upper and convex variants of applicative similarity and bisimilarity and the main result presented here is that these relations are compatible The di erences between the relations are illustrated by simple examples and their con ...

We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations from different alternatives to occur concurrently and later commit to one of them. GCC generalizes the traditional committed choice in Dijkstra’s Guarded Command Language to handle don’t know non-determinism and also a...

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 and non determinism, which is usual in the algebraic treatment of concurrency, remains correct in presence of functional application and abstraction. We identify non determinism in the setting of -...

We extend the model of Ancilla Driven Quantum Computation (ADQC) by considering gates with arbitrary entangling power. By giving up stepwise determinism, universal QC can still be achieved through a variable length sequence of single qubit gates and probabilistic “repeat-untilsucces” entangling operations. This opens up a new range of possible physical implementations as well as shedding light ...

As the scientific community prepares to deploy an increasingly complex and diverse set of applications on exascale platforms, need assess reproducibility simulations identify root causes failures increases correspondingly. One greatest challenges facing issues at is inherent non-determinism level inter-process communication. The use non-deterministic communication constructs necessary boost per...

Conditional independence relations involving latent variables do not necessarily imply observable independences. They may imply inequality constraints on observable parameters and causal bounds, which can be used for falsification and identification. The literature on computing such constraints often involve a deterministic underlying data generating process in a counterfactual framework. If an...

In this paper we present a model of distribution as a natural consequence of deterministic concurrency; a purely declarative form of concurrency that preserves referential transparency. This extends the demand driven model used as the operational basis of functional languages, into one with multiple independent demands without the need to allow non-determinism to appear at the user level. The a...