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.

Niyousha Najmaei

dblp:401/9079 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0001-2892-5537ORCID · reported

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

Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

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.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
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
Programming languages and type systems › type systems
subtyping
1.012026
From Semantics to Syntax: A Type Theory for Comprehension Categories · Proc. ACM Program. Lang. 2026
Programming languages and type systems
type theory
1.012026
From Semantics to Syntax: A Type Theory for Comprehension Categories · Proc. ACM Program. Lang. 2026
Logic in computer science › type theory
martin-löf type theory
1.012026
From Semantics to Syntax: A Type Theory for Comprehension Categories · Proc. ACM Program. Lang. 2026

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

soundness proof · 2.0algebraic weak factorization systems · 2.0
YearPublicationVenuePosition
2026 From Semantics to Syntax: A Type Theory for Comprehension Categories
abstract
Recent models of intensional type theory have been constructed in algebraic weak factorization systems (AWFSs). AWFSs give rise to comprehension categories that feature non-trivial morphisms between types; these morphisms are not used in the standard interpretation of Martin-Löf type theory in comprehension categories. We develop a type theory that internalizes morphisms between types, reflecting this semantic feature back into syntax. Our type theory comes with Π-, Σ-, and identity types. We discuss how it can be viewed as an extension of Martin-Löf type theory with coercive subtyping, as sketched by Coraglia and Emmenegger. We furthermore define semantic structure that interprets our type theory and prove a soundness result. Finally, we exhibit many examples of the semantic structure, yielding a plethora of interpretations.
Niyousha Najmaei, Niels van der Weide, Benedikt Ahrens, Paige Randall North
Proc. ACM Program. Lang.1