Prime algebraicity

DOI10.1016/J.TCS.2009.06.015zbMath1186.68271OpenAlexW2913583188MaRDI QIDQ843107

Glynn Winskel

Publication date: 29 September 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.015

zbMATH Keywords

information systemsconcurrencydomain theoryevent structuresdistributive algebraic latticesprime algebraicity

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) Distributive lattices (06D99)

Related Items (2)

Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ Learning in a Changing World, an Algebraic Modal Logical Approach

Uses Software

• HOPLA

Cites Work

• Linear logic
• The system \({\mathcal F}\) of variable types, fifteen years later
• Petri nets, event structures and domains. I
• Sequential algorithms on concrete data structures
• A fully abstract denotational model for higher-order processes
• Domain theory for concurrency
• Data Types as Lattices
• Profunctors, open maps and bisimulation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Prime algebraicity