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

This paper proposes a type-and-effect system called Teqt, which distinguishesterminating terms and total functions from possibly diverging terms and partialfunctions, for a lambda calculus with general recursion and equality types. Thecentral idea is to include a primitive type-form "Terminates t", expressingthat term t is terminating; and then allow terms t to be coerced from possiblydiverging to total, using a proof of Terminates t. We call such coercionstermination casts, and show how to implement terminating recursion using them.For the meta-theory of the system, we describe a translation from Teqt to alogical theory of termination for general recursive, simply typed functions.Every typing judgment of Teqt is translated to a theorem expressing theappropriate termination property of the computational part of the Teqt term.

Termination Casts: A Flexible Approach to Termination with General Recursion