agda-mode binary package in Ubuntu Xenial s390x
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.
Publishing history
Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
---|---|---|---|---|---|---|---|---|---|
2016-02-10 15:18:47 UTC | Published | Ubuntu Xenial s390x | release | universe | misc | Optional | 2.4.2.5-1build1 | ||
|
|||||||||
Deleted | Ubuntu Xenial s390x | proposed | universe | misc | Optional | 2.4.2.5-1build1 | |||
|
|||||||||
2016-02-10 15:39:48 UTC | Superseded | Ubuntu Xenial s390x | release | universe | misc | Optional | 2.4.2.5-1 | ||
|
|||||||||
2016-02-11 18:10:10 UTC | Deleted | Ubuntu Xenial s390x | proposed | universe | misc | Optional | 2.4.2.5-1 | ||
|
|||||||||
2016-01-05 01:44:09 UTC | Superseded | Ubuntu Xenial s390x | release | universe | misc | Optional | 2.4.2.2-4build1 | ||
|