How to Install and Uninstall agda-stdlib Package on Ubuntu 20.10 (Groovy Gorilla)
Last updated: December 23,2024
1. Install "agda-stdlib" package
Please follow the instructions below to install agda-stdlib on Ubuntu 20.10 (Groovy Gorilla)
$
sudo apt update
Copied
$
sudo apt install
agda-stdlib
Copied
2. Uninstall "agda-stdlib" package
Learn how to uninstall agda-stdlib on Ubuntu 20.10 (Groovy Gorilla):
$
sudo apt remove
agda-stdlib
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the agda-stdlib package on Ubuntu 20.10 (Groovy Gorilla)
Package: agda-stdlib
Architecture: all
Version: 1.3-2
Priority: extra
Section: universe/libs
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Iain Lane
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 94984
Depends: libghc-agda-dev (>= 2.6.1), libghc-agda-dev (<< 2.6.2~)
Breaks: agda-bin (<< 2.5.3)
Enhances: elpa-agda2-mode
Filename: pool/universe/a/agda-stdlib/agda-stdlib_1.3-2_all.deb
Size: 73224528
MD5sum: f04b16d694cc36c233f3ede7c25093d1
SHA1: 4b7ed5aa23f92d6be0d50c0db2336fab6240e239
SHA256: c8de2e77f10e1393cc3387e1aea8687950f3a3f75c5be312c50e22038487f9b1
SHA512: 93fa5bfe85fd7991f76f10d09082d65b6aa7ffd156a70c33e07e601a4ca7be7dc2d641e56c655848db1bf2294cd71b859a87e1700b3d62d3e20a830d26079f95
Homepage: http://wiki.portal.chalmers.se/agda/
Description-en: standard library for Agda
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.
.
The Agda standard library contains modules for many common data structures and
proof patterns. Modules provided include:
- Algebra: Specifying and reasoning about abstract algebraic structures
- Category: Using idioms from category theory to structure functional programs
- Coinduction: Support for programming coindutively
- Data: Data types and properties about data types
- Foreign: Relating to the foreign function interface
- Induction: A general framework for induction
- IO: Input/output related functions
- Level: Universe levels
- Relations: Properties of and proofs about relations
- Size: Sizes used by the sized types mechanism
.
This package contains the complete library.
Description-md5: c45346ed5a4053d9d174e9325e0d533b
Architecture: all
Version: 1.3-2
Priority: extra
Section: universe/libs
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Iain Lane
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 94984
Depends: libghc-agda-dev (>= 2.6.1), libghc-agda-dev (<< 2.6.2~)
Breaks: agda-bin (<< 2.5.3)
Enhances: elpa-agda2-mode
Filename: pool/universe/a/agda-stdlib/agda-stdlib_1.3-2_all.deb
Size: 73224528
MD5sum: f04b16d694cc36c233f3ede7c25093d1
SHA1: 4b7ed5aa23f92d6be0d50c0db2336fab6240e239
SHA256: c8de2e77f10e1393cc3387e1aea8687950f3a3f75c5be312c50e22038487f9b1
SHA512: 93fa5bfe85fd7991f76f10d09082d65b6aa7ffd156a70c33e07e601a4ca7be7dc2d641e56c655848db1bf2294cd71b859a87e1700b3d62d3e20a830d26079f95
Homepage: http://wiki.portal.chalmers.se/agda/
Description-en: standard library for Agda
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.
.
The Agda standard library contains modules for many common data structures and
proof patterns. Modules provided include:
- Algebra: Specifying and reasoning about abstract algebraic structures
- Category: Using idioms from category theory to structure functional programs
- Coinduction: Support for programming coindutively
- Data: Data types and properties about data types
- Foreign: Relating to the foreign function interface
- Induction: A general framework for induction
- IO: Input/output related functions
- Level: Universe levels
- Relations: Properties of and proofs about relations
- Size: Sizes used by the sized types mechanism
.
This package contains the complete library.
Description-md5: c45346ed5a4053d9d174e9325e0d533b