Towards nominal computation
From MaRDI portal
Recommendations
Cited in
(26)- Simple and subdirectly irreducible finitely supported \(Cb\)-sets
- Simple-named complex-valued nominative data -- definition and basic operations
- Contribution of Warsaw logicians to computational logic
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- Nominal sets. Names and symmetry in computer science
- Nominal coalgebraic data types with applications to lambda calculus
- Automata theory in nominal sets
- Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
- Model checking Petri nets with names using data-centric dynamic systems
- Nominal monoids
- Validating Brouwer's continuity principle for numbers using named exceptions
- SMT solving for functional programming over infinite structures
- Residuality and learning for nondeterministic nominal automata
- scientific article; zbMATH DE number 7559500 (Why is no real title available?)
- scientific article; zbMATH DE number 7204453 (Why is no real title available?)
- scientific article; zbMATH DE number 7147443 (Why is no real title available?)
- Denotational semantics with nominal Scott domains
- Nominal Renaming Sets
- Fast computations on ordered nominal sets
- Fast computations on ordered nominal sets
- WQO dichotomy for 3-graphs
- Nominal Sets in Agda - A Fresh and Immature Mechanization
- A Theory of Formal Choreographic Languages
- Variable automata over infinite alphabets
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
This page was built for publication: Towards nominal computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942888)
