Recursive domain equations for concrete data structure

DOI10.1016/0890-5401(89)90065-5MaRDI QIDQ1823005zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 4018370 (Why is no real title available?)
• scientific article; zbMATH DE number 3858394 (Why is no real title available?)
• scientific article; zbMATH DE number 4048997 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• 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

Cited in

(6)

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

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)