Nominal Domain Theory for Concurrency

DOI10.1007/978-3-642-04027-6_39zbMath1257.68110OpenAlexW2097196501MaRDI QIDQ3644772

No author found.

Publication date: 12 November 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04027-6_39

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of set theory (03E75)

Related Items

Completeness of Nominal PROPs ⋮ Simple and subdirectly irreducible finitely supported \(Cb\)-sets ⋮ Nominal Automata with Name Binding ⋮ Free functor from the category of \(G\)-nominal sets to that of 01-\(G\)-nominal sets ⋮ Nominal Domain Theory for Concurrency ⋮ Denotational Semantics with Nominal Scott Domains

Uses Software

• HOPLA
• New-HOPLA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to abstract syntax with variable binding
• Domain theory for concurrency
• Nominal Domain Theory for Concurrency