Unguarded Recursion on Coinductive Resumptions

Journal article
(Original article)


Publication Details

Author(s): Goncharov S, Schröder L, Rauch C, Jakob J
Journal: Logical Methods in Computer Science
Publication year: 2018
Volume: 14
Journal issue: 3
ISSN: 1860-5974
Language: English


Abstract

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. Correspondingly, the arising monad transformer has been termed the coinductive generalized resumption transformer. Monads 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. Moreover, we provide a universal characterization of the coinductive resumption monad transformer in terms of coproducts of complete Elgot monads.


FAU Authors / FAU Editors

Goncharov, Sergey PD Dr.-Ing.
Lehrstuhl für Informatik 8 (Theoretische Informatik)
Jakob, Julian
Lehrstuhl für Informatik 8 (Theoretische Informatik)
Rauch, Christoph
Lehrstuhl für Informatik 8 (Theoretische Informatik)
Schröder, Lutz Prof. Dr.
Lehrstuhl für Informatik 8 (Theoretische Informatik)


How to cite

APA:
Goncharov, S., Schröder, L., Rauch, C., & Jakob, J. (2018). Unguarded Recursion on Coinductive Resumptions. Logical Methods in Computer Science, 14(3). https://dx.doi.org/10.23638/LMCS-14(3:10)2018

MLA:
Goncharov, Sergey, et al. "Unguarded Recursion on Coinductive Resumptions." Logical Methods in Computer Science 14.3 (2018).

BibTeX: 

Last updated on 2019-24-01 at 13:53