187 research outputs found
Indexed linear logic and higher-order model checking
In recent work, Kobayashi observed that the acceptance by an alternating tree
automaton A of an infinite tree T generated by a higher-order recursion scheme
G may be formulated as the typability of the recursion scheme G in an
appropriate intersection type system associated to the automaton A. The purpose
of this article is to establish a clean connection between this line of work
and Bucciarelli and Ehrhard's indexed linear logic. This is achieved in two
steps. First, we recast Kobayashi's result in an equivalent infinitary
intersection type system where intersection is not idempotent anymore. Then, we
show that the resulting type system is a fragment of an infinitary version of
Bucciarelli and Ehrhard's indexed linear logic. While this work is very
preliminary and does not integrate key ingredients of higher-order
model-checking like priorities, it reveals an interesting and promising
connection between higher-order model-checking and linear logic.Comment: In Proceedings ITRS 2014, arXiv:1503.0437
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
Mac Lane's coherence theorem expressed as a word problem
manuscrit de 10 pagesIn this manuscript, we reduce the coherence theorem for braided monoidal categories to the resolution of a word problem, and the construction of a category of fractions. The technique explicates the combinatorial nature of that particular coherence theorem
Applying quantitative semantics to higher-order quantum computing
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 problem fell short in one way or another, either
limiting the language to an unusably small finitary fragment, or giving up
important features of quantum physics such as entanglement. In this paper, we
propose a denotational semantics for a quantum lambda calculus with recursion
and an infinite data type, using constructions from quantitative semantics of
linear logic
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
Combining insights from the study of type refinement systems and of monoidal
closed chiralities, we show how to reconstruct Lawvere's hyperdoctrine of
presheaves using a full and faithful embedding into a monoidal closed
bifibration living now over the compact closed category of small categories and
distributors. Besides revealing dualities which are not immediately apparent in
the traditional presentation of the presheaf hyperdoctrine, this reconstruction
leads us to an axiomatic treatment of directed equality predicates (modelled by
hom presheaves), realizing a vision initially set out by Lawvere (1970). It
also leads to a simple calculus of string diagrams (representing presheaves)
that is highly reminiscent of C. S. Peirce's existential graphs for predicate
logic, refining an earlier interpretation of existential graphs in terms of
Boolean hyperdoctrines by Brady and Trimble. Finally, we illustrate how this
work extends to a bifibrational setting a number of fundamental ideas of linear
logic.Comment: Identical to the final version of the paper as appears in proceedings
of LICS 2016, formatted for on-screen readin
An Algebraic Account of References in Game Semantics
AbstractWe study the algebraic structure of a programming language with higher-order store, in the style of ML references. Instead of working directly on the operational semantics of the language, we consider its fully abstract game semantics defined by Abramsky, Honda and McCusker one decade ago. This alternative description of the language is nice and conceptual, except on one significant point: the interactive behavior of the higher-order memory cell is reflected in the model by a strategy cell whose definition remains slightly enigmatic. The purpose of our work is precisely to clarify this point, by providing a neat algebraic definition of the strategy. This conceptual reconstruction of the memory cell is based on the idea that a general reference behaves essentially as a linear feedback (or trace operator) in an ambient category of Conway games and strategies. This analysis leads to a purely axiomatic proof of soundness of the model, based on a natural refinement of the replication modality of tensor logic
- …