English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We consider one aspect of the implementation of algebraically specified ADTs: choosing data structures for an efficient implementation. The class of hierarchical ADTs which insert and access data without key is considered. The storage relations and storage graphs (relations with additional efficiency information) of an ADT are defined and we discuss how implementation decisions can be made according to their properties.

Implementing algebraically specified abstract data types in an imperative programming language