1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
| | ;;; GNU Guix --- Functional package management for GNU
;;; Copyright © 2019 John Soo <jsoo1@asu.edu>
;;;
;;; 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 cedille)
#:use-module (gnu packages)
#:use-module (gnu packages agda)
#:use-module (gnu packages emacs-xyz)
#:use-module (gnu packages haskell)
#:use-module (gnu packages version-control)
#:use-module (guix build-system emacs)
#:use-module (guix git-download)
#:use-module ((guix licenses) #:prefix license:)
#:use-module (guix packages))
(define-public cedille
(package
(name "cedille")
(version "1.1.1")
(source
(origin
(method git-fetch)
(uri (url "https://github.com/cedille/cedille"
(commit (string-append "v" version))))
(sha256
(base32
"05b32fsshcjrbh9ysz4pfv5y5jndkycd7qrg8sdh4spnlf077r92"))))
(inputs
`(("agda" ,agda)
("agda-ial" ,agda-ial)
("ghc" ,ghc-8.4)
("ghc-alex" ,ghc-alex)
("ghc-happy" ,ghc-happy)
("git" ,git)))
(build-system emacs-build-system)
(arguments
`(#:phases
(modify-phases %standard-phases
(add-after 'unpack 'patch-cedille-path-el
(lambda* (#:key outputs #:allow-other-keys)
(let ((out (assoc-ref outputs "out")))
(substitute* "cedille-mode.el"
(("/usr/share/emacs/site-lisp/cedille-mode")
(string-append
out "/share/emacs/site-lisp/guix.d/cedille-"
,version)))
#t)))
(add-after 'unpack 'copy-cedille-mode
(lambda* (#:key outputs #:allow-other-keys)
(let* ((out (assoc-ref outputs "out"))
(lisp
(string-append
out "/share/emacs/site-lisp/guix.d/cedille-"
,version "/")))
(mkdir-p (string-append lisp "cedille-mode"))
(copy-recursively
"cedille-mode"
(string-append lisp "cedille-mode"))
(mkdir-p (string-append lisp "se-mode"))
(copy-recursively
"se-mode"
(string-append lisp "se-mode"))
#t)))
;; FIXME: Byte compilation fails
(delete 'build)
(replace 'check
(lambda _
(with-directory-excursion "cedille-tests"
(invoke "sh" "run-tests.sh"))))
(add-after 'unpack 'patch-libraries
(lambda _ (patch-shebang "create-libraries.sh") #t))
(add-after 'unpack 'copy-ial
(lambda* (#:key inputs #:allow-other-keys)
(copy-recursively
(string-append (assoc-ref inputs "agda-ial")
"/include/agda/ial")
"ial")
;; Ambiguous module if main is included from ial
(delete-file "ial/main.agda")
#t))
(add-after 'check 'build-cedille
;; Agda has a hard time with parallel compilation
(lambda _ (invoke "make" "--jobs=1")))
(add-after 'install 'install-cedille
(lambda* (#:key outputs #:allow-other-keys)
(let ((out (assoc-ref outputs "out")))
(copy-recursively
"lib" (string-append out "/lib/cedille"))
(install-file "cedille" (string-append out "/bin"))
(install-file "core/cedille-core"
(string-append out "/bin"))
#t))))))
(home-page "https://cedille.github.io/")
(synopsis
"Language based on Calculus of Dependent Lambda Eliminations")
(description
"Cedille is an interactive theorem-prover and dependently
typed programming language, based on extrinsic (aka Curry-style)
type theory. This makes it rather different from type theories
like Coq and Agda, which are intrinsic (aka Church-style). In
Cedille, terms are nothing more than annotated versions of terms
of pure untyped lambda calculus. In contrast, in Coq or Agda,
the typing annotations are intrinsic parts of terms. The typing
annotations can only be erased as an optimization under certain
conditions, not by virtue of the definition of the type theory.")
(license license:expat)))
|