Ubuntu
agda-stdlib package

agda-stdlib 0.14-1~build1 source package in Ubuntu

Changelog

agda-stdlib (0.14-1~build1) bionic; urgency=medium

  [ Gianfranco Costamagna ]
  * Upload to Ubuntu bionic
  * New upstream release (Closes: #881307)
  * Bump std-version to 4.1.1, set priority to optional

  [ Helmut Grohne ]
  * Team upload
  * Address FTBFS: export LC_ALL=C.UTF-8. (Addresses: #881307)
  * Bump agda-bin Breaks due to agdai incompatibility.
  * Tighten up agda relation ships to detect incompatibility next time.

 -- Gianfranco Costamagna <email address hidden>  Sun, 26 Nov 2017 11:28:04 +0100

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Bionic
Original maintainer:
Iain Lane
Architectures:
all
Section:
libs
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Builds

Bionic: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
agda-stdlib_0.14.orig.tar.gz 278.7 KiB 7237c4039c61542bc010fd6db5da27dd6548c4ca5cde0d5d84b64f2b1a643b09
agda-stdlib_0.14-1~build1.debian.tar.xz 5.1 KiB 26b2ba4c3f831e3e4b4739225494becfe2181a2cc00674a5fbe15b94c95f46c1
agda-stdlib_0.14-1~build1.dsc 2.1 KiB ce5d4c5bab936444e654c4b4332fd5c16e6861aae9ef3a8fed246321f12615fe

View changes file

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.