We develop the operational semantics of an untyped probabilistic λ-calculus with continuous
distributions, and both hard and soft constraints, as a foundation for universal probabilistic …

We present a categorical construction for modelling causal structures within a general class
of process theories that include the theory of classical probabilistic processes as well as …

We define a notion of stable and measurable map between cones endowed with
measurability tests and show that it forms a cpo-enriched cartesian closed category. This …

This paper presents a low-overhead scheme for the built-in self-test (BIST) of circuits with
scan. Complete (100%) fault coverage is obtained without modifying the function logic and …

Finding a denotational semantics for higher order quantum computation is a long-standing
problem in the semantics of quantum programming languages. Most past approaches to this …

The category Rel of sets and relations yields one of the simplest denotational semantics of
Linear Logic (LL). It is known that Rel is the biproduct completion of the Boolean ring. We …

Probabilistic coherence spaces (PCoh) yield a semantics of higher-order probabilistic
computation, interpreting types as convex sets and programs as power series. We prove that …

Differential Linear Logic (DiLL) adds to Linear Logic (LL) a symmetrization of three out of the
four exponential rules, which allows the expression of a natural notion of differentiation. In …

We present a probabilistic version of PCF, a well-known simply typed universal functional
language. The type hierarchy is based on a single ground type of natural numbers. Even if …

We present and study a simple Call-By-Push-Value lambda-calculus with fix-points and
recursive types. We explain its connection with Linear Logic by presenting a denotational …