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

Context: Generic programming, as defined by Stepanov, is a methodology forwriting efficient and reusable algorithms by considering only the requiredproperties of their underlying data types and operations. Generic programminghas proven to be an effective means of constructing libraries of reusablesoftware components in languages that support it. Generics-related languagedesign choices play a major role in how conducive generic programming is inpractice.  Inquiry: Several mainstream programming languages (e.g. Java and C++) werefirst created without generics; features to support generic programming wereadded later, gradually. Much of the existing literature on supporting genericprogramming focuses thus on retrofitting generic programming into existinglanguages and identifying related implementation challenges. Is the programmingexperience significantly better, or different when programming with a languagedesigned for generic programming without limitations from prior language designchoices?  Approach: We examine Magnolia, a language designed to embody genericprogramming. Magnolia is representative of an approach to language designrooted in algebraic specifications. We repeat a well-known experiment, where weput Magnolia's generic programming facilities under scrutiny by implementing asubset of the Boost Graph Library, and reflect on our development experience.  Knowledge: We discover that the idioms identified as key features forsupporting Stepanov-style generic programming in the previous studies and workon the topic do not tell a full story. We clarify which of them are more of ameans to an end, rather than fundamental features for supporting genericprogramming. Based on the development experience with Magnolia, we identifyvariadics as an additional key feature for generic programming and point outlimitations and challenges of genericity by property.  Grounding: Our work uses a well-known framework for evaluating the genericprogramming facilities of a language from the literature to evaluate thealgebraic approach through Magnolia, and we draw comparisons with well-knownprogramming languages.  Importance: This work gives a fresh perspective on generic programming, andclarifies what are fundamental language properties and their trade-offs whenconsidering supporting Stepanov-style generic programming. The understanding ofhow to set the ground for generic programming will inform future languagedesign.

Revisiting Language Support for Generic Programming: When Genericity Is a Core Design Goal