How to Install and Uninstall Agda.x86_64 Package on Red Hat Enterprise Linux 9 (RHEL 9)

Last updated: January 12,2025

1. Install "Agda.x86_64" package

This is a short guide on how to install Agda.x86_64 on Red Hat Enterprise Linux 9 (RHEL 9)


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                Agda.x86_64
            
                    
    
    Copied

2. Uninstall "Agda.x86_64" package

Please follow the steps below to uninstall Agda.x86_64 on Red Hat Enterprise Linux 9 (RHEL 9):


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                Agda.x86_64
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the Agda.x86_64 package on Red Hat Enterprise Linux 9 (RHEL 9)

Last metadata expiration check: 1:20:24 ago on Mon Feb 26 07:04:30 2024.
Available Packages
Name : Agda
Version : 2.6.2.2
Release : 36.el9
Architecture : x86_64
Size : 7.9 M
Source : Agda-2.6.2.2-36.el9.src.rpm
Repository : epel
Summary : A dependently typed functional programming language and proof assistant
URL : https://hackage.haskell.org/package/Agda
License : MIT and BSD
Description : Agda is a dependently typed functional programming language: it has
: inductive families, which are similar to Haskell's GADTs, but they can
: be indexed by values and not just types. It also has parameterized
: 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.