Binding in Nominal Equational Logic

Authors:
Ranald Clouston
Affiliations:
Computer Laboratory, University of Cambridge, Cambridge CB3 0DF, United Kingdom
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 12
Cited 2

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Extending the lambda calculus with surjective pairing is conservative

Proceedings of the Fourth Annual Symposium on Logic in computer science
Semantics of programming languages: structures and techniques

Semantics of programming languages: structures and techniques
Nominal Logic: A First Order Theory of Names and Binding

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
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 Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Nominal Equational Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
A Head-to-Head Comparison of de Bruijn Indices and Names

Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal (Universal) Algebra

Journal of Logic and Computation
Nominal system T

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Overview of Cαml

Electronic Notes in Theoretical Computer Science (ENTCS)

Nominal lawvere theories

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Nominal Lambda Calculus: An Internal Language for FM-Cartesian Closed Categories

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many formal systems, particularly in computer science, may be expressed through equations modulated by assertions regarding the 'freshness of names'. It is the presence of binding operators that make such structure non-trivial. Clouston and Pitts's Nominal Equational Logic presented a formalism for this style of reasoning in which support for name binding was implicit. This paper extends this logic to offer explicit support for binding and then demonstrates that such an extension does not in fact add expressivity.