How to Install and Uninstall agda Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 04,2024

1. Install "agda" package

This is a short guide on how to install agda on Ubuntu 21.04 (Hirsute Hippo)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                agda
            
                    
    
    Copied

2. Uninstall "agda" package

Please follow the guidance below to uninstall agda on Ubuntu 21.04 (Hirsute Hippo):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                agda
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the agda package on Ubuntu 21.04 (Hirsute Hippo)

Package: agda
Architecture: all
Version: 2.6.1-1build2
Priority: extra
Section: universe/misc
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 23
Depends: agda-bin, agda-stdlib, agda-stdlib-doc, elpa-agda2-mode, libghc-agda-dev
Filename: pool/universe/a/agda/agda_2.6.1-1build2_all.deb
Size: 4184
MD5sum: a3bfcf569c7157ec5882ab7ae34d6eef
SHA1: b9e23ec5faec91ed1d45554627717cb4db87d168
SHA256: 38494a3e599ca30c1603baf66a93398e974124807a39e3e499a7c16ac87ada85
SHA512: 763577a3c9b7e66b8ba4237a5fcfb344f8a0415b932148cb86228604b76251bbf61e3da4b35b7515017bfec69e4cd7e3f80561d3bf1c135d3785865ae2cb9c14
Homepage: https://wiki.portal.chalmers.se/agda/
Description-en: dependently typed functional programming language
Agda is a dependently typed functional programming language: It has inductive
families, which are like Haskell's GADTs, but they can be indexed by values and
not just types. It also has parameterised modules, mixfix operators, Unicode
characters, and an interactive Emacs interface (the type checker can assist in
the development of your code).
.
Agda is also a proof assistant: It is an interactive system for writing and
checking proofs. Agda is based on intuitionistic type theory, a foundational
system for constructive mathematics developed by the Swedish logician Per
Martin-Löf. It has many similarities with other proof assistants based on
dependent types, such as Coq, Epigram and NuPRL.
.
This is a meta package which provides Agda's emacs mode, executable, standard
library and its documentation.
Description-md5: 65333dc4f3e4d00a90419d96d9785d24