Abstract
Names, or object-level variables, are a ubiquitous feature in programming languages and other computational applications. Reasoning with names, and related constructs like binding and freshness, often poses conceptual and technical challenges. Nominal Equational Logic (NEL) is a logic for reasoning about equations in the presence of freshness side conditions. This paper gives a category theoretic account of NEL theories, by analogy with Lawvere's classic correspondence between equational theories and small categories with finite products. This development reveals the abstract structure behind reasoning with equations modulo freshness.
Original language | English |
---|---|
Pages (from-to) | 1067-1086 |
Number of pages | 20 |
Journal | Journal of Computer and System Sciences |
Volume | 80 |
Issue number | 6 |
DOIs | |
Publication status | Published - Sept 2014 |