|File Search||Catalog||Content Search|
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 (0.3-3) unstable; urgency=low [ Iain Lane ] * debian/control: Add missing procps | hurd build-dep so that ps is available to run the ticker. -- Marco Túlio Gontijo e Silva <email@example.com> Tue, 02 Mar 2010 20:56:49 -0300 agda-stdlib (0.3-2) unstable; urgency=low [ Iain Lane ] * debian/control: Fix short descriptions (too long, one said "profiling" instead of " more»
Format-Specification: http://svn.debian.org/wsvn/dep/web/deps/dep5.mdwn?rev=135&sc=0 Name: Agda standard library Maintainer: Nils Anders Danielsson <firstname.lastname@example.org> Upstream-Source: http://wiki.portal.chalmers.se/agda/agda.php?n=Libraries.StandardLibrary Files: * Copyright: 2007-2009 Nils Anders Danielsson, Ulf Norell, Shin-Cheng Mu, Samuel Bronson, Dan Doel, Patrik Jansson, Liang- more»