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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In implementing evaluation strategies of the lambda-calculus, bothcorrectness and efficiency of implementation are valid concerns. While thenotion of correctness is determined by the evaluation strategy, regardingefficiency there is a larger design space that can be explored, in particularthe trade-off between space versus time efficiency. Aiming at a unifiedframework that would enable the study of this trade-off, we introduce anabstract machine, inspired by Girard's Geometry of Interaction (GoI), a machinecombining token passing and graph rewriting. We show soundness and completenessof our abstract machine, called the \emph{Dynamic GoI Machine} (DGoIM), withrespect to three evaluations: call-by-need, left-to-right call-by-value, andright-to-left call-by-value. Analysing time cost of its execution classifiesthe machine as ``efficient'' in Accattoli's taxonomy of abstract machines.

The Dynamic Geometry of Interaction Machine: A Token-Guided Graph Rewriter