Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On universal algebra over nominal sets
Mathematical Structures in Computer Science
Binding in Nominal Equational Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Automated Reasoning
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Freshness and name-restriction in sets of traces with names
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Principal types for nominal theories
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Stone duality for nominal Boolean algebras with И
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Nominal Unification from a Higher-Order Perspective
ACM Transactions on Computational Logic (TOCL)
Permissive-nominal logic: First-order logic over nominal terms and sets
ACM Transactions on Computational Logic (TOCL)
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
Nominal completion for rewrite systems with binders
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
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 |
In informal mathematical discourse (such as the text of a paper on theoretical computer science), we often reason about equalities involving binding of object-variables. We find ourselves writing assertions involving meta-variables and captureavoidance constraints on where object-variables can and cannot occur free. Formalizing such assertions is problematic because the standard logical frameworks cannot express capture-avoidance constraints directly. In this article, we make the case for extending the logic of equality with meta-variables and capture-avoidance constraints, to obtain ‘nominal algebra’. We use nominal techniques that allow for a direct formalization of meta-level assertions, while remaining close to informal practice. We investigate proof-theoretical properties, we provide a sound and complete semantics in nominal sets and we compare and contrast our design decisions with other possibilities leading to similar systems.