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

Dependency pairs are a key concept at the core of modern automatedtermination provers for first-order term rewriting systems. In this paper, weintroduce an extension of this technique for a large class of dependently-typedhigher-order rewriting systems. This extends previous resultsby Wahlstedt onthe one hand and the first author on the other hand to strong normalization andnon-orthogonal rewriting systems. This new criterion is implemented in thetype-checker Dedukti.

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting