Unguarded Recursion on Coinductive Resumptions

Conference contribution
(Original article)


Publication Details

Author(s): Goncharov S, Rauch C, Schröder L
Publisher: Elsevier
Publication year: 2015
Conference Proceedings Title: Mathematical Foundations of Programming Semantics XXXI, MFPS 2015
Pages range: 250 - 264


Abstract


We study a model of side-effecting processes obtained by adjoining free operations to a monad modelling base effects by means of 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.



FAU Authors / FAU Editors

Goncharov, Sergey Dr.-Ing.
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., Rauch, C., & Schröder, L. (2015). Unguarded Recursion on Coinductive Resumptions. In Mathematical Foundations of Programming Semantics XXXI, MFPS 2015 (pp. 250 - 264). Art Cinema Lux, Nijmegen, NL: Elsevier.

MLA:
Goncharov, Sergey, Christoph Rauch, and Lutz Schröder. "Unguarded Recursion on Coinductive Resumptions." Proceedings of the Mathematical Foundations of Programming Semantics XXXI, Art Cinema Lux, Nijmegen Elsevier, 2015. 250 - 264.

BibTeX: 

Last updated on 2018-19-04 at 02:59