Meta-programming with names and necessity
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
A Proof Theory for Generic Judgments: An extended abstract
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
A Sequent Calculus for Nominal Logic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Theoretical Computer Science
Nominal logic programming
Toward a general theory of names: binding and scope
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Translating specifications from nominal logic to CIC with the theory of contexts
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
ACM SIGACT News
A Logic for Reasoning about Generic Judgments
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Mechanized metatheory model-checking
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Electronic Notes in Theoretical Computer Science (ENTCS)
The lambda-context calculus (extended version)
Information and Computation
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Relating nominal and higher-order abstract syntax specifications
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Information and Computation
Stone duality for nominal Boolean algebras with И
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Journal of Automated Reasoning
The semantics of nominal logic programs
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Permissive-nominal logic: First-order logic over nominal terms and sets
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Nominal logic is a variant of first-order logic equipped with a “fresh-name quantifier” И and other features useful for reasoning about languages with bound names. Its original presentation was as a Hilbert axiomatic theory, but several attempts have been made to provide more convenient Gentzen-style sequent or natural deduction calculi for nominal logic. Unfortunately, the rules for И in these calculi involve complicated side-conditions, so using and proving properties of these calculi is difficult. This paper presents an improved sequent calculus $NL^{\Rightarrow}$ for nominal logic. Basic results such as cut-elimination and conservativity with respect to nominal logic are proved. Also, $NL^{\Rightarrow}$ is used to solve an open problem, namely relating nominal logic's И-quantifier and the self-dual $\nabla$-quantifier of Miller and Tiu's $FO\lambda^{\nabla}$.