套件：libghc-agda-doc（2.5.4.1-3）
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-33
- 本虛擬套件由這些套件填實： ghc
-
- rec: ghc-doc
- Documentation for the Glasgow Haskell Compilation system
-
- rec: libghc-blaze-html-doc
- HTML combinator library for Haskell; documentation
-
- rec: libghc-edison-core-doc
- documentation of the Edison Haskell library
-
- rec: libghc-equivalence-doc
- maintaining an equivalence relation; documentation
-
- rec: libghc-geniplate-mirror-doc
- Use Template Haskell to generate Uniplate-like functions.; documentation
-
- rec: libghc-hashable-doc
- class for types that can be converted to a hash value; documentation
-
- rec: libghc-hashtables-doc
- mutable hash tables -- documentation; documentation
-
- rec: libghc-strict-doc
- Strict variants of standard Haskell datatypes; documentation
-
- rec: libghc-unordered-containers-doc
- Efficient hashing-based container types; documentation
-
- rec: libjs-mathjax
- JavaScript display engine for LaTeX and MathML