Demo Data from EDBT 2026 / reviewers in the wild / expert
Hugh P. Steele
dblp:118/3242
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
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 · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science
category theory |
0.1 | 1 | 2012 | Constructing Fully Complete Models for Multiplicative Linear Logic · LICS 2012 |
Logic in computer science › proof theory › substructural logic
linear logic |
0.1 | 1 | 2012 | Constructing Fully Complete Models for Multiplicative Linear Logic · LICS 2012 |
Logic in computer science › proof theory › substructural logic › linear logic
multiplicative linear logic |
0.1 | 1 | 2012 | Constructing Fully Complete Models for Multiplicative Linear Logic · LICS 2012 |
Logic in computer science
proof theory |
0.1 | 1 | 2012 | Constructing Fully Complete Models for Multiplicative Linear Logic · LICS 2012 |
Logic in computer science › semantics
denotational semantics |
0.0 | 1 | 2012 | Constructing Fully Complete Models for Multiplicative Linear Logic · LICS 2012 |
Methods — techniques the papers use, named apart from their topics
tensor calculus · 0.1hyland-tan double glueing · 0.1biproducts · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Constructing Fully Complete Models for Multiplicative Linear LogicabstractWe demonstrate how the Hyland-Tan double glueing construction produces a fully complete model of the unit-free multiplicative fragment of Linear Logic when applied to any of a large family of degenerative ones. This process explains as special cases a number of such models which appear in the literature. In order to achieve this result, we make use of a tensor calculus for compact closed categories with finite biproducts. We show how the combinatorial properties required for a fully complete model are obtained by the construction adding to those already available from the original category. Andrea Schalk, Hugh P. Steele |
LICS | 2 |