We present an order-extensional, order (or inequationally) fully abstract model for Scott's
language pcf. The approach we have taken is very concrete and in nature goes back to S. C …

Repetitive and ambiguous visual structures in general pose a severe problem in many
computer vision applications. Identification of incorrect geometric relations between images …

Moggi proposed a monadic account of computational effects. He also presented the
computational λ-calculus, λ c, a core call-by-value functional programming language for …

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 investigate a new denotational model of linear logic based on the purely relational
model. In this semantics, webs are equipped with a notion of 'finitary'subsets satisfying a …

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 …

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 …

We study a probabilistic version of coherence spaces and show that these objects provide a
model of linear logic. We build a model of the pure lambda-calculus in this setting and show …

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 …

We present a category of locally convex topological vector spaces that is a model of
propositional classical linear logic and is based on the standard concept of Köthe sequence …