How to Install and Uninstall ghc-free.x86_64 Package on Fedora 36
Last updated: January 11,2025
1. Install "ghc-free.x86_64" package
Please follow the steps below to install ghc-free.x86_64 on Fedora 36
$
sudo dnf update
Copied
$
sudo dnf install
ghc-free.x86_64
Copied
2. Uninstall "ghc-free.x86_64" package
In this section, we are going to explain the necessary steps to uninstall ghc-free.x86_64 on Fedora 36:
$
sudo dnf remove
ghc-free.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the ghc-free.x86_64 package on Fedora 36
Last metadata expiration check: 5:46:01 ago on Thu Sep 8 08:04:50 2022.
Available Packages
Name : ghc-free
Version : 5.1.7
Release : 2.fc36
Architecture : x86_64
Size : 278 k
Source : ghc-free-5.1.7-2.fc36.src.rpm
Repository : fedora
Summary : Monads for free
URL : https://hackage.haskell.org/package/free
License : BSD
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:
: .
Available Packages
Name : ghc-free
Version : 5.1.7
Release : 2.fc36
Architecture : x86_64
Size : 278 k
Source : ghc-free-5.1.7-2.fc36.src.rpm
Repository : fedora
Summary : Monads for free
URL : https://hackage.haskell.org/package/free
License : BSD
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:
: