Nominal Renaming Sets

DOI10.1007/978-3-540-89439-1_11zbMATH Open1182.03065OpenAlexW1524793155MaRDI QIDQ5505550FDOQ5505550

Authors: Martin Hofmann, Murdoch J. Gabbay 

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_11

Recommendations

• Nominal sets. Names and symmetry in computer science
• Nominal Sets over Algebraic Atoms
• Towards nominal computation
• Generalised name abstraction for nominal sets
• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets

zbMATH Keywords

nominal setsnominal renaming setsabstract syntax with binding

Mathematics Subject Classification ID

Logic in computer science (03B70) Categorical logic, topoi (03G30) Abstract data types; algebraic specification (68Q65)

Cited In (17)

• Rensets and renaming-based recursion for syntax with bindings
• Alpha equivalence equalities
• Unity in nominal equational reasoning: the algebra of equality on nominal sets
• Nominal system T
• Generalised name abstraction for nominal sets
• PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
• From Renaming to Set Agreement
• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
• The fresh-graph of a nominal set
• A nominal relational model for local store
• Rule formats for nominal process calculi
• Game semantics in the nominal model
• An extension of a permutative model of set theory
• On nominal sets with support-preorder
• Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
• Rensets and renaming-based recursion for syntax with bindings extended version
• Nominal Sets in Agda - A Fresh and Immature Mechanization

This page was built for publication: Nominal Renaming Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505550)