Nominal Sets
From MaRDI portal
Publication:2849600
DOI10.1017/CBO9781139084673zbMath1297.68008MaRDI QIDQ2849600
Publication date: 23 September 2013
Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Topoi (18B25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Categorical semantics of formal languages (18C50)
Related Items (81)
Nominal lambda calculus: an internal language for FM-Cartesian closed categories ⋮ Automata-theoretic semantics of idealized Algol with passive expressions ⋮ Properties of finitely supported self-mappings on the finite powerset of atoms ⋮ Infinite populations, choice and determinacy ⋮ Declarative event based models of concurrency and refinement in psi-calculi ⋮ Completeness of Nominal PROPs ⋮ A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle ⋮ Category-theoretic structure for independence and conditional independence ⋮ Nominal Kleene Coalgebra ⋮ On nominal sets with support-preorder ⋮ Nominal unification with atom-variables ⋮ A program logic for fresh name generation ⋮ Unnamed Item ⋮ Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets ⋮ Unnamed Item ⋮ On Finitary Functors ⋮ Unnamed Item ⋮ Completeness and incompleteness in nominal Kleene algebra ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Exploring nominal cellular automata ⋮ Unnamed Item ⋮ Simple and subdirectly irreducible finitely supported \(Cb\)-sets ⋮ A Certified Functional Nominal C-Unification Algorithm ⋮ Behavioural equivalences for coalgebras with unobservable moves ⋮ The fresh-graph of a nominal set ⋮ Unnamed Item ⋮ αCheck: A mechanized metatheory model checker ⋮ Rensets and renaming-based recursion for syntax with bindings extended version ⋮ Latent semantic analysis of game models using LSTM ⋮ Nominal Sets in Agda - A Fresh and Immature Mechanization ⋮ Nominal AC-matching ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications ⋮ C-system of a module over a \(Jf\)-relative monad ⋮ A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus ⋮ Unnamed Item ⋮ Five stages of accepting constructive mathematics ⋮ Unnamed Item ⋮ A presheaf model of parametric type theory ⋮ Bifibrational functorial semantics of parametric polymorphism ⋮ On solving nominal disunification constraints ⋮ Nominal Automata with Name Binding ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fixed-Point Constraints for Nominal Equational Unification ⋮ Rewriting with generalized nominal unification ⋮ Cathoristic Logic ⋮ Nominal equational problems ⋮ Nondeterministic and co-nondeterministic implies deterministic, for data languages ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ Binding operators for nominal sets ⋮ A general account of coinduction up-to ⋮ A dependent type theory with abstractable names ⋮ Cubical Type Theory: a constructive interpretation of the univalence axiom ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast computations on ordered nominal sets ⋮ Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness ⋮ Fixed point results for finitely supported algebraic structures ⋮ Fuzzy sets within finitely supported mathematics ⋮ Properties of the atoms in finitely supported structures ⋮ Free functor from the category of \(G\)-nominal sets to that of 01-\(G\)-nominal sets ⋮ Unnamed Item ⋮ A coalgebraic view on reachability ⋮ Modal dependent type theory and dependent right adjoints ⋮ The nominal/FM Yoneda Lemma ⋮ Unnamed Item ⋮ COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS ⋮ Coverability Synthesis in Parametric Petri Nets ⋮ Denotational Semantics with Nominal Scott Domains ⋮ A formalisation of nominal C-matching through unification with protected variables ⋮ Coalgebraic semantics for nominal automata ⋮ Rensets and renaming-based recursion for syntax with bindings ⋮ Formalising nominal C-unification generalised with protected variables ⋮ Various forms of infinity for finitely supported structures ⋮ Nominal unification with letrec and environment-variables
This page was built for publication: Nominal Sets
