Demo Data from EDBT 2026 / reviewers in the wild / expert
Ralph Loader
dblp:00/6475
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 4 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% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › semantics
denotational semantics |
0.0 | 1 | 1994 | Linear Logic, Totality and Full Completeness · LICS 1994 |
Logic in computer science › proof theory › proof semantics
full completeness |
0.0 | 1 | 1994 | Linear Logic, Totality and Full Completeness · LICS 1994 |
Logic in computer science › proof theory › substructural logic
linear logic |
0.0 | 1 | 1994 | Linear Logic, Totality and Full Completeness · LICS 1994 |
Logic in computer science
proof theory |
0.0 | 1 | 1994 | Linear Logic, Totality and Full Completeness · LICS 1994 |
Methods — techniques the papers use, named apart from their topics
totality space model · 0.0game semantics · 0.0coherence spaces · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Finitary PCF is not decidable
Ralph Loader |
Theor. Comput. Sci. | 1 |
| 1998 | Unary PCF is Decidable
Ralph Loader |
Theor. Comput. Sci. | 1 |
| 1997 | Equational Theories for Inductive Types
Ralph Loader |
Ann. Pure Appl. Log. | 1 |
| 1994 | Linear Logic, Totality and Full CompletenessabstractI give a 'totality space' model for linear logic [4] derived by taking an abstract view of computations on a datatype. The model has similarities with both the coherence space model and game-theoretic models, but is based upon a notion of total object. Using this model, I prove a full completeness result. In other words, I show that the mapping of proofs to their interpretations (here collections of total objects uniform for a given functor) in the model is a surjection.> Ralph Loader |
LICS | 1 |