Nominal Equational Logic

Authors:
Ranald A. Clouston;Andrew M. Pitts
Affiliations:
Computer Laboratory, University of Cambridge, Cambridge CB3 0DF, UK;Computer Laboratory, University of Cambridge, Cambridge CB3 0DF, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 20
Cited 23

Substitution revisited

Theoretical Computer Science
A calculus of mobile processes, II

Information and Computation
Universal algebra

Handbook of logic in computer science (vol. 1)
Lambda abstraction algebras: representation theorems

AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
On the algebraic models of Lambda calculus

Theoretical Computer Science - Modern algebra and its applications
Normalization and Partial Evaluation

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
FreshML: programming with binders made simple

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Nominal logic, a first order theory of names and binding

Information and Computation - TACS 2001
Nominal rewriting systems

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Sequent Calculus for Nominal Logic

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Nominal Games and Full Abstraction for the Nu-Calculus

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Nominal unification

Theoretical Computer Science
Nominal logic programming

Nominal logic programming
One-and-a-halfth-order logic

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Alpha-structural recursion and induction

Journal of the ACM (JACM)
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
An Overview of Cαml

Electronic Notes in Theoretical Computer Science (ENTCS)
A recursion combinator for nominal datatypes implemented in Isabelle/HOL

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Free-algebra models for the π-calculus

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Nominal Matching and Alpha-Equivalence

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Nominal Unification from a Higher-Order Perspective

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Term Equational Systems and Logics

Electronic Notes in Theoretical Computer Science (ENTCS)
On the construction of free algebras for equational systems

Theoretical Computer Science
Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names

Electronic Notes in Theoretical Computer Science (ENTCS)
The lambda-context calculus (extended version)

Information and Computation
A formal calculus for informal equality with binding

WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Matching and alpha-equivalence check for nominal terms

Journal of Computer and System Sciences
On universal algebra over nominal sets

Mathematical Structures in Computer Science
Binding in Nominal Equational Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Equivariant Unification

Journal of Automated Reasoning
Presenting functors on many-sorted varieties and applications

Information and Computation
Second-order equational logic

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Equational presentations of functors and monads

Mathematical Structures in Computer Science
The first-order nominal link

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Nominal lawvere theories

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Nominal Unification from a Higher-Order Perspective

ACM Transactions on Computational Logic (TOCL)
Completeness for algebraic theories of local state

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Nominal completion for rewrite systems with binders

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
An algebraic presentation of predicate logic

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Generalised name abstraction for nominal sets

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies the notion of ''freshness'' that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is an extension of ordinary equational logic with assertions about the freshness of names. It is shown to be both sound and complete for the support interpretation of freshness and equality provided by the Gabbay-Pitts nominal sets model of names, binding and @a-conversion.