98 research outputs found
Decomposing Comonad Morphisms
The analysis of set comonads whose underlying functor is a container functor in terms of directed containers makes it a simple observation that any morphism between two such comonads factors through a third one by two comonad morphisms, whereof the first is identity on shapes and the second is identity on positions in every shape. This observation turns out to generalize into a much more involved result about comonad morphisms to comonads whose underlying functor preserves Cartesian natural transformations to itself on any category with finite limits. The bijection between comonad coalgebras and comonad morphisms from costate comonads thus also yields a decomposition of comonad coalgebras
Cohomological descent theory for a morphism of stacks and for equivariant derived categories
In the paper we answer the following question: for a morphism of varieties
(or, more generally, stacks), when the derived category of the base can be
recovered from the derived category of the covering variety by means of descent
theory? As a corollary, we show that for an action of a reductive group on a
scheme, the derived category of equivariant sheaves is equivalent to the
category of objects, equipped with an action of the group, in the ordinary
derived category.Comment: 28 page
Taylor expansion for Call-By-Push-Value
The connection between the Call-By-Push-Value lambda-calculus introduced by Levy and Linear Logic introduced by Girard has been widely explored through a denotational view reflecting the precise ruling of resources in this language. We take a further step in this direction and apply Taylor expansion introduced by Ehrhard and Regnier. We define a resource lambda-calculus in whose terms can be used to approximate terms of Call-By-Push-Value. We show that this approximation is coherent with reduction and with the translations of Call-By-Name and Call-By-Value strategies into Call-By-Push-Value
Resource modalities in game semantics
The description of resources in game semantics has never achieved the
simplicity and precision of linear logic, because of a misleading conception:
the belief that linear logic is more primitive than game semantics. We advocate
instead the contrary: that game semantics is conceptually more primitive than
linear logic. Starting from this revised point of view, we design a categorical
model of resources in game semantics, and construct an arena game model where
the usual notion of bracketing is extended to multi- bracketing in order to
capture various resource policies: linear, affine and exponential
Full abstraction for probabilistic PCF
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 the language is globally call-by-name, we
allow a call-by-value evaluation for ground type arguments in order to provide
the language with a suitable algorithmic expressiveness. We describe a
denotational semantics based on probabilistic coherence spaces, a model of
classical Linear Logic developed in previous works. We prove an adequacy and an
equational full abstraction theorem showing that equality in the model
coincides with a natural notion of observational equivalence
Dual-Context Calculi for Modal Logic
We present natural deduction systems and associated modal lambda calculi for
the necessity fragments of the normal modal logics K, T, K4, GL and S4. These
systems are in the dual-context style: they feature two distinct zones of
assumptions, one of which can be thought as modal, and the other as
intuitionistic. We show that these calculi have their roots in in sequent
calculi. We then investigate their metatheory, equip them with a confluent and
strongly normalizing notion of reduction, and show that they coincide with the
usual Hilbert systems up to provability. Finally, we investigate a categorical
semantics which interprets the modality as a product-preserving functor.Comment: Full version of article previously presented at LICS 2017 (see
arXiv:1602.04860v4 or doi: 10.1109/LICS.2017.8005089
- …