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.

Cédric Ho Thanh

dblp:246/5657 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · unresolved

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

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

TopicWeightPapersLastEvidence papers
Logic in computer science
category theory
0.412019
A Sequent Calculus for Opetopes · LICS 2019
Logic in computer science
proof theory
0.412019
A Sequent Calculus for Opetopes · LICS 2019
Logic in computer science › proof theory
sequent calculus
0.412019
A Sequent Calculus for Opetopes · LICS 2019
Logic in computer science › category theory
weak omega-category
0.412019
A Sequent Calculus for Opetopes · LICS 2019

Methods — techniques the papers use, named apart from their topics

syntactic description · 0.4bijection proof · 0.4
YearPublicationVenuePosition
2019 A Sequent Calculus for Opetopes
abstract
Opetopes are algebraic descriptions of shapes corresponding to compositions in higher dimensions. As such, they offer an approach to higher-dimensional algebraic structures, and in particular, to the definition of weak ω-categories, which was the original motivation for their introduction by Baez and Dolan. They are classically defined inductively (as free operads in Leinster's approach, or as zoom complexes in the formalism of Kock et al.), using abstract constructions making them difficult to manipulate with a computer. Here, we present a purely syntactic description of opetopes and opetopic sets as a sequent calculus. Our main result is that well-typed opetopes in our sense are in bijection with opetopes as defined in the more traditional approaches. We expect that the resulting structures can serve as natural foundations for mechanized tools based on opetopes.
Cédric Ho Thanh, Pierre-Louis Curien, Samuel Mimram
LICS1