3
0
Fork 0
forked from mirrors/nixpkgs
nixpkgs/pkgs/development/compilers/gprolog/default.nix
Peter Simons 476635afe1 Drop myself from meta.maintainers for most packages.
I'd like to reduce the number of Github notifications and
review requests I receive.
2021-10-14 11:01:27 +02:00

69 lines
2.2 KiB
Nix

{ lib, stdenv, fetchurl }:
stdenv.mkDerivation rec {
pname = "gprolog";
version = "1.5.0";
src = fetchurl {
urls = [
"mirror://gnu/gprolog/gprolog-${version}.tar.gz"
"http://www.gprolog.org/gprolog-${version}.tar.gz"
];
sha256 = "sha256-ZwZCtDwPqifr1olh77F+vnB2iPkbaAlWbd1gYTlRLAE=";
};
hardeningDisable = lib.optional stdenv.isi686 "pic";
patchPhase = ''
sed -i -e "s|/tmp/make.log|$TMPDIR/make.log|g" src/Pl2Wam/check_boot
'';
preConfigure = ''
cd src
configureFlagsArray=(
"--with-install-dir=$out"
"--without-links-dir"
"--with-examples-dir=$out/share/gprolog-${version}/examples"
"--with-doc-dir=$out/share/gprolog-${version}/doc"
)
'';
postInstall = ''
mv -v $out/[A-Z]* $out/gprolog.ico $out/share/gprolog-${version}/
'';
doCheck = true;
meta = {
homepage = "https://www.gnu.org/software/gprolog/";
description = "GNU Prolog, a free Prolog compiler with constraint solving over finite domains";
license = lib.licenses.lgpl3Plus;
longDescription = ''
GNU Prolog is a free Prolog compiler with constraint solving
over finite domains developed by Daniel Diaz.
GNU Prolog accepts Prolog+constraint programs and produces
native binaries (like gcc does from a C source). The obtained
executable is then stand-alone. The size of this executable can
be quite small since GNU Prolog can avoid to link the code of
most unused built-in predicates. The performances of GNU Prolog
are very encouraging (comparable to commercial systems).
Beside the native-code compilation, GNU Prolog offers a
classical interactive interpreter (top-level) with a debugger.
The Prolog part conforms to the ISO standard for Prolog with
many extensions very useful in practice (global variables, OS
interface, sockets,...).
GNU Prolog also includes an efficient constraint solver over
Finite Domains (FD). This opens contraint logic programming to
the user combining the power of constraint programming to the
declarativity of logic programming.
'';
platforms = lib.platforms.unix;
};
}