R. Kieburtz. Codata and Comonads in Haskell (Unpublished manuscript). Available from http://www.cse.ogi.edu/~dick/dick.html.  Home/Search   Document Not in Database   Summary   Related Articles

....dual to monads in a categorical sense, that have been used almost entirely in semantics (see e.g. 6, 7, 31, 32] In recent years, however, there has been a growing interest in investigating the usefulness that comonads may have in programming. Some results in this concern are given by Kieburtz [21], who argues that comonads account naturally for effects that derive from program context. This paper reports ongoing research concerning the interaction between comonads and recursion. Like with monads, the aim of this work is the study of recursive operators with effects, now modeled by ....

....taili) SA . Since f # = Nf ffi fl A = f 1 ffi tails for each f : A 1 B, and tails is an unfold, by applying unfold map fusion, law (3) we get f # = hf; taili) SA : A 1 B 1 . That is, f # (s) scons(f(s) f # (tail(s) 2 Other examples of comonads can be found in [6, 21, 31]. In this paper we are interested in studying recursive operators that involve comonadic computations. Combining recursion and comonads requires an analysis of the interaction between comonads and functors representing datatype signatures. For this analysis we will follow the guidelines given in ....

R. Kieburtz. Codata and Comonads in Haskell (Unpublished manuscript). Available from http://www.cse.ogi.edu/~dick/dick.html.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC