agda 2.6.1-1build2.1 source package in Ubuntu
Changelog
agda (2.6.1-1build2.1) impish; urgency=medium * No-change rebuild for libffi soname change. -- Matthias Klose <email address hidden> Sat, 11 Sep 2021 07:00:45 +0200
Upload details
- Uploaded by:
- Matthias Klose
- Uploaded to:
- Impish
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Jammy | release | universe | haskell |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
agda_2.6.1.orig.tar.gz | 2.5 MiB | 678f416af8f30d017825309f15fac41d239b07f66a4c40497e8435a6bdb7c129 |
agda_2.6.1-1build2.1.debian.tar.xz | 10.0 KiB | 66fff7cbfaf19f8cb613cc1c2dc775f74e5ac60ccf4dc3b941a68937842ed563 |
agda_2.6.1-1build2.1.dsc | 4.2 KiB | 8d86478a8a71c46e834b75144a48ffe34c498a071fc7fe152d1b0c552161170e |
Available diffs
- diff from 2.6.1-1build2 to 2.6.1-1build2.1 (313 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 impish.
No description available for agda-bin in ubuntu impish.
- elpa-agda2-mode: dependently typed functional programming language — emacs mode
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 contains the emacs interactive development mode for Agda. This
mode is the preferred way to write Agda code, and offers features such as
iterative development, refinement, case analysis and so on.
- libghc-agda-dev: No summary available for libghc-agda-dev in ubuntu impish.
No description available for libghc-agda-dev in ubuntu impish.
- 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.