38 lines
1.2 KiB
Nix
38 lines
1.2 KiB
Nix
{ stdenv, fetchurl, rsync, ocamlPackages }:
|
|
|
|
stdenv.mkDerivation rec {
|
|
pname = "abella";
|
|
version = "2.0.6";
|
|
|
|
src = fetchurl {
|
|
url = "http://abella-prover.org/distributions/${pname}-${version}.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;
|
|
};
|
|
}
|