Unguarded Recursion on Coinductive Resumptions

Goncharov S, Rauch C, Schröder L (2015)

Publication Type: Conference contribution, Original article

Publication year: 2015

Publisher: Elsevier

Pages Range: 250 - 264

Conference Proceedings Title: Mathematical Foundations of Programming Semantics XXXI, MFPS 2015

Event location: Art Cinema Lux, Nijmegen NL

Open Access Link: http://events.cs.bham.ac.uk/mfps31/mfpsproc.pdf

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.

Authors with CRIS profile

Sergey Goncharov Lehrstuhl für Informatik 8 (Theoretische Informatik) Christoph Rauch Lehrstuhl für Informatik 8 (Theoretische Informatik) Lutz Schröder Lehrstuhl für Informatik 8 (Theoretische Informatik)

Related research project(s)

A High Level Language for Monad-based Processes (HighMoon/HighMoon2) Sept. 1, 2013 - Oct. 31, 2020 Probabilistische Beschreibungslogik als Fragment der Probabilistischen Logik Erster Stufe (ProbDL) April 1, 2011 - April 1, 2014

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: Download