Demo Data from EDBT 2026 / reviewers in the wild / expert
Robert A. G. Seely
dblp:56/10568
· DBLP profile ↗
8ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 8 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Logic in computer science · 56% Computational complexity · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science
category theory |
0.0 | 1 | 1987 | Modelling Computations: A 2-Categorical Framework · LICS 1987 |
Computational complexity
computational models |
0.0 | 1 | 1987 | Modelling Computations: A 2-Categorical Framework · LICS 1987 |
Logic in computer science › semantics
semantics of computation |
0.0 | 1 | 1987 | Modelling Computations: A 2-Categorical Framework · LICS 1987 |
Methods — techniques the papers use, named apart from their topics
2-categorical framework · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Differential categoriesabstractFollowing work of Ehrhard and Regnier, we introduce the notion of a differential category: an additive symmetric monoidal category with a comonad (a ‘coalgebra modality’) and a differential combinator satisfying a number of coherence conditions. In such a category one should imagine the morphisms in the base category as being linear maps and the morphisms in the coKleisli category as being smooth (infinitely differentiable). Although such categories do not necessarily arise from models of linear logic, one should think of this as replacing the usual dichotomy of linear vs. stable maps established for coherence spaces.After establishing the basic axioms, we give a number of examples. The most important example arises from a general construction, a comonad -calculus. Richard Blute, J. Robin B. Cockett, Robert A. G. Seely |
Math. Struct. Comput. Sci. | 3 |
| 2002 | The Logic of Linear FunctorsabstractThis paper describes a family of logics whose categorical semantics is based on functors with structure rather than on categories with structure. This allows the consideration of logics that contain possibly distinct logical subsystems whose interactions are mediated by functorial mappings. For example, within one unified framework, we shall be able to handle logics as diverse as modal logic, ordinary linear logic, and the ‘noncommutative logic’ of Abrusci and Ruet, a variant of linear logic that has both commutative and noncommutative connectives. Although this paper will not consider in depth the categorical basis of this approach to logic, preferring instead to emphasise the syntactic novelties that it generates in the logic, we shall focus on the particular case when the logics are based on a linear functor, in order to give a definite presentation of these ideas. However, it will be clear that this approach to logic has considerable generality. Richard Blute, J. Robin B. Cockett, Robert A. G. Seely |
Math. Struct. Comput. Sci. | 3 |
| 2000 | Introduction
Michael Barr, Philip J. Scott, Robert A. G. Seely |
Math. Struct. Comput. Sci. | 3 |
| 2000 | Introduction to linear bicategories
J. Robin B. Cockett, Jürgen Koslowski, Robert A. G. Seely |
Math. Struct. Comput. Sci. | 3 |
| 1996 | ! and ? - Storage as Tensorial StrengthabstractWe continue our study of the negation-free structure of multiplicative linear logic, as represented by the structure of weakly distributive categories, to consider the ‘exponentials’! and ? in the weakly distributive context. In addition to the usual triple and cotriple structure that one would expect on each of the two operators, there must be some connection between them to replace the de Morgan relationship found in the linear logic context. This turns out to be the notion of tensorial strength. We analyze coherence for this situation, using a modification of the usual nets due to Danos, which is a form suitable for linear logic with exponentials but without negation. Richard Blute, J. Robin B. Cockett, Robert A. G. Seely |
Math. Struct. Comput. Sci. | 3 |
| 1993 | Holomorhpic Models of Exponential Types in Linear Logic
Richard Blute, Robert A. G. Seely, Prakash Panangaden |
MFPS | 2 |
| 1987 | Modelling Computations: A 2-Categorical Framework
Robert A. G. Seely |
LICS | 1 |
| 1987 | Categorical Semantics for Higher Order Polymorphic Lambda CalculusabstractAbstract A categorical structure suitable for interpreting polymorphic lambda calculus (PLC) is defined, providing an algebraic semantics for PLC which is sound and complete. In fact, there is an equivalence between the theories and the categories. Also presented is a definitional extension of PLC including “subtypes”, for example, equality subtypes, together with a construction providing models of the extended language, and a context for Girard's extension of the Dialectica interpretation. Robert A. G. Seely |
J. Symb. Log. | 1 |