How to Install and Uninstall libghc-dual-tree-doc Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 17,2024

1. Install "libghc-dual-tree-doc" package

This tutorial shows how to install libghc-dual-tree-doc on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libghc-dual-tree-doc
            
                    
    
    Copied

2. Uninstall "libghc-dual-tree-doc" package

This guide covers the steps necessary to uninstall libghc-dual-tree-doc on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libghc-dual-tree-doc
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libghc-dual-tree-doc package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libghc-dual-tree-doc
Priority: extra
Section: universe/doc
Installed-Size: 248
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Architecture: all
Source: haskell-dual-tree
Version: 0.2.0.8-1build1
Depends: haddock-interface-27
Recommends: ghc-doc, libghc-monoid-extras-doc, libghc-newtype-doc, libghc-semigroups-doc
Filename: pool/universe/h/haskell-dual-tree/libghc-dual-tree-doc_0.2.0.8-1build1_all.deb
Size: 30386
MD5sum: 3ba8657eb7f14b4672ea59b769a33de6
SHA1: 49fb55013459b99d115c83e7371c74cc0c13f78c
SHA256: da72e980916f14c1609acec075417eca4c3adf6f1e281c5e7d444e9122a3091c
Description-en: Rose trees with cached and accumulating monoidal annotations; documentation
Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling
(i.e. accumulating) monoidal annotations.
.
Abstractly, a DUALTree is a rose (n-ary) tree with data at leaves, data at
internal nodes, and two types of monoidal annotations, one travelling "up" the
tree and one traveling "down".
.
This package provides the documentation for a library for the Haskell
programming language.
See http://www.haskell.org/ for more information on Haskell.
Description-md5: a25e20325a4bb023d541df3b88b9ffa7
Homepage: http://hackage.haskell.org/package/dual-tree
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu