Пакет: libghc-agda-doc (2.6.2.2-1.1)
Ссылки для libghc-agda-doc
Исходный код agda:
Сопровождающий:
Внешние ресурсы:
- Сайт [wiki.portal.chalmers.se]
Подобные пакеты:
dependently typed functional programming language; 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.
This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
Другие пакеты, относящиеся к libghc-agda-doc
|
|
|
|
-
- dep: haddock-interface-38
- Пакет недоступен
-
- rec: ghc-doc
- Пакет недоступен
-
- rec: libghc-agda-dev
- dependently typed functional programming language
-
- rec: libghc-async-doc
- Пакет недоступен
-
- rec: libghc-case-insensitive-doc
- Пакет недоступен
-
- rec: libghc-hashable-doc
- Пакет недоступен
-
- rec: libghc-hashtables-doc
- Пакет недоступен
-
- rec: libghc-unordered-containers-doc
- Пакет недоступен
-
- rec: libjs-mathjax
- JavaScript display engine for LaTeX and MathML
Загрузка libghc-agda-doc
| Архитектура | Размер пакета | В установленном виде | Файлы |
|---|---|---|---|
| all | 6 445,3 Кб | 161 999,0 Кб | [список файлов] |