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

In each variant of the lambda-calculus, factorization and normalization aretwo key-properties that show how results are computed. Instead of provingfactorization/normalization for the call-by-name (CbN) and call-by-value (CbV)variants separately, we prove them only once, for the bang calculus (anextension of the lambda-calculus inspired by linear logic and subsuming CbN andCbV), and then we transfer the result via translations, obtainingfactorization/normalization for CbN and CbV. The approach is robust: it stillholds when extending the calculi with operators and extra rules to model someadditional computational features.

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version)