Recursive domain equations for concrete data structure

DOI10.1016/0890-5401(89)90065-5zbMATH Open0679.68149OpenAlexW1966443116MaRDI QIDQ1823005FDOQ1823005

Authors: 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

Recommendations

• Event structures and domains
• scientific article; zbMATH DE number 4045109
• Concrete domains
• scientific article; zbMATH DE number 3858394
• Universal homogeneous event structures and domains

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Petri nets, event structures and domains. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Category-Theoretic Solution of Recursive Domain Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential algorithms on concrete data structures
• Event structures and domains
• Title not available (Why is that?)

Cited In (5)

• 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
• Universal domains and the amalgamation property

This page was built for publication: Recursive domain equations for concrete data structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823005)