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

MaRDI QIDQ1234591zbMATH OpenFDO

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)

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

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)