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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Most programming languages allow to construct recursive algorithms bymeans of a recursive definition expressing the meaning of such a definition in terms of its own meaning. In order to analyze the correctness of such recursive definitions, D.S. Scott developed a mathematical theory of computation which is based on ideas from order theory and topology (Davey & Priestley, 1990; Scott, 1970; 1972). From the Scott theory viewpoint, the meaning of such a denotational specification is obtained as the fixed point of a nonrecursive mapping, induced by the denotational specification, which is at the same time the topological limit of successive iterations of the nonrecursive mapping acting on a distinguished element of the model. Moreover, the order of Scott’s model represents some notion of information so that each iteration of the nonrecursive mapping, which models each step of the program computation, is identified with an element of the mathematical model which is greater than (or equal to) the other ones associated with the preceding iterations (preceding steps of the program computation) because each iteration gives more information about the meaning than those computed before. Hence the aforesaid meaning of the recursive denotational specification is modeled as the fixed point of the nonrecursive mapping which is obtained as the limit, with respect to the so-called Scott topology, of the increasing sequence of successive iterations. Consequently, the fixed point captures the amount of information defined by the increasing sequence, i.e. the fixed point yields the total information about the meaning provided by the elements of the increasing sequence, and it does not contain more information than can be obtained from the elements of such a sequence.

A Common Mathematical Framework for Asymptotic Complexity Analysis and Denotational Semantics for Recursive Programs Based on Complexity Spaces