Recursive domain equations for concrete data structure

DOI10.1016/0890-5401(89)90065-5zbMath0679.68149OpenAlexW1966443116MaRDI QIDQ1823005

Manfred Droste

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90065-5

zbMATH Keywords

denotational semanticsevent structuresrecursive domain equationsScott's information systemsKahn and Plotkin's concrete data structures

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)

Related Items

Universal domains and the amalgamation property ⋮ Event structures and domains ⋮ Non-deterministic information systems and their domains ⋮ Universal homogeneous event structures and domains ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin

Cites Work

• Event structures and domains
• Petri nets, event structures and domains. I
• Sequential algorithms on concrete data structures
• The Category-Theoretic Solution of Recursive Domain Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item