Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Daniel de Carvalho

dblp:64/4962 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 2018
0000-0003-1473-8551ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 6 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science
proof theory		 0.212016
A semantic account of strong normalization in linear logic · Inf. Comput. 2016
Logic in computer science › lambda calculus › normalization
strong normalization		 0.212016
A semantic account of strong normalization in linear logic · Inf. Comput. 2016
Logic in computer science › proof theory › substructural logic
linear logic		 0.112016
A semantic account of strong normalization in linear logic · Inf. Comput. 2016
YearPublicationVenuePosition
2018 Taylor expansion in linear logic is invertible
abstract
Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions. As a corollary, we prove a completeness result for MELL: We show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relational model is exactly axiomatized by cut-elimination.
Daniel de Carvalho
 Log. Methods Comput. Sci.1
2018 Execution time of λ-terms via denotational semantics and intersection types
abstract
The multiset-based relational model of linear logic induces a semantics of the untyped λ-calculus, which corresponds with a non-idempotent intersection type system, System R . We prove that, in System R , the size of type derivations and the size of types are closely related to the execution time of λ-terms in a particular environment machine, Krivine's machine.
Daniel de Carvalho
 Math. Struct. Comput. Sci.1
2016 The Relational Model Is Injective for Multiplicative Exponential Linear Logic
abstract
We prove a completeness result for Multiplicative Exponential Linear Logic (MELL): we show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relational model is exactly axiomatized by cut-elimination.
Daniel de Carvalho
 CSL1
2016 A semantic account of strong normalization in linear logic
Daniel de Carvalho, Lorenzo Tortora de Falco
 Inf. Comput.1
2012 The relational model is injective for multiplicative exponential linear logic (without weakenings)
Daniel de Carvalho, Lorenzo Tortora de Falco
 Ann. Pure Appl. Log.1
2011 A semantic measure of the execution time in linear logic
Daniel de Carvalho, Michele Pagani, Lorenzo Tortora de Falco
 Theor. Comput. Sci.1