agda-stdlib 0.5-1 source package in Ubuntu
Changelog
agda-stdlib (0.5-1) unstable; urgency=low
* [9251e0b] Imported Upstream version 0.5
* [ba20206] Make package architecture independent (Closes: #573807, #598708,
#599958)
* [2c82171] Add watch file
* [0518fa6] No longer need procps | hurd BD as we no longer have the ticker
* [daf2445] Don't use upstream's make install — handled ourselves by
dh_install
* [1b86533] Update watchfile to point at new location
* [637f47d] Remove debian/gbp.conf as we are no longer building for exp
* [cc88671] Require Agda 2.2.10
* [e99dab5] Set maximum stack size to 1G to prevent overflows in the build
* [251cd1d] Run the test suite manually
* [a7db697] Set the variable in the emacs loading script properly
* [540ca3f] Improve short description
* [6b3e794] Add dependencies on compatible versions of the Agda library
* [7127678] Standards-Version bump to 3.9.2, no changes required
* [9d0ae30] Update to use ghc instead of ghc6
* [3f6879a] Set Maintainer to my d.o email address
-- Iain Lane <email address hidden> Fri, 17 Jun 2011 16:07:46 +0000
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| agda-stdlib_0.5.orig.tar.gz | 193.4 KiB | ecdf9deddd9baae4ddddbc29bf1206717d6e683a213816777b5df55944f4363e |
| agda-stdlib_0.5-1.diff.gz | 3.6 KiB | 7e598498ef5edc57d13096d4b0001a0489e77c5075abe8710e03fa7918b9d019 |
| agda-stdlib_0.5-1.dsc | 1.9 KiB | f82c2d71b6bb0271585a2ff0323398a57d8a2d07edf153dfce917bac3c040b8b |
Available diffs
- diff from 0.5-1~ubuntu1 to 0.5-1 (1.8 KiB)
Binary packages built by this source
- agda-stdlib: standard library for 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.
.
The Agda standard library contains modules for many common data structures and
proof patterns. Modules provided include:
- Algebra: Specifying and reasoning about abstract algebraic structures
- Category: Using idioms from category theory to structure functional programs
- Coinduction: Support for programming coindutively
- Data: Data types and properties about data types
- Foreign: Relating to the foreign function interface
- Induction: A general framework for induction
- IO: Input/output related functions
- Level: Universe levels
- Relations: Properties of and proofs about relations
- Size: Sizes used by the sized types mechanism
.
This package contains the complete library.
- agda-stdlib-doc: standard library for Agda — 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.
.
The Agda standard library contains modules for many common data structures and
proof patterns. Modules provided include:
- Algebra: Specifying and reasoning about abstract algebraic structures
- Category: Using idioms from category theory to structure functional programs
- Coinduction: Support for programming coindutively
- Data: Data types and properties about data types
- Foreign: Relating to the foreign function interface
- Induction: A general framework for induction
- IO: Input/output related functions
- Level: Universe levels
- Relations: Properties of and proofs about relations
- Size: Sizes used by the sized types mechanism
.
This package contains the hyperlinked library documentation.
