{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.manongdao.com/data/attach/logo/logo.png', '推荐 ら.Afraid 的问题《Pithy summary for codata (Where a comonad is a 》','https://www.manongdao.com/q-872168.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
In terms of pithy summaries - this description of Comonads seems to win - describing them as a 'type for input impurity'.
What is an equivalent pithy (one-sentence) description for codata?
相关问题
- Understanding do notation for simple Reader monad:
- Carry STRef implicitly in an environment during co
- Redefine list monad instance
- Constructing minimal Haskell example on error-hand
- Random-Pivot Quicksort in Haskell
相关文章
- Is there an instance of Monad but not of MonadFix?
- Understanding filterM
- How does <*> derived from pure and (>>=)?
- Why is “bind” written as >>= in Haskell Monads?
- Haskell do clause with multiple monad types
- Monadic fold with State monad in constant space (h
- What is an explicit example of a monad without a m
- Make an arbitrary class in Scala as a monad instan
"Codata are types inhabited by values that may be infinite"
This contrasts with "data" which is inhabited only by finite values. For example, if we take the "data" definition of lists, it is inhabited by lists of finite length (as in ML), but if we take the "codata" definition it is inhabited also by infinite length lists (as in Haskell, e.g.
x = 1 : x).Comonads and codata are not necessarily related (although perhaps some might think so due to Kieburtz' paper Comonads and codata in Haskell).