Ubuntu
agda package

agda 2.3.2.1-2build1 source package in Ubuntu

agda (2.3.2.1-2build1) trusty; urgency=low

  * Rebuild for new GHC ABIs.
 -- Colin Watson <email address hidden>   Sun, 27 Oct 2013 23:38:41 -0700

Series	Pocket	Published	Component	Section

File	Size	SHA-256 Checksum
agda_2.3.2.1.orig.tar.gz	712.9 KiB	790e02ed9af8b9b65ea704b765fd9937444ec1351da9bc2547aa8e9034038eb6
agda_2.3.2.1-2build1.debian.tar.gz	7.6 KiB	7c94eb89daa8f6fa6059e6a3f56987d35e4f4f6ec377755c48e822e8ea053bf5
agda_2.3.2.1-2build1.dsc	3.3 KiB	a07076d923b0e15b135c59e17e1a88efeda06df7a4fad43acea48ab66ce619fe

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

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.