43 citations · 45 across the 8 of their papers we have counts for
8 papers
A computational method for left-adjointness
Simon Forest
In this work, we investigate an effective method for showing that functors between categories are left adjoints. The method applies to a large class of categories, namely locally f…
An Analysis of Symmetry in Quantitative Semantics
Pierre Clairambault, Simon Forest
In this paper, we build on a recent bicategorical model called thin spans of groupoids, introduced by Clairambault and Forest. Notably, thin spans feature a decomposition of symmet…
The Cartesian Closed Bicategory of Thin Spans of Groupoids
Pierre Clairambault, Simon Forest
Recently, there has been growing interest in bicategorical models of programming languages, which are "proof-relevant" in the sense that they keep distinct account of execution tra…
Free precategories as presheaf categories
Simon Forest, Samuel Mimram
Precategories generalize both the notions of strict -category and sesquicategory: their definition is essentially the same as the one of strict -categories, excepting that we…
An extension of Batanin's approach to globular algebras
Simon Forest
In earlier work, Batanin has shown that an important class of definitions of higher categories could be apprehended together simply as monads over globular sets. This allowed him t…
Rewriting in Gray categories with applications to coherence
Simon Forest, Samuel Mimram
Over the recent years, the theory of rewriting has been used and extended in order to provide systematic techniques to show coherence results for strict higher categories. Here, we…
Unifying notions of pasting diagrams
Simon Forest
In this work, we relate the three main formalisms for the notion of pasting diagram in strict -categories: Street's parity complexes, Johnson's pasting schemes and Steiner's aug…
Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
Simon Forest, David Gosset, Vadym Kliuchnikov +1
We generalize an efficient exact synthesis algorithm for single-qubit unitaries over the Clifford+T gate set which was presented by Kliuchnikov, Maslov and Mosca. Their algorithm t…