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

We consider a simple model of higher order, functional computation over thebooleans. Then, we enrich the model in order to encompass non-termination andunrecoverable errors, taken separately or jointly. We show that the models sodefined form a lattice when ordered by the extensional collapse situationrelation, introduced in order to compare models with respect to the amount of"intensional information" that they provide on computation. The proofs arecarried out by exhibiting suitable applied {\lambda}-calculi, and by exploitingthe fundamental lemma of logical relations.

Extensional Collapse Situations I: non-termination and unrecoverable errors