agda 2.6.0.1-1build2 source package in Ubuntu
Changelog
agda (2.6.0.1-1build2) eoan; urgency=medium * No-change rebuild for new GHC ABIs -- Steve Langasek <email address hidden> Tue, 03 Sep 2019 05:49:27 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Eoan
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
agda_2.6.0.1.orig.tar.gz | 2.3 MiB | 7bb88a9cd4a556259907ccc71d54e2acc9d3e9ce05486ffdc83f721c7c06c0e8 |
agda_2.6.0.1-1build2.debian.tar.xz | 9.9 KiB | db863affa5326454676f632a404f042c12c0623b1a523bf9a135a4c1048e854e |
agda_2.6.0.1-1build2.dsc | 4.2 KiB | d29863e2849640b05be1fa3ccd7066d863bd5c3df3cccf147af3202f47fb9f93 |
Available diffs
- diff from 2.5.4.1-3 (in Debian) to 2.6.0.1-1build2 (783.5 KiB)
- diff from 2.6.0.1-1build1 to 2.6.0.1-1build2 (489 bytes)
Binary packages built by this source
- agda: 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.
- agda-bin: No summary available for agda-bin in ubuntu eoan.
No description available for agda-bin in ubuntu eoan.
- agda-mode: transitional dummy package for elpa-agda2-mode
agda-mode has been ELPAfied. See the elpa-agda2-mode package. This
transitional package is safe to remove.
- elpa-agda2-mode: No summary available for elpa-agda2-mode in ubuntu eoan.
No description available for elpa-agda2-mode in ubuntu eoan.
- libghc-agda-dev: No summary available for libghc-agda-dev in ubuntu eoan.
No description available for libghc-agda-dev in ubuntu eoan.
- libghc-agda-doc: dependently typed functional programming language; documentation
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 package provides the documentation for a library for the Haskell
programming language.
See http://www.haskell. org/ for more information on Haskell.