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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The maximum segment sum problem is to compute, given a list of integers, thelargest of the sums of the contiguous segments of that list. This problemspecification maps directly onto a cubic-time algorithm; however, there is avery elegant linear-time solution too. The problem is a classic exercise in themathematics of program construction, illustrating important principles such ascalculational development, pointfree reasoning, algebraic structure, anddatatype-genericity. Here, we take a sideways look at the datatype-genericversion of the problem in terms of monadic functional programming, instead ofthe traditional relational approach; the presentation is tutorial in style, andleavened with exercises for the reader.

Maximum Segment Sum, Monadically (distilled tutorial, with solutions)