How to Install and Uninstall ghc-recursion-schemes Package on openSUSE Leap
Last updated: November 07,2024
1. Install "ghc-recursion-schemes" package
This is a short guide on how to install ghc-recursion-schemes on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
ghc-recursion-schemes
Copied
2. Uninstall "ghc-recursion-schemes" package
Here is a brief guide to show you how to uninstall ghc-recursion-schemes on openSUSE Leap:
$
sudo zypper remove
ghc-recursion-schemes
Copied
3. Information about the ghc-recursion-schemes package on openSUSE Leap
Information for package ghc-recursion-schemes:
----------------------------------------------
Repository : Main Repository
Name : ghc-recursion-schemes
Version : 5.2.2.2-bp155.2.14
Arch : x86_64
Vendor : openSUSE
Installed Size : 645.3 KiB
Installed : No
Status : not installed
Source package : ghc-recursion-schemes-5.2.2.2-bp155.2.14.src
Upstream URL : https://hackage.haskell.org/package/recursion-schemes
Summary : Representing common recursion patterns as higher-order functions
Description :
Many recursive functions share the same structure, e.g. pattern-match on the
input and, depending on the data constructor, either recur on a smaller input
or terminate the recursion with the base case. Another one: start with a seed
value, use it to produce the first element of an infinite list, and recur on a
modified seed in order to produce the rest of the list. Such a structure is
called a recursion scheme. Using higher-order functions to implement those
recursion schemes makes your code clearer, faster, and safer. See README for
details.
----------------------------------------------
Repository : Main Repository
Name : ghc-recursion-schemes
Version : 5.2.2.2-bp155.2.14
Arch : x86_64
Vendor : openSUSE
Installed Size : 645.3 KiB
Installed : No
Status : not installed
Source package : ghc-recursion-schemes-5.2.2.2-bp155.2.14.src
Upstream URL : https://hackage.haskell.org/package/recursion-schemes
Summary : Representing common recursion patterns as higher-order functions
Description :
Many recursive functions share the same structure, e.g. pattern-match on the
input and, depending on the data constructor, either recur on a smaller input
or terminate the recursion with the base case. Another one: start with a seed
value, use it to produce the first element of an infinite list, and recur on a
modified seed in order to produce the rest of the list. Such a structure is
called a recursion scheme. Using higher-order functions to implement those
recursion schemes makes your code clearer, faster, and safer. See README for
details.