A calculus of mobile processes, I
Information and Computation
Nominal Logic: A First Order Theory of Names and Binding
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
Electronic Notes in Theoretical Computer Science (ENTCS)
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Electronic Notes in Theoretical Computer Science (ENTCS)
On the construction of free algebras for equational systems
Theoretical Computer Science
Journal of Logic and Computation
On universal algebra over nominal sets
Mathematical Structures in Computer Science
Binding in Nominal Equational Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Second-order algebraic theories
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Nominal Lambda Calculus: An Internal Language for FM-Cartesian Closed Categories
Electronic Notes in Theoretical Computer Science (ENTCS)
Instances of Computational Effects: An Algebraic Perspective
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
Lawvere theories provide a category theoretic view of equational 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 categories that we call nominal Lawvere theories.