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

Farzad Jafarrahmani

dblp:243/2871 · also Farzad Jafar-Rahmani · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0003-1827-5881ORCID · corroborated

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

Theory of computation · 3 · 3 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.

Theoretical computer science
2 papers
Logic in computer science · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science
categorical semantics
1.422025
On the denotation of circular and non-wellfounded proofs in linear logic with fixed points · LICS 2025
Categorical models of Linear Logic with fixed points of formulas · LICS 2021
Logic in computer science › proof theory › substructural logic
linear logic
1.422025
On the denotation of circular and non-wellfounded proofs in linear logic with fixed points · LICS 2025
Categorical models of Linear Logic with fixed points of formulas · LICS 2021
Logic in computer science
proof theory
1.422025
On the denotation of circular and non-wellfounded proofs in linear logic with fixed points · LICS 2025
Categorical models of Linear Logic with fixed points of formulas · LICS 2021
Logic in computer science › proof theory › structural proof theory
cyclic proof
0.912025
On the denotation of circular and non-wellfounded proofs in linear logic with fixed points · LICS 2025
Logic in computer science › semantics
denotational semantics
0.912025
On the denotation of circular and non-wellfounded proofs in linear logic with fixed points · LICS 2025
Logic in computer science › lambda calculus
normalization
0.512021
Categorical models of Linear Logic with fixed points of formulas · LICS 2021
Logic in computer science › proof theory › substructural logic › linear logic
multiplicative-additive linear logic
0.112021
Categorical models of Linear Logic with fixed points of formulas · LICS 2021

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

category theory · 1.4orthogonality construction · 0.9strong functor · 0.5seely category · 0.5
YearPublicationVenuePosition
2025 On the denotation of circular and non-wellfounded proofs in linear logic with fixed points
abstract
This paper investigates the denotational invariants of non-wellfounded and circular proofs of linear logic with least and greatest fixed points, μLL, by providing a categorical semantics. More precisely the paper successively introduces semantics for (i) non-wellfounded pre-proofs, be they valid or not, (ii) valid pre-proofs exploiting their validity condition by considering an orthogonality construction on the given categorical model and finally (iii) circular strongly valid pre-proofs, exploiting both validity and regularity in order to define inductively the interpretation. Then the paper investigates the semantical content of the translation from finitary proofs to non-wellfounded proofs and, conversely, from (strongly valid) circular proofs to finitary proofs, showing that both translations preserve the interpretation.
Thomas Ehrhard, Farzad Jafarrahmani, Alexis Saurin
LICS2
2022 Phase Semantics for Linear Logic with Least and Greatest Fixed Points
abstract
The truth semantics of linear logic (i.e. phase semantics) is often overlooked despite having a wide range of applications and deep connections with several denotational semantics. In phase semantics, one is concerned about the provability of formulas rather than the contents of their proofs (or refutations). Linear logic equipped with the least and greatest fixpoint operators (μMALL) has been an active field of research for the past one and a half decades. Various proof systems are known viz. finitary and non-wellfounded, based on explicit and implicit (co)induction respectively. In this paper, we extend the phase semantics of multiplicative additive linear logic (a.k.a. MALL) to μMALL with explicit (co)induction (i.e. μMALL^{ind}). We introduce a Tait-style system for μMALL called μMALL_ω where proofs are wellfounded but potentially infinitely branching. We study its phase semantics and prove that it does not have the finite model property.
Abhishek De 0001, Farzad Jafarrahmani, Alexis Saurin
FSTTCS2
2021 Categorical models of Linear Logic with fixed points of formulas
abstract
We develop a categorical semantics of μLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional μMALL with exponentials. Our general categorical setting is based on Seely categories and on strong functors acting on them. We exhibit two simple instances of this setting. In the first one, which is based on the category of sets and relations, least and greatest fixed points are interpreted in the same way. In the second one, based on a category of sets equipped with a notion of totality (non-uniform totality spaces) and relations preserving it, least and greatest fixed points have distinct interpretations. This latter model shows that μLL enjoys a denotational form of normalization of proofs.
Thomas Ehrhard, Farzad Jafarrahmani
LICS2