How to Install and Uninstall libghc-data-reify-dev Package on Kali Linux
Last updated: November 07,2024
1. Install "libghc-data-reify-dev" package
Here is a brief guide to show you how to install libghc-data-reify-dev on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libghc-data-reify-dev
Copied
2. Uninstall "libghc-data-reify-dev" package
Please follow the steps below to uninstall libghc-data-reify-dev on Kali Linux:
$
sudo apt remove
libghc-data-reify-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libghc-data-reify-dev package on Kali Linux
Package: libghc-data-reify-dev
Source: haskell-data-reify (0.6.3-5)
Version: 0.6.3-5+b1
Installed-Size: 166
Maintainer: Debian Haskell Group
Architecture: amd64
Provides: libghc-data-reify-dev-0.6.3-877ba
Depends: libghc-base-dev-4.17.2.0-68dfe, libghc-containers-dev-0.6.7-a1650, libghc-hashable-dev-1.4.3.0-e937e, libghc-unordered-containers-dev-0.2.19.1-230f0, libc6 (>= 2.2.5), libgmp10 (>= 2:6.3.0+dfsg)
Size: 31144
SHA256: 111fcc6d43194a825c86662ea3e4717ba9876e8dca4ce5133e64f7694a620cc8
SHA1: 1291efe6938ae12cff96570afcb6f5252f6f6a58
MD5sum: 85b12d0bf7cc2d4adfcf597ebf9a9ad1
Description: Reify a recursive data structure into an explicit graph.
'data-reify' provided the ability to turn recursive structures into explicit
graphs. Many (implicitly or explicitly) recursive data structure can be given
this ability, via a type class instance. This gives an alternative to using
'Ref' for observable sharing.
.
Observable sharing in general is unsafe, so we use the IO monad to bound this
effect, but can be used safely even with 'unsafePerformIO' if some simple
conditions are met. Typically this package will be used to tie the knot with
DSL's that depend of observable sharing, like Lava.
.
Providing an instance for 'MuRef' is the mechanism for allowing a structure to
be reified into a graph, and several examples of this are provided.
.
© 2009 Andy Gill; BSD3 license.
.
This package provides a library for the Haskell programming language.
See http://www.haskell.org/ for more information on Haskell.
Description-md5:
Homepage: https://ku-fpg.github.io/software/data-reify/
Ghc-Package: data-reify-0.6.3-IYkvOsQstNnIHZfFhOlCdE
Section: haskell
Priority: optional
Filename: pool/main/h/haskell-data-reify/libghc-data-reify-dev_0.6.3-5+b1_amd64.deb
Source: haskell-data-reify (0.6.3-5)
Version: 0.6.3-5+b1
Installed-Size: 166
Maintainer: Debian Haskell Group
Architecture: amd64
Provides: libghc-data-reify-dev-0.6.3-877ba
Depends: libghc-base-dev-4.17.2.0-68dfe, libghc-containers-dev-0.6.7-a1650, libghc-hashable-dev-1.4.3.0-e937e, libghc-unordered-containers-dev-0.2.19.1-230f0, libc6 (>= 2.2.5), libgmp10 (>= 2:6.3.0+dfsg)
Size: 31144
SHA256: 111fcc6d43194a825c86662ea3e4717ba9876e8dca4ce5133e64f7694a620cc8
SHA1: 1291efe6938ae12cff96570afcb6f5252f6f6a58
MD5sum: 85b12d0bf7cc2d4adfcf597ebf9a9ad1
Description: Reify a recursive data structure into an explicit graph.
'data-reify' provided the ability to turn recursive structures into explicit
graphs. Many (implicitly or explicitly) recursive data structure can be given
this ability, via a type class instance. This gives an alternative to using
'Ref' for observable sharing.
.
Observable sharing in general is unsafe, so we use the IO monad to bound this
effect, but can be used safely even with 'unsafePerformIO' if some simple
conditions are met. Typically this package will be used to tie the knot with
DSL's that depend of observable sharing, like Lava.
.
Providing an instance for 'MuRef' is the mechanism for allowing a structure to
be reified into a graph, and several examples of this are provided.
.
© 2009 Andy Gill; BSD3 license.
.
This package provides a library for the Haskell programming language.
See http://www.haskell.org/ for more information on Haskell.
Description-md5:
Homepage: https://ku-fpg.github.io/software/data-reify/
Ghc-Package: data-reify-0.6.3-IYkvOsQstNnIHZfFhOlCdE
Section: haskell
Priority: optional
Filename: pool/main/h/haskell-data-reify/libghc-data-reify-dev_0.6.3-5+b1_amd64.deb