Ubuntu
agda package

agda 2.3.0.1-1build2 source package in Ubuntu

Changelog

agda (2.3.0.1-1build2) precise; urgency=low

  * No change rebuild for haskell-hashtables
 -- Iain Lane <email address hidden>   Sat, 21 Apr 2012 17:18:26 +0100

Upload details

Uploaded by:
Iain Lane
Uploaded to:
Precise
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Precise release universe haskell

Downloads

File Size SHA-256 Checksum
agda_2.3.0.1.orig.tar.gz 598.0 KiB 5cc016a6cf113979d92af05c10b1e92dead4bf87861086177a017ce1d7605338
agda_2.3.0.1-1build2.debian.tar.gz 6.5 KiB 521af6b5e43c1a6a3c032bf59dec8c60431cb162799eb4b4077d6bc2fec8e0a1
agda_2.3.0.1-1build2.dsc 3.0 KiB 7e30d3725f3429ec5b9bb41865d4e58442e12413db30642ba1270fa45fb3dd74

Available diffs

View changes file

Binary packages built by this source

agda: No summary available for agda in ubuntu quantal.

No description available for agda in ubuntu quantal.

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: No summary available for libghc-agda-doc in ubuntu quantal.

No description available for libghc-agda-doc in ubuntu quantal.