Nominal Renaming Sets
From MaRDI portal
Recommendations
Cited in
(19)- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
- Rensets and renaming-based recursion for syntax with bindings
- Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
- An extension of a permutative model of set theory
- A nominal relational model for local store
- Game semantics in the nominal model
- Unity in nominal equational reasoning: the algebra of equality on nominal sets
- Alpha equivalence equalities
- Generalised name abstraction for nominal sets
- Rule formats for nominal process calculi
- On nominal sets with support-preorder
- Nominal system T
- From Renaming to Set Agreement
- The fresh-graph of a nominal set
- Rensets and renaming-based recursion for syntax with bindings extended version
- Nominal Sets in Agda - A Fresh and Immature Mechanization
- Support preorder on finitely supported \(\mathbf{Cb}\)-sets
- Nominal Henkin semantics: simply-typed lambda-calculus models in nominal sets
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
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)