Demo Data from VLDB 2026 / reviewers in the wild / expert
Aurelio Carboni
dblp:24/572
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 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 · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems
partial equivalence relations |
0.0 | 1 | 1998 | Type Theory via Exact Categories · LICS 1998 |
Logic in computer science › category theory
categorical logic |
0.0 | 1 | 1998 | Type Theory via Exact Categories · LICS 1998 |
Logic in computer science › categorical semantics
cartesian closed categories |
0.0 | 1 | 1998 | Type Theory via Exact Categories · LICS 1998 |
Methods — techniques the papers use, named apart from their topics
category theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | Corrigenda for 'Connected limits, familial representability and Artin glueing'abstractSince the publication of the paper Carboni and Johnstone (1995), we have become aware of two independent errors in it. Although neither of them has any effect on the main results of the paper, concerning when a category obtained by Artin glueing is a topos, we feel it is appropriate to publish this correction in the hope that it may prevent future readers of Carboni and Johnstone (1995) from being misled. We are grateful to Tom Leinster and to Marek Zawadowski for drawing our attention to the two errors. Aurelio Carboni, Peter T. Johnstone |
Math. Struct. Comput. Sci. | 1 |
| 1998 | Type Theory via Exact CategoriesabstractPartial equivalence relations (and categories of these) are a standard tool in semantics of type theories and programming languages, since they often provide a cartesian closed category with extended definability. Using the theory of exact categories, we give a category-theoretic explanation of why the construction of a category of partial equivalence relations often produces a cartesian closed category. We show how several familiar examples of categories of partial equivalence relations fit into the general framework. Lars Birkedal, Aurelio Carboni, Giuseppe Rosolini, Dana S. Scott |
LICS | 2 |
| 1995 | Connected Limits, Familial Representability and Artin GlueingabstractWe consider the following two properties of a functor F from a presheaf topos to the category of sets: (a) F preserves connected limits, and (b) the Artin glueing of F is again a presheaf topos. We show that these two properties are in fact equivalent. In the process, we develop a general technique for associating categorical properties of a category obtained by Artin glueing with preservation properties of the functor along which the glueing takes place. We also give a syntactic characterization of those monads on Set whose functor parts have the above properties, and whose units and multiplications are cartesian natural transformations. Aurelio Carboni, Peter T. Johnstone |
Math. Struct. Comput. Sci. | 1 |