blob: bc23454edfc760a0fec858b6d1978b6cfab1deb6 (
plain) (
blame)
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
|
{ stdenv, fetchurl, rsync, ocamlPackages }:
stdenv.mkDerivation rec {
name = "abella-${version}";
version = "2.0.6";
src = fetchurl {
url = "http://abella-prover.org/distributions/${name}.tar.gz";
sha256 = "164q9gngckg6q69k13lwx2pq3cnc9ckw1qi8dnpxqfjgwfqr7xyi";
};
buildInputs = [ rsync ] ++ (with ocamlPackages; [ ocaml ocamlbuild findlib ]);
installPhase = ''
mkdir -p $out/bin
rsync -av abella $out/bin/
mkdir -p $out/share/emacs/site-lisp/abella/
rsync -av emacs/ $out/share/emacs/site-lisp/abella/
mkdir -p $out/share/abella/examples
rsync -av examples/ $out/share/abella/examples/
'';
meta = {
description = "Interactive theorem prover";
longDescription = ''
Abella is an interactive theorem prover based on lambda-tree syntax.
This means that Abella is well-suited for reasoning about the meta-theory
of programming languages and other logical systems which manipulate
objects with binding.
'';
homepage = http://abella-prover.org/;
license = stdenv.lib.licenses.gpl3;
maintainers = with stdenv.lib.maintainers; [ bcdarwin ciil ];
platforms = stdenv.lib.platforms.unix;
};
}
|