Generalised name abstraction for nominal sets

Authors:
Ranald Clouston
Affiliations:
Logic and Computation Group, Research School of Computer Science, The Australian National University, Canberra, ACT, Australia
Venue:
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Year:
2013

Citing 9
Cited 0

Nominal Logic: A First Order Theory of Names and Binding

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
FreshML: programming with binders made simple

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional 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
Nominal Equational Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Term Equational Systems and Logics

Electronic Notes in Theoretical Computer Science (ENTCS)
First-class patterns

Journal of Functional Programming
Ott: Effective tool support for the working semanticist

Journal of Functional Programming
General bindings and alpha-equivalence in nominal Isabelle

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Pure pattern calculus

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Gabbay-Pitts nominal sets model provides a framework for reasoning with names in abstract syntax. It has appealing semantics for name binding, via a functor mapping each nominal set to the 'atom-abstractions' of its elements. We wish to generalise this construction for applications where sets, lists, or other patterns of names are bound simultaneously. The atom-abstraction functor has left and right adjoint functors that can themselves be generalised, and their generalisations remain adjoints, but the atom-abstraction functor in the middle comes apart to leave us with two notions of generalised abstraction for nominal sets. We give new descriptions of both notions of abstraction that are simpler than those previously published. We discuss applications of the two notions, and give conditions for when they coincide.