Unguarded Recursion on Coinductive Resumptions | Zendy

Sergey Goncharov | Zendy; Christoph Rauch | Zendy; Lutz Schröder | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Unguarded Recursion on Coinductive Resumptions

Author(s) -

Sergey Goncharov,

Christoph Rauch,

Lutz Schröder

Publication year - 2015

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2015.12.012

Subject(s) - monad (category theory) , coinduction , recursion (computer science) , coalgebra , base (topology) , computer science , algebra over a field , mathematics , programming language , discrete mathematics , pure mathematics , functor , geometry , mathematical analysis , mathematical proof

We study a model of side-effecting processes obtained by starting from a monad modelling base effects and adjoining free operations using a cofree coalgebra construction; one thus arrives at what one may think of as types of non-wellfounded side-effecting trees, generalizing the infinite resumption monad. Types of this kind have received some attention in the recent literature; in particular, it has been shown that they admit guarded iteration. Here, we show that they also admit unguarded iteration, i.e. form complete Elgot monads, provided that the underlying base effect supports unguarded iteration

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research