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

The expressiveness of dependent type theory can be extended by identifyingtypes modulo some additional computation rules. But, for preserving thedecidability of type-checking or the logical consistency of the system, onemust make sure that those user-defined rewriting rules preserve typing. In thispaper, we give a new method to check that property using Knuth-Bendixcompletion.

Type safety of rewrite rules in dependent types