[Paper Review] Unguarded Recursion on Coinductive Resumptions

Sergey Goncharov, Lutz Schröder+2 more|arXiv (Cornell University)|May 5, 2014

Logic, programming, and type systems30 references4 citations

TL;DR

This paper establishes that the coinductive generalized resumption transformer $T_{ angle}$, which extends a base monad $T$ with free operations via cofree coalgebra construction, forms a complete Elgot monad if $T$ is a complete Elgot monad. The key contribution is proving unguarded recursion is possible in this framework, removing the need for guardedness in recursive definitions while preserving equational laws for recursion.

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.

Motivation & Objective

• To provide semantic foundations for non-wellfounded, side-effecting recursive definitions using coinductive resumptions.
• To remove the guardedness constraint in recursive definitions that previously restricted recursion to only guarded forms.
• To show that the coinductive generalized resumption transformer $T_{\Sigma}$ inherits the structure of a complete Elgot monad from a complete Elgot base monad $T$.
• To characterize the solution operator of $T_{\Sigma}$ as uniquely determined by the base monad's iteration structure.
• To establish a universal property of $T_{\Sigma}$ in terms of coproducts of complete Elgot monads.

Proposed method

• Construct $T_{\Sigma}X = \nu\gamma.\, T(X + \Sigma\gamma)$ as a final coalgebra, representing non-wellfounded side-effecting processes.
• Leverage Uustalu's results on guarded recursion over parametrized monads to derive solutions for guarded equations.
• Use the solution operator of $T$ as a complete Elgot monad to construct unguarded solutions for $T_{\Sigma}$ via lifting and extension.
• Prove that the resulting solution operator on $T_{\Sigma}$ satisfies the standard equational laws of complete Elgot monads.
• Establish uniqueness of the $T_{\Sigma}$ structure as an extension of $T$'s iteration via a retract-based construction.
• Use formal verification in Coq to validate the technical results, particularly the equational laws and solution construction.

Experimental results

Research questions

• RQ1 Under what conditions can unguarded recursion be soundly modeled in coinductive resumption monads?
• RQ2 Can the coinductive generalized resumption transformer $T_{\Sigma}$ support unguarded iteration if the base monad $T$ is a complete Elgot monad?
• RQ3 Is the solution operator for unguarded recursion on $T_{\Sigma}$ uniquely determined by the base monad's iteration structure?
• RQ4 What is the universal characterization of $T_{\Sigma}$ in terms of coproducts of complete Elgot monads?
• RQ5 How does the structure of $T_{\Sigma}$ relate to the initial complete Elgot monad $\mathbb{L}$ when $\mathbf{C}$ admits one?

Key findings

• The coinductive generalized resumption transformer $T_{\Sigma}$ is a complete Elgot monad if the base monad $T$ is a complete Elgot monad.
• The solution operator on $T_{\Sigma}$ satisfies the standard equational laws of complete Elgot monads, enabling principled unguarded recursion.
• The structure of $T_{\Sigma}$ as a complete Elgot monad is uniquely determined by the iteration structure of $T$.
• When the base category $\mathbf{C}$ admits an initial complete Elgot monad $\mathbb{L}$, it holds that $\mathbb{T}_{\Sigma} \cong \mathbb{T} + \mathbb{L}_{\Sigma}$ in the category of complete Elgot monads on $\mathbf{C}$.
• The construction of unguarded solutions relies on lifting solutions from guarded equations via Uustalu's parametrized monad framework, avoiding the need for idealized monads.
• The results are formally verified in Coq, confirming the correctness of the solution operator and equational laws.