2018-02-21 01:55:06 +01:00
|
|
|
;;; GNU Guix --- Functional package management for GNU
|
|
|
|
;;; Copyright © 2018 Alex ter Weele <alex.ter.weele@gmail.com>
|
|
|
|
;;;
|
|
|
|
;;; This file is part of GNU Guix.
|
|
|
|
;;;
|
|
|
|
;;; GNU Guix is free software; you can redistribute it and/or modify it
|
|
|
|
;;; under the terms of the GNU General Public License as published by
|
|
|
|
;;; the Free Software Foundation; either version 3 of the License, or (at
|
|
|
|
;;; your option) any later version.
|
|
|
|
;;;
|
|
|
|
;;; GNU Guix is distributed in the hope that it will be useful, but
|
|
|
|
;;; WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
;;; GNU General Public License for more details.
|
|
|
|
;;;
|
|
|
|
;;; You should have received a copy of the GNU General Public License
|
|
|
|
;;; along with GNU Guix. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
|
|
(define-module (gnu packages agda)
|
|
|
|
#:use-module (gnu packages haskell)
|
|
|
|
#:use-module (gnu packages haskell-check)
|
|
|
|
#:use-module (gnu packages haskell-web)
|
2018-07-21 17:57:35 +02:00
|
|
|
#:use-module (guix build-system emacs)
|
2018-02-21 01:55:06 +01:00
|
|
|
#:use-module (guix build-system haskell)
|
|
|
|
#:use-module (guix build-system trivial)
|
|
|
|
#:use-module (guix download)
|
|
|
|
#:use-module ((guix licenses) #:prefix license:)
|
|
|
|
#:use-module (guix packages))
|
|
|
|
|
|
|
|
(define-public agda
|
|
|
|
(package
|
|
|
|
(name "agda")
|
|
|
|
(version "2.5.3")
|
|
|
|
(source
|
|
|
|
(origin
|
|
|
|
(method url-fetch)
|
|
|
|
(uri (string-append
|
|
|
|
"https://hackage.haskell.org/package/Agda/Agda-"
|
|
|
|
version ".tar.gz"))
|
|
|
|
(sha256
|
|
|
|
(base32
|
|
|
|
"0r80vw7vnvbgq47y50v050malv7zvv2p2kg6f47i04r0b2ix855a"))))
|
|
|
|
(build-system haskell-build-system)
|
|
|
|
(inputs
|
|
|
|
`(("cpphs" ,cpphs)
|
|
|
|
("ghc-alex" ,ghc-alex)
|
|
|
|
("ghc-async" ,ghc-async)
|
|
|
|
("ghc-blaze-html" ,ghc-blaze-html)
|
|
|
|
("ghc-boxes" ,ghc-boxes)
|
|
|
|
("ghc-data-hash" ,ghc-data-hash)
|
|
|
|
("ghc-edisoncore" ,ghc-edisoncore)
|
|
|
|
("ghc-edit-distance" ,ghc-edit-distance)
|
|
|
|
("ghc-equivalence" ,ghc-equivalence)
|
|
|
|
("ghc-geniplate-mirror" ,ghc-geniplate-mirror)
|
|
|
|
("ghc-gitrev" ,ghc-gitrev)
|
|
|
|
("ghc-happy" ,ghc-happy)
|
|
|
|
("ghc-hashable" ,ghc-hashable)
|
|
|
|
("ghc-hashtables" ,ghc-hashtables)
|
|
|
|
("ghc-ieee754" ,ghc-ieee754)
|
|
|
|
("ghc-monadplus" ,ghc-monadplus)
|
|
|
|
("ghc-murmur-hash" ,ghc-murmur-hash)
|
|
|
|
("ghc-uri-encode" ,ghc-uri-encode)
|
|
|
|
("ghc-parallel" ,ghc-parallel)
|
|
|
|
("ghc-regex-tdfa" ,ghc-regex-tdfa)
|
|
|
|
("ghc-stm" ,ghc-stm)
|
|
|
|
("ghc-strict" ,ghc-strict)
|
|
|
|
("ghc-text" ,ghc-text)
|
|
|
|
("ghc-unordered-containers" ,ghc-unordered-containers)
|
|
|
|
("ghc-zlib" ,ghc-zlib)))
|
2018-07-21 04:35:14 +02:00
|
|
|
(arguments
|
|
|
|
`(#:modules ((guix build haskell-build-system)
|
|
|
|
(guix build utils)
|
|
|
|
(srfi srfi-26))
|
|
|
|
#:phases
|
|
|
|
(modify-phases %standard-phases
|
|
|
|
(add-after 'compile 'agda-compile
|
|
|
|
(lambda* (#:key outputs #:allow-other-keys)
|
|
|
|
(let* ((out (assoc-ref outputs "out"))
|
|
|
|
(agda-compiler (string-append out "/bin/agda")))
|
|
|
|
(for-each (cut invoke agda-compiler <>)
|
|
|
|
(find-files (string-append out "/share") "\\.agda$"))
|
|
|
|
#t))))))
|
2018-02-21 01:55:06 +01:00
|
|
|
(home-page "http://wiki.portal.chalmers.se/agda/")
|
|
|
|
(synopsis
|
|
|
|
"Dependently typed functional programming language and proof assistant")
|
|
|
|
(description
|
|
|
|
"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 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.")
|
|
|
|
;; Agda is distributed under the MIT license, and a couple of
|
|
|
|
;; source files are BSD-3. See LICENSE for details.
|
|
|
|
(license (list license:expat license:bsd-3))))
|
2018-07-21 17:57:35 +02:00
|
|
|
|
|
|
|
(define-public emacs-agda2-mode
|
|
|
|
(package
|
|
|
|
(inherit agda)
|
|
|
|
(name "emacs-agda2-mode")
|
|
|
|
(build-system emacs-build-system)
|
|
|
|
(inputs '())
|
|
|
|
(arguments
|
|
|
|
`(#:phases
|
|
|
|
(modify-phases %standard-phases
|
|
|
|
(add-after 'unpack 'enter-elisp-dir
|
|
|
|
(lambda _ (chdir "src/data/emacs-mode") #t)))))
|
|
|
|
(home-page "https://agda.readthedocs.io/en/latest/tools/emacs-mode.html")
|
|
|
|
(synopsis "Emacs mode for Agda")
|
|
|
|
(description "This Emacs mode enables interactive development with
|
|
|
|
Agda. It also aids the input of Unicode characters.")))
|