# agda 2.3.0-1build2 source package in Ubuntu

## Changelog

agda (2.3.0-1build2) precise; urgency=low * No-changes rebuild against current libghc-agda-dev. -- Leo Iannacone <email address hidden> Mon, 23 Jan 2012 10:50:43 +0100

## Upload details

- Uploaded by:
- Leo Iannacone on 2012-01-23

- Sponsored by:
- Martin Pitt

- Uploaded to:
- Precise

- Original maintainer:
- Debian Haskell Group

- Architectures:
- any all

- Section:
- haskell

- Urgency:
- Low Urgency

## See full publishing history Publishing

Series | Published | Component | Section |
---|

## Downloads

File | Size | SHA-256 Checksum |
---|---|---|

agda_2.3.0.orig.tar.gz | 593.8 KiB | 608e130bd33a1c14ea544b46bfb55c0c8e31ab43952572df38df90d086e30cdc |

agda_2.3.0-1build2.debian.tar.gz | 6.4 KiB | 419b5b9730a1b2d525dd9146eba788e48fc59d7f4a00a096c4ee554cdfefa8cb |

agda_2.3.0-1build2.dsc | 3.4 KiB | d281a1e54ff47dc7190e4ea0bfc45ce93cb7978a39159de3cf1dda91bc112e8b |

### Available diffs

- diff from 2.3.0-1build1 to 2.3.0-1build2 (324 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-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 - development libraries
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 normal library files.

- 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 contains the documentation files.