A Sequent Calculus for Nominal Logic

Authors:
Murdoch Gabbay;James Cheney
Affiliations:
LIX École Polytechnique;Cornell University
Venue:
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Year:
2004

Citing 0
Cited 23

Nominal rewriting with name generation: abstraction vs. locality

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative 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
A proof theory for generic judgments

ACM Transactions on Computational Logic (TOCL)
SOS for higher order processes

CONCUR 2005 - Concurrency Theory
SIGACT news logic column 14

ACM SIGACT News
Nominal Equational Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
A Logic for Reasoning about Generic Judgments

Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling Generic Judgements

Electronic Notes in Theoretical Computer Science (ENTCS)
Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism*

Journal of Functional Programming
Nominal logic programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
a-Logic With Arrows

Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal Unification from a Higher-Order Perspective

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
A Simple Nominal Type Theory

Electronic Notes in Theoretical Computer Science (ENTCS)
Permissive-nominal logic

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
Namespace logic: a logic for a reflective higher-order calculus

TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Stone duality for nominal Boolean algebras with И

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Hybrid

Journal of Automated Reasoning
The semantics of nominal logic programs

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
A unifying model of variables and names

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A simpler proof theory for nominal logic

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Avoiding equivariance in alpha-prolog

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Permissive-nominal logic: First-order logic over nominal terms and sets

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a concise and natural encoding of the spi-calculus into the more basic 驴-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests ...