Add to ORKGA modified definition of the category of forests found in Costello [Cos04] and Getzler [Get09] is given. This language is used to prove some cofibration properties of the W construction for colored operads. An application is given to the swiss cheese operad. The language of forests is convenient for showing that the swiss cheese operad is equivalent to its free degree 0 and 1 pieces
We explore the relationship between polynomial functors and trees. In the first part we characterise...
There are at least as many interesting classes of regular tree lan-guages as there are of regular wo...
AbstractClassical proof forests are a proof formalism for first-order classical logic based on Herbr...
AbstractIn this paper we present and study a categorical formulation of the W-types of Martin-Löf. T...
Abstract. In this paper we study a category of trees TI and prove that it is a Koszul category. Cons...
Swiss cheese sets have been used in the literature as useful examples in the study of rational appro...
this paper, we give an abstract 2 categorical characterization of W-types. We calculate these W-typ...
Swiss cheese sets are compact subsets of the complex plane obtained by deleting a sequence of open d...
19 pages, 8 figuresThe theme of this article is the algebraic combinatorics of leaf-labeled rooted b...
19 pages, 8 figuresThe theme of this article is the algebraic combinatorics of leaf-labeled rooted b...
We use the recently developed theory of forest algebras to find algebraiccharacterizations of the la...
42 pagesWe introduce the notions of preordered and heap-preordered forests, generalizing the constru...
We describe combinatorial Hopf (co-)operadic models for the Swiss Cheese operads built from Feynman ...
This is a thoroughly revised and expanded version of a paper with a similar title (hal-03702762, arX...
We explore the relationship between polynomial functors and trees. In the first part we characterise...
We explore the relationship between polynomial functors and trees. In the first part we characterise...
There are at least as many interesting classes of regular tree lan-guages as there are of regular wo...
AbstractClassical proof forests are a proof formalism for first-order classical logic based on Herbr...
AbstractIn this paper we present and study a categorical formulation of the W-types of Martin-Löf. T...
Abstract. In this paper we study a category of trees TI and prove that it is a Koszul category. Cons...
Swiss cheese sets have been used in the literature as useful examples in the study of rational appro...
this paper, we give an abstract 2 categorical characterization of W-types. We calculate these W-typ...
Swiss cheese sets are compact subsets of the complex plane obtained by deleting a sequence of open d...
19 pages, 8 figuresThe theme of this article is the algebraic combinatorics of leaf-labeled rooted b...
19 pages, 8 figuresThe theme of this article is the algebraic combinatorics of leaf-labeled rooted b...
We use the recently developed theory of forest algebras to find algebraiccharacterizations of the la...
42 pagesWe introduce the notions of preordered and heap-preordered forests, generalizing the constru...
We describe combinatorial Hopf (co-)operadic models for the Swiss Cheese operads built from Feynman ...
This is a thoroughly revised and expanded version of a paper with a similar title (hal-03702762, arX...
We explore the relationship between polynomial functors and trees. In the first part we characterise...
We explore the relationship between polynomial functors and trees. In the first part we characterise...
There are at least as many interesting classes of regular tree lan-guages as there are of regular wo...
AbstractClassical proof forests are a proof formalism for first-order classical logic based on Herbr...