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

Along the lines of the Abramsky ``Proofs-as-Processes'' program, we presentan interpretation of multiplicative linear logic as typing system forconcurrent functional programming. In particular, we study a linearmultiple-conclusion natural deduction system and show it is isomorphic to asimple and natural extension of $\lambda$-calculus with parallelism andcommunication primitives, called $\lambda_{\unicode{8523}}$. We shall provethat $\lambda_{\unicode{8523}}$ satisfies all the desirable properties for atyped programming language: subject reduction, progress, strong normalizationand confluence.

$\unicode{8523}$ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs