How to Install and Uninstall ghc-free Package on openSUSE Leap

Last updated: May 19,2024

1. Install "ghc-free" package

In this section, we are going to explain the necessary steps to install ghc-free on openSUSE Leap


    
        
            $
        

        
            
                sudo zypper refresh
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo zypper install
            
                        
                ghc-free
            
                    
    
    Copied

2. Uninstall "ghc-free" package

Please follow the steps below to uninstall ghc-free on openSUSE Leap:


    
        
            $
        

        
            
                sudo zypper remove
            
                        
                ghc-free
            
                    
    
    Copied

3. Information about the ghc-free package on openSUSE Leap

Information for package ghc-free:
---------------------------------
Repository : Main Repository
Name : ghc-free
Version : 5.1.7-bp155.3.14
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.8 MiB
Installed : No
Status : not installed
Source package : ghc-free-5.1.7-bp155.3.14.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:
.