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

The execution of sequential programs allows them to be represented usingmathematical functions formed by the composition of statements following oneafter the other. Each such statement is in itself a partial function, whichallows only inputs satisfying a particular Boolean condition to carry forwardthe execution and hence, the composition of such functions (as a result ofsequential execution of the statements) strengthens the valid set of inputstate variables for the program to complete its execution and halt succesfully.With this thought in mind, this paper tries to study a particular class ofpartial functions, which tend to preserve the truth of two given Booleanconditions whenever the state variables satisfying one are mapped through suchfunctions into a domain of state variables satisfying the other. The existenceof such maps allows us to study isomorphism between different programs, basednot only on their structural characteristics (e.g. the kind of programmingconstructs used and the overall input-output transformation), but also thenature of computation performed on seemingly different inputs. Consequently, wecan now relate programs which perform a given type of computation, like a loopcounting down indefinitely, without caring about the input sets they work onindividually or the set of statements each program contains.

A similarity criterion for sequential programs using truth-preserving partial functions