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 \\nitary" subsets, satisfying a closure condition with respect to an orthogonality relation between subsets of the web, and proofs are interpreted by nitary sets. This model seems quite diierent in spirit from… (More)
We present a model of classical linear logic based on the notion of strong stability that was introduced in BE], a work about sequentiality written jointly with Antonio Bucciarelli.
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as " λ-models " , or as (structures arising from) any reflexive object in a cartesian closed category (ccc, for brevity). These notions are tightly linked in the sense that: given a λ-model A, one may define a ccc in which A (the… (More)
We present a category of locally convex topological vector spaces which is a model of propo-sitional classical linear logic, based on the standard concept of Köthe sequence spaces. In this setting, the " of course " connective of linear logic has a quite simple structure of commutative Hopf algebra. The co-Kleisli category of this linear category is a… (More)
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 the equality of interpretations in Pcoh characterizes the operational indistinguishability of programs in PCF with a random primitive. This is the first result of full abstraction… (More)