Comments on: Free Monads for Less (Part 2 of 3): Yoneda
http://comonad.com/reader/2011/free-monads-for-less-2/
types, (co)monads, substructural logicSat, 29 Dec 2012 15:18:06 -0800http://wordpress.org/?v=2.8.4hourly1By: Philip J-F
http://comonad.com/reader/2011/free-monads-for-less-2/comment-page-1/#comment-104638
Philip J-FFri, 27 Apr 2012 05:01:00 +0000http://comonad.com/reader/?p=243#comment-104638shouldn't the type of improve be
Functor f => (forall m. MonadFree f m => m a) -> Free f a
instead of
(forall a. MonadFree f m => m a) -> Free f ashouldn’t the type of improve be
Functor f => (forall m. MonadFree f m => m a) -> Free f a
instead of
(forall a. MonadFree f m => m a) -> Free f a
]]>By: Edward Kmett
http://comonad.com/reader/2011/free-monads-for-less-2/comment-page-1/#comment-61478
Edward KmettSat, 25 Jun 2011 22:13:08 +0000http://comonad.com/reader/?p=243#comment-61478Fixed.Fixed.
]]>By: Mathnerd314
http://comonad.com/reader/2011/free-monads-for-less-2/comment-page-1/#comment-61475
Mathnerd314Sat, 25 Jun 2011 22:01:30 +0000http://comonad.com/reader/?p=243#comment-61475Your blog theme cuts off the type for ScottFreeYour blog theme cuts off the type for ScottFree
]]>