How to Install and Uninstall agda Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: May 14,2024

1. Install "agda" package

Please follow the instructions below to install agda on Ubuntu 20.10 (Groovy Gorilla)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                agda
            
                    
    
    Copied

2. Uninstall "agda" package

Please follow the steps below to uninstall agda on Ubuntu 20.10 (Groovy Gorilla):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                agda
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the agda package on Ubuntu 20.10 (Groovy Gorilla)

Package: agda
Architecture: all
Version: 2.6.1-1build1
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-1build1_all.deb
Size: 4168
MD5sum: abf7a301b645f993dd3a1ed711f6ca15
SHA1: 8bd5c1950db64c79a6201e73b26fbdba042b03e9
SHA256: 08fc4e44cb1f1c9bf4656d03a0ac085c77ceed4f47c42cf91887d1bb2217ffcf
SHA512: b3fbce58cfc5cb4e98097ff8482daf6a82f2640a95f721af9adced5d1254400dd9c1d476f347665f010e0cf00bd3a10468e0dc06c25eb3703ab9c69c0f2517b6
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