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 studies emulation of induction by coinduction in a call-by-namelanguage with control operators. Since it is known that call-by-nameprogramming languages with control operators cannot have general initialalgebras, interaction of induction and control operators is often restricted toeffect-free functions. We show that some class of such restricted inductivetypes can be derived from full coinductive types by the power of controloperators. As a typical example of our results, the type of natural numbers isrepresented by the type of streams. The underlying idea is a counterpart of thefact that some coinductive types can be expressed by inductive types incall-by-name pure language without side-effects.

Induction by Coinduction and Control Operators in Call-by-Name