Nominal sets. Names and symmetry in computer science
From MaRDI portal
(Redirected from Publication:2849600)
Recommendations
Cited in
(only showing first 100 items - show all)- Solvability of orbit-finite systems of linear equations
- On nominal sets with support-preorder
- Complete test suites for automata in monoidal closed categories
- scientific article; zbMATH DE number 7471718 (Why is no real title available?)
- Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
- Completeness and incompleteness in nominal Kleene algebra
- Modal dependent type theory and dependent right adjoints
- Exploring nominal cellular automata
- Internal parametricity for cubical type theory
- Cubical type theory: a constructive interpretation of the univalence axiom
- Automata and coalgebras in categories of species
- Nominal Kleene coalgebra
- Rensets and renaming-based recursion for syntax with bindings extended version
- Fuzzy sets within finitely supported mathematics
- A certified functional nominal C-unification algorithm
- A curry-style semantics of interaction: from untyped to second-order lazy -calculus
- Behavioural equivalences for coalgebras with unobservable moves
- Cathoristic logic. A logic for capturing inferences between atomic sentences
- Fixed-point constraints for nominal equational unification
- Nominal Sets in Agda - A Fresh and Immature Mechanization
- Nominal AC-matching
- A spatial logic with time and quantifiers
- A general account of coinduction up-to
- Nominal automata with name binding
- A presheaf model of parametric type theory
- Properties of finitely supported self-mappings on the finite powerset of atoms
- The nominal/FM Yoneda lemma
- Category-theoretic structure for independence and conditional independence
- Towards nominal computation
- Automata-theoretic semantics of idealized Algol with passive expressions
- Nominal lambda calculus: an internal language for FM-Cartesian closed categories
- A dependent type theory with abstractable names
- Coalgebraic semantics for nominal automata
- Rensets and renaming-based recursion for syntax with bindings
- On solving nominal disunification constraints
- Atomic toposes with co-well-founded categories of atoms
- scientific article; zbMATH DE number 7561600 (Why is no real title available?)
- Rewriting with generalized nominal unification
- scientific article; zbMATH DE number 7561623 (Why is no real title available?)
- Denotational semantics with nominal Scott domains
- Transpension: the right adjoint to the Pi-type
- Nominal unification with letrec and environment-variables
- Equivalence and conditional independence in atomic sheaf logic
- A nominal approach to probabilistic separation logic
- Separating Markov's principles
- Diagrammatic algebra of first order logic
- Orbit-finite-dimensional vector spaces and weighted register automata
- Declarative event based models of concurrency and refinement in psi-calculi
- A formalisation of nominal C-matching through unification with protected variables
- Infinite populations, choice and determinacy
- Nominal Domain Theory for Concurrency
- Various forms of infinity for finitely supported structures
- Unguarded recursion on coinductive resumptions
- Properties of the atoms in finitely supported structures
- scientific article; zbMATH DE number 7649885 (Why is no real title available?)
- Nominal Renaming Sets
- Binding operators for nominal sets
- scientific article; zbMATH DE number 7136664 (Why is no real title available?)
- Nominal equational problems
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- scientific article; zbMATH DE number 7559500 (Why is no real title available?)
- scientific article; zbMATH DE number 7456059 (Why is no real title available?)
- Generalised name abstraction for nominal sets
- The category \(\mathbf{Rel}(\mathbf{Nom})\)
- On nominal syntax and permutation fixed points
- \(\text{TT}^\Box_{\mathcal{C}}\): a family of extensional type theories with effectful realizers of continuity
- Latent semantic analysis of game models using LSTM
- Bisimilarity in fresh-register automata
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- Completeness of Nominal PROPs
- Nominal unification with atom-variables
- Modal logics for nominal transition systems
- Certified first-order AC-unification and applications.
- Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
- The fresh-graph of a nominal set
- A nominal relational model for local store
- Five stages of accepting constructive mathematics
- scientific article; zbMATH DE number 7003193 (Why is no real title available?)
- A program logic for fresh name generation
- The far side of the cube. An elementary introduction to game semantics
- Set-theoretic analysis of nominative data
- Nominal unification with atom and context variables
- Strong nominal semantics for fixed-point constraints
- A model of stochastic memoization and name generation in probabilistic programming: categorical semantics via monads on presheaf categories
- A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Function spaces for orbit-finite sets
- Formalising nominal C-unification generalised with protected variables
- A coalgebraic view on reachability
- Rule formats for nominal process calculi
- On finitary functors
- Automata and coalgebras in categories of species
- Separated finitely supported Cb-sets
- Nominal anti-unification modulo equational theories
- Bifibrational functorial semantics of parametric polymorphism
- C-system of a module over a \(Jf\)-relative monad
- Fast computations on ordered nominal sets
- COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
- scientific article; zbMATH DE number 7471707 (Why is no real title available?)
- Symbolic execution game semantics
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)
