Abstract. The notion of Σ-monoids is proposed by Fiore, Plotkin and Turi, to give abstract algebraic model of languages with variable binding and substitutions. In this paper, we give a free construction of Σ-monoids. The free Σ-monoid over a given presheaf serves a well-structured term language involving binding and substitutions. Moreover, the free Σ-monoid naturally contains interesting syntactic objects which can be viewed as “metavariables ” and “environments”. We analyse the term language of the free Σ-monoid by relating it with several concrete systems, especially the λ-calculus extended with contexts.
AbstractThe aim of this paper is to present the notion of higher-dimensional syntax, which is a hier...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
AbstractThe λσ-calculus is a concrete λ-calculus of explicit substitutions, designed for reasoning a...
The study of words as a mathematical object is a deep and rich field of study. Algebra, Combinatoric...
AbstractThe finite π-calculus has an explicit set-theoretic functor-category model that is known to ...
We investigate different notions of nominal words, that is, words that my contain letters from an al...
The syntactic monoid of a language is generalized to the level of a symmetricmonoidal closed categor...
AbstractWe summarise Fiore et al's paper on variable substitution and binding, then axiomatise it. G...
It is possible to represent the terms of a syntax with binding constructors by a family of types, in...
This paper contains an interpretation of de Bruijn\u27s name-free expression in $ mathrm{C} &-monoid...
In this document, we introduce tools to describe languages in terms of monoids and in terms of first...
. The main goal of this work is the investigation of some properties of co-regular languages. In man...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free ...
In this paper we consider a set of congruent classes of X^* under an equivarent relation ~. The set ...
AbstractThe aim of this paper is to present the notion of higher-dimensional syntax, which is a hier...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
AbstractThe λσ-calculus is a concrete λ-calculus of explicit substitutions, designed for reasoning a...
The study of words as a mathematical object is a deep and rich field of study. Algebra, Combinatoric...
AbstractThe finite π-calculus has an explicit set-theoretic functor-category model that is known to ...
We investigate different notions of nominal words, that is, words that my contain letters from an al...
The syntactic monoid of a language is generalized to the level of a symmetricmonoidal closed categor...
AbstractWe summarise Fiore et al's paper on variable substitution and binding, then axiomatise it. G...
It is possible to represent the terms of a syntax with binding constructors by a family of types, in...
This paper contains an interpretation of de Bruijn\u27s name-free expression in $ mathrm{C} &-monoid...
In this document, we introduce tools to describe languages in terms of monoids and in terms of first...
. The main goal of this work is the investigation of some properties of co-regular languages. In man...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free ...
In this paper we consider a set of congruent classes of X^* under an equivarent relation ~. The set ...
AbstractThe aim of this paper is to present the notion of higher-dimensional syntax, which is a hier...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
AbstractThe λσ-calculus is a concrete λ-calculus of explicit substitutions, designed for reasoning a...