# agda 2.5.3-5 source package in Ubuntu

## Changelog

agda (2.5.3-5) unstable; urgency=medium * Patch for newer EdisonCore. -- Clint Adams <email address hidden> Sun, 29 Apr 2018 08:41:41 -0400

## Upload details

- Uploaded by:
- Debian Haskell Group on 2018-04-29

- Uploaded to:
- Sid

- Original maintainer:
- Debian Haskell Group

- 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.5.3-5.dsc | 4.6 KiB | 6a143f110dfc0a00a1f06b595522fcd85912f5367b592e8488417327ce128dc0 |

agda_2.5.3.orig.tar.gz | 1.1 MiB | aa14d4a3582013100f71e64d71c5deff6caa2a286083e20fc16f6dbb0fdf0065 |

agda_2.5.3-5.debian.tar.xz | 9.8 KiB | 1d15cc9cbb2a4ac95ead190dedbbb0e864a78b866704edf5527b68677fc04b22 |

### Available diffs

No changes file available.

## 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: commandline interface to 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.

.

This package provides a command-line program for type-checking and compiling

Agda programs. The program can also generate hyperlinked, highlighted HTML

files from Agda sources.

- 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: 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: 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 package provides a library for the Haskell programming language.

See http://www.haskell. for more information on Haskell.org/

- 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. for more information on Haskell.org/