Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
3 results

Exploring the Boundaries of Monad Tensorability on Set

Nathan Bowler ; Sergey Goncharov ; Paul Blain Levy ; Lutz Schröder.
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the component theories. As such, they extend the sum of two&nbsp;[&hellip;]
Published on September 18, 2013

Unguarded Recursion on Coinductive Resumptions

Sergey Goncharov ; Lutz Schröder ; Christoph Rauch ; Julian Jakob.
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&nbsp;[&hellip;]
Published on August 27, 2018

Guarded and Unguarded Iteration for Generalized Processes

Sergey Goncharov ; Lutz Schröder ; Christoph Rauch ; Maciej Piróg.
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding operations. On the other hand, many models of&nbsp;[&hellip;]
Published on July 4, 2019

  • < Previous
  • 1
  • Next >