Agda standard library

From Free Software Directory
 
Jump to: navigation, search


[edit]

Agda standard library

http://wiki.portal.chalmers.se/agda/
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.



Download




Categories





Licensing

License

Verified by

Verified on

Notes

License

Expat

Verified by

Debian

Verified on

20 March 2013

Notes

License: Expat

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIExpatED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR

OTHER DEALINGS IN THE SOFTWARE.




Leaders and contributors

Contact(s)Role
Nils Anders Danielsson contact


Resources and communication

AudienceResource typeURI
Downloadhttp://wiki.portal.chalmers.se/agda/agda.php?n=Libraries.StandardLibrary
Debian (Ref) (R)https://tracker.debian.org/pkg/agda-stdlib


Software prerequisites




Entry











"contact" is not in the list (Maintainer, Contributor, Developer, Sponsor, Unknown) of allowed values for the "Role" property.


"Debian (Ref) (R)" is not in the list (General, Help, Bug Tracking, Support, Developer) of allowed values for the "Resource audience" property.








Date 2013-03-20
Source Debian import
Source link http://packages.debian.org/sid/agda-stdlib

[[Category:]]



Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.

The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.