How to Install and Uninstall ghc-free Package on openSuSE Tumbleweed
Last updated: December 27,2024
1. Install "ghc-free" package
This tutorial shows how to install ghc-free on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
ghc-free
Copied
2. Uninstall "ghc-free" package
This is a short guide on how to uninstall ghc-free on openSuSE Tumbleweed:
$
sudo zypper remove
ghc-free
Copied
3. Information about the ghc-free package on openSuSE Tumbleweed
Information for package ghc-free:
---------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : ghc-free
Version : 5.2-1.4
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.9 MiB
Installed : No
Status : not installed
Source package : ghc-free-5.2-1.4.src
Upstream URL : https://hackage.haskell.org/package/free
Summary : Monads for free
Description :
Free monads are useful for many tree-like 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 "zero-cost": '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 rose-trees, 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.
More information on free monads, including examples, can be found in the
following blog posts:
.
---------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : ghc-free
Version : 5.2-1.4
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.9 MiB
Installed : No
Status : not installed
Source package : ghc-free-5.2-1.4.src
Upstream URL : https://hackage.haskell.org/package/free
Summary : Monads for free
Description :
Free monads are useful for many tree-like 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 "zero-cost": '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 rose-trees, 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.
More information on free monads, including examples, can be found in the
following blog posts: