| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help |
The search service can find package by either name (apache), provides(webserver), absolute file names (/usr/bin/apache), binaries (gprof) or shared libraries (libXm.so.2) in standard path. It does not support multiple arguments yet...
The System and Arch are optional added filters, for example System could be "redhat", "redhat-7.2", "mandrake" or "gnome", Arch could be "i386" or "src", etc. depending on your system.
Agda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized 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 is the interactive Emacs mode for Agda.
| Package | Summary | Distribution | Download |
| emacs-agda-2.3.2.2-5.el7.x86_64.html | Emacs mode for the Agda language | EPEL 7 for x86_64 | emacs-agda-2.3.2.2-5.el7.x86_64.rpm |
Generated by rpm2html 1.6