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

Specifications in the Twelf system are based on a logic programminginterpretation of the Edinburgh Logical Framework or LF. We consider anapproach to animating such specifications using a Lambda Prolog implementation.This approach is based on a lossy translation of the dependently typed LFexpressions into the simply typed lambda calculus (STLC) terms of Lambda Prologand a subsequent encoding of lost dependency information in predicates that aredefined by suitable clauses. To use this idea in an implementation of logicprogramming a la Twelf, it is also necessary to translate the results found forLambda Prolog queries back into LF expressions. We describe such an inversetranslation and show that it has the necessary properties to facilitate anemulation of Twelf behavior through our translation of LF specifications intoLambda Prolog programs. A characteristic of Twelf is that it permits queries toconsist of types which have unspecified parts represented by meta-variables forwhich values are to be found through computation. We show that this capabilitycan be supported within our translation based approach to animating Twelfspecifications.

A Lambda Prolog Based Animation of Twelf Specifications