Nominal sets. Names and symmetry in computer science

DOI10.1017/CBO9781139084673zbMATH Open1297.68008MaRDI QIDQ2849600FDOQ2849600

Andrew M. Pitts

Publication date: 23 September 2013

Published in: Cambridge Tracts in Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• Nominal Sets over Algebraic Atoms
• Nominal Lawvere theories: a category theoretic account of equational theories with names
• Towards nominal computation
• On nominal sets with support-preorder
• Nominal equational logic

zbMATH Keywords

permutationsnamesabstract namesfreshenessname abstractionorbit-finiteness

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of programming languages (68N15) Topoi (18B25) Categorical semantics of formal languages (18C50) Semantics in the theory of computing (68Q55)

Cited In (91)

• Title not available (Why is that?)
• Properties of finitely supported self-mappings on the finite powerset of atoms
• Category-theoretic structure for independence and conditional independence
• Title not available (Why is that?)
• Coalgebraic semantics for nominal automata
• Rensets and renaming-based recursion for syntax with bindings
• A dependent type theory with abstractable names
• Automata-theoretic semantics of idealized Algol with passive expressions
• Nominal lambda calculus: an internal language for FM-Cartesian closed categories
• On solving nominal disunification constraints
• Rewriting with generalized nominal unification
• Title not available (Why is that?)
• Nominal unification with letrec and environment-variables
• Title not available (Why is that?)
• A formalisation of nominal C-matching through unification with protected variables
• Declarative event based models of concurrency and refinement in psi-calculi
• On Finitary Functors
• Infinite populations, choice and determinacy
• Nominal Domain Theory for Concurrency
• Various forms of infinity for finitely supported structures
• Nominal Kleene Coalgebra
• Properties of the atoms in finitely supported structures
• Binding operators for nominal sets
• Nominal equational problems
• Nondeterministic and co-nondeterministic implies deterministic, for data languages
• Title not available (Why is that?)
• Cathoristic Logic
• Coverability Synthesis in Parametric Petri Nets
• Nominal Automata with Name Binding
• Cubical Type Theory: a constructive interpretation of the univalence axiom
• Latent semantic analysis of game models using LSTM
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
• Nominal unification with atom-variables
• Title not available (Why is that?)
• Five stages of accepting constructive mathematics
• Title not available (Why is that?)
• A program logic for fresh name generation
• A coalgebraic view on reachability
• A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle
• Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
• Fixed-Point Constraints for Nominal Equational Unification
• Bifibrational functorial semantics of parametric polymorphism
• COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
• C-system of a module over a \(Jf\)-relative monad
• The nominal/FM Yoneda Lemma
• Title not available (Why is that?)
• αCheck: A mechanized metatheory model checker
• Fast computations on ordered nominal sets
• Free functor from the category of \(G\)-nominal sets to that of 01-\(G\)-nominal sets
• Validating Brouwer's continuity principle for numbers using named exceptions
• Fixed point results for finitely supported algebraic structures
• Title not available (Why is that?)
• Simple and subdirectly irreducible finitely supported \(Cb\)-sets
• Title not available (Why is that?)
• Completeness and incompleteness in nominal Kleene algebra
• Modal dependent type theory and dependent right adjoints
• Denotational Semantics with Nominal Scott Domains
• Exploring nominal cellular automata
• Fuzzy sets within finitely supported mathematics
• A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus
• Behavioural equivalences for coalgebras with unobservable moves
• A presheaf model of parametric type theory
• A general account of coinduction up-to
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transpension: the right adjoint to the Pi-type
• Orbit-finite-dimensional vector spaces and weighted register automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(\text{TT}^\Box_{\mathcal{C}}\): a family of extensional type theories with effectful realizers of continuity
• Completeness of Nominal PROPs
• Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
• The fresh-graph of a nominal set
• The far side of the cube. An elementary introduction to game semantics
• Formalising nominal C-unification generalised with protected variables
• A Certified Functional Nominal C-Unification Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• AsPINN: Adaptive symmetry-recomposition physics-informed neural networks
• Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction
• Solvability of orbit-finite systems of linear equations
• On nominal sets with support-preorder
• Automata and coalgebras in categories of species
• Rensets and renaming-based recursion for syntax with bindings extended version
• Title not available (Why is that?)
• Nominal Sets in Agda - A Fresh and Immature Mechanization
• Nominal AC-matching
• A spatial logic with time and quantifiers

This page was built for publication: Nominal sets. Names and symmetry in computer science

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