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 order to achieve competitive performance, abstract machines for Prolog andrelated languages end up being large and intricate, and incorporatesophisticated optimizations, both at the design and at the implementationlevels. At the same time, efficiency considerations make it necessary to uselow-level languages in their implementation. This makes them laborious to code,optimize, and, especially, maintain and extend. Writing the abstract machine(and ancillary code) in a higher-level language can help tame this inherentcomplexity. We show how the semantics of most basic components of an efficientvirtual machine for Prolog can be described using (a variant of) Prolog. Thesedescriptions are then compiled to C and assembled to build a complete bytecodeemulator. Thanks to the high level of the language used and its closeness toProlog, the abstract machine description can be manipulated using standardProlog compilation and optimization techniques with relative ease. We also showhow, by applying program transformations selectively, we obtain abstractmachine implementations whose performance can match and even exceed that ofstate-of-the-art, highly-tuned, hand-crafted emulators.

Description and Optimization of Abstract Machines in a Dialect of Prolog