How to Install and Uninstall ghc-semigroupoids.x86_64 Package on AlmaLinux 9
Last updated: November 27,2024
1. Install "ghc-semigroupoids.x86_64" package
Please follow the steps below to install ghc-semigroupoids.x86_64 on AlmaLinux 9
$
sudo dnf update
Copied
$
sudo dnf install
ghc-semigroupoids.x86_64
Copied
2. Uninstall "ghc-semigroupoids.x86_64" package
Learn how to uninstall ghc-semigroupoids.x86_64 on AlmaLinux 9:
$
sudo dnf remove
ghc-semigroupoids.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the ghc-semigroupoids.x86_64 package on AlmaLinux 9
Last metadata expiration check: 2:13:41 ago on Wed Mar 13 07:41:12 2024.
Available Packages
Name : ghc-semigroupoids
Version : 5.3.7
Release : 1.el9
Architecture : x86_64
Size : 169 k
Source : ghc-semigroupoids-5.3.7-1.el9.src.rpm
Repository : epel
Summary : Semigroupoids: Category sans id
URL : https://hackage.haskell.org/package/semigroupoids
License : BSD
Description : Provides a wide array of (semi)groupoids and operations for working with them.
:
: A 'Semigroupoid' is a 'Category' without the requirement of identity arrows for
: every object in the category.
:
: A 'Category' is any 'Semigroupoid' for which the Yoneda lemma holds.
:
: When working with comonads you often have the '<*>' portion of an
: 'Applicative', but not the 'pure'. This was captured in Uustalu and Vene's
: "Essence of Dataflow Programming" in the form of the 'ComonadZip' class in the
: days before 'Applicative'. Apply provides a weaker invariant, but for the
: comonads used for data flow programming (found in the streams package), this
: invariant is preserved. Applicative function composition forms a semigroupoid.
Available Packages
Name : ghc-semigroupoids
Version : 5.3.7
Release : 1.el9
Architecture : x86_64
Size : 169 k
Source : ghc-semigroupoids-5.3.7-1.el9.src.rpm
Repository : epel
Summary : Semigroupoids: Category sans id
URL : https://hackage.haskell.org/package/semigroupoids
License : BSD
Description : Provides a wide array of (semi)groupoids and operations for working with them.
:
: A 'Semigroupoid' is a 'Category' without the requirement of identity arrows for
: every object in the category.
:
: A 'Category' is any 'Semigroupoid' for which the Yoneda lemma holds.
:
: When working with comonads you often have the '<*>' portion of an
: 'Applicative', but not the 'pure'. This was captured in Uustalu and Vene's
: "Essence of Dataflow Programming" in the form of the 'ComonadZip' class in the
: days before 'Applicative'. Apply provides a weaker invariant, but for the
: comonads used for data flow programming (found in the streams package), this
: invariant is preserved. Applicative function composition forms a semigroupoid.