Abstract. Lawvere theories provide a category theoretic view of equa-tional logic, identifying equational theories with small categories equipped with finite products. This formulation allows equational theories to be investigated as first class mathematical entities. However, many formal systems, particularly in computer science, are described by equations modulated by side conditions asserting the “freshness of names”; these may be expressed as theories of Nominal Equational Logic (NEL). This paper develops a correspondence between NEL-theories and certain cat-egories that we call nominal Lawvere theories
A logic is developed in which function symbols are allowed to represent partial functions. It has th...
AbstractLawvere theories provide a categorical formulation of the algebraic theories from universal ...
AbstractReasoning about atoms (names) is difficult. The last decade has seen the development of nume...
Lawvere theories provide a category theoretic view of equational logic, identifying equational theor...
AbstractWe introduce an abstract general notion of system of equations between terms, called Term Eq...
Since their introduction, nominal techniques have been widely applied in computer science to reason ...
AbstractUniversal algebra is often known within computer science in the guise of algebraic specifica...
AbstractLawvere theories and monads have been the two main category theoretic formulations of univer...
Motivated by the search for a body of mathematical theory to support the semantics of computational ...
Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the ope...
AbstractThere are currently no fewer than four dedicated logics for equality reasoning over nominal ...
AbstractLawvere theories have been one of the two main category theoretic formulations of universal ...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite p...
AbstractWe generalise the correspondence between Lawvere theories and finitary monads on Set in two ...
A logic is developed in which function symbols are allowed to represent partial functions. It has th...
AbstractLawvere theories provide a categorical formulation of the algebraic theories from universal ...
AbstractReasoning about atoms (names) is difficult. The last decade has seen the development of nume...
Lawvere theories provide a category theoretic view of equational logic, identifying equational theor...
AbstractWe introduce an abstract general notion of system of equations between terms, called Term Eq...
Since their introduction, nominal techniques have been widely applied in computer science to reason ...
AbstractUniversal algebra is often known within computer science in the guise of algebraic specifica...
AbstractLawvere theories and monads have been the two main category theoretic formulations of univer...
Motivated by the search for a body of mathematical theory to support the semantics of computational ...
Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the ope...
AbstractThere are currently no fewer than four dedicated logics for equality reasoning over nominal ...
AbstractLawvere theories have been one of the two main category theoretic formulations of universal ...
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we...
Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite p...
AbstractWe generalise the correspondence between Lawvere theories and finitary monads on Set in two ...
A logic is developed in which function symbols are allowed to represent partial functions. It has th...
AbstractLawvere theories provide a categorical formulation of the algebraic theories from universal ...
AbstractReasoning about atoms (names) is difficult. The last decade has seen the development of nume...