The Recursion Scheme from the Cofree Recursive Comonad

@article{Uustalu2011TheRS,
  title={The Recursion Scheme from the Cofree Recursive Comonad},
  author={Tarmo Uustalu and Varmo Vene},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2011},
  volume={229},
  pages={135-157}
}
We instantiate the general comonad-based construction of recursion schemes for the initial algebra of a functor F to the cofree recursive comonad on F . Differently from the scheme based on the cofree comonad on F in a similar fashion, this scheme allows not only recursive calls on elements structurally smaller than the given argument, but also subsidiary recursions. We develop a Mendler formulation of the scheme via a generalized Yoneda lemma for initial algebras involving strong dinaturality… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.
6 Citations
41 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 41 references

Yellow Series Report 92/480/18

  • R. Cockett, T. Fukushima, “About Charity
  • Dept. of Comput. Sci., Univ. of Calgary,
  • 1992
Highly Influential
10 Excerpts

Polymorphic isomorphisms, Discussion in the Types mailinglist

  • P. B. Levy, T. Altenkirch
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…