Extended directed graphs, a formalism for structured data and data structures

zbMATH Open0348.68026MaRDI QIDQ1234591FDOQ1234591

Authors: M. E. Majster 

Publication date: 1977

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited In (8)

• Two impossibility theorems on behaviour specification of abstract data types
• Algebraic specification of modules and their basic interconnections
• Specifications, models, and implementations of data abstractions
• Algebraic specifications of computable and semicomputable data types
• A constructive method for abstract algebraic software specification
• About the implementability and the power of equationally defined data abstractions
• Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
• Data types, abstract data types and their specification problem

This page was built for publication: Extended directed graphs, a formalism for structured data and data structures

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