Carsten Führmann

dblp:03/5307 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2007
—ORCID · none

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

Theory of computation · 5 · 4 first-authorSoftware engineering, systems software and programming languages · 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%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems
language semantics
0.012004
On the call-by-value CPS transform and its semantics · Inf. Comput. 2004
Logic in computer science
classical logic
0.012004
On the Geometry of Interaction for Classical Logic · LICS 2004
Logic in computer science › proof theory › proof transformation
cut elimination
0.012004
On the Geometry of Interaction for Classical Logic · LICS 2004
Logic in computer science › proof theory › proof semantics
geometry of interaction
0.012004
On the Geometry of Interaction for Classical Logic · LICS 2004
Logic in computer science
proof theory
0.012004
On the Geometry of Interaction for Classical Logic · LICS 2004

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

quantaloids · 0.0categorical models · 0.0
YearPublicationVenuePosition
2007 On categorical models of classical logic and the Geometry of Interaction
abstract
It is well known that weakening and contraction cause naive categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarised briefly herein, we have provided a class of models called classical categories that is sound and complete and avoids this collapse by interpreting cut reduction by a poset enrichment. Examples of classical categories include boolean lattices and the category of sets and relations, where both conjunction and disjunction are modelled by the set-theoretic product. In this article, which is self-contained, we present an improved axiomatisation of classical categories, together with a deep exploration of their structural theory. Observing that the collapse already happens in the absence of negation, we start with negation-free models called Dummett categories . Examples of these include, besides the classical categories mentioned above, the category of sets and relations, where both conjunction and disjunction are modelled by the disjoint union. We prove that Dummett categories are MIX, and that the partial order can be derived from hom-semilattices, which have a straightforward proof-theoretic definition. Moreover, we show that the Geometry-of-Interaction construction can be extended from multiplicative linear logic to classical logic by applying it to obtain a classical category from a Dummett category. Along the way, we gain detailed insights into the changes that proofs undergo during cut elimination in the presence of weakening and contraction.
Carsten Führmann, David J. Pym
Math. Struct. Comput. Sci.1
2004 On the Geometry of Interaction for Classical Logic
abstract
It is well-known that weakening and contraction cause naive categorical models of the classical sequent calculus to collapse to Boolean lattices. We introduce sound and complete models that avoid this collapse by interpreting cut-reduction by a partial order between morphisms. We provide concrete examples of such models by applying the geometry-of-interaction construction to quantaloids with finite biproducts, and show how these models illuminate cut reduction in the presence of weakening and contraction. Our models make no commitment to any translation of classical logic into intuitionistic logic and distinguish non-deterministic choices of cut-elimination.
Carsten Führmann, David J. Pym
LICS1
2004 On the call-by-value CPS transform and its semantics
Carsten Führmann, Hayo Thielecke
Inf. Comput.1
2003 An equational notion of lifting monad
Anna Bucalo, Carsten Führmann, Alex K. Simpson
Theor. Comput. Sci.2
2002 Varieties of Effects
Carsten Führmann
FoSSaCS1