Path to this page:
./
math/hsfree,
Monads for free
Branch: CURRENT,
Version: 5.1.10nb1,
Package name: hsfree5.1.10nb1,
Maintainer: pkgsrcusersFree monads are useful for many treelike structures and domain specific
languages.
If f is a Functor then the free Monad on f is the type of trees whose nodes
are labeled with the constructors of f. The word "free" is used in the
sense of "unrestricted" rather than "zerocost": Free f makes no
constraining assumptions beyond those given by f and the definition of
Monad. As used here it is a standard term from the mathematical theory of
adjoint functors.
Cofree comonads are dual to free monads. They provide convenient ways to
talk about branching streams and rosetrees, and can be used to annotate
syntax trees. The cofree comonad can be seen as a stream parameterized by a
Functor that controls its branching factor.
Master sites:
Filesize: 60.976 KB
Version history: (Expand)
 (20230209) Updated to version: hsfree5.1.10nb1
 (20230127) Updated to version: hsfree5.1.10
 (20220226) Updated to version: hsfree5.1.7nb1
 (20220216) Package added to pkgsrc.se, version hsfree5.1.7 (created)
CVS history: (Expand)
20230127 14:50:46 by Masatake Daimon  Files touched by this commit (4) 
Log message:
math/hsfree: Update to 5.1.10
5.1.10 [2022.11.30]
* Add a MonadFail instance for FT.
5.1.9 [2022.06.26]
* Simplify the Eq and Ord instances for FT to avoid the use of overlapping
instances.
5.1.8 [2022.05.07]
* Generalize the Monad constraint in the type signatures for hoistFreeT in
Control.Monad.Trans.Free and Control.Monad.Trans.Free.Ap to a Functor
constraint.
* Allow building with transformers0.6.* and mtl2.3.*.

20220226 04:58:36 by Masatake Daimon  Files touched by this commit (872) 
Log message:
Bump all Haskell packages after enabling "split sections" in mk/haskell.mk

20220216 09:53:40 by Masatake Daimon  Files touched by this commit (5) 
Log message:
math/hsfree: import hsfree5.1.7
Free monads are useful for many treelike structures and domain specific
languages.
If f is a Functor then the free Monad on f is the type of trees whose nodes
are labeled with the constructors of f. The word "free" is used in the
sense of "unrestricted" rather than "zerocost": Free f makes no
constraining assumptions beyond those given by f and the definition of
Monad. As used here it is a standard term from the mathematical theory of
adjoint functors.
Cofree comonads are dual to free monads. They provide convenient ways to
talk about branching streams and rosetrees, and can be used to annotate
syntax trees. The cofree comonad can be seen as a stream parameterized by a
Functor that controls its branching factor.
