2009-02-19 14:32:07 +01:00
|
|
|
{ stdenv, fetchurl }:
|
|
|
|
|
|
|
|
stdenv.mkDerivation rec {
|
2011-07-04 13:52:26 +02:00
|
|
|
name = "gprolog-1.4.0";
|
2009-02-19 14:32:07 +01:00
|
|
|
|
|
|
|
src = fetchurl {
|
|
|
|
urls = [
|
|
|
|
"mirror://gnu/gprolog/${name}.tar.gz"
|
|
|
|
"http://www.gprolog.org/${name}.tar.gz"
|
|
|
|
];
|
2011-07-04 13:52:26 +02:00
|
|
|
sha256 = "1l66k66ryfw1nfi2wlvsyq4cmr6mm95f4iay1fxdk3hdk3fjyjl0";
|
2009-02-19 14:32:07 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
configurePhase = "cd src ;"
|
|
|
|
+ "./configure --prefix=$out "
|
|
|
|
+ "--with-install-dir=$out/share/${name} "
|
|
|
|
+ "--with-examples-dir=$out/share/doc/${name}/examples "
|
|
|
|
+ "--with-doc-dir=$out/share/doc/${name}";
|
|
|
|
|
|
|
|
doCheck = true;
|
|
|
|
|
|
|
|
postInstall = ''
|
|
|
|
ln -vs "$out/share/${name}/include" "$out/include"
|
|
|
|
'';
|
|
|
|
|
|
|
|
meta = {
|
|
|
|
homepage = http://www.gnu.org/software/gprolog/;
|
|
|
|
|
|
|
|
description = "GNU Prolog, a free Prolog compiler with constraint solving over finite domains";
|
|
|
|
|
|
|
|
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.
|
|
|
|
'';
|
|
|
|
|
|
|
|
license = "GPLv2+";
|
|
|
|
};
|
|
|
|
}
|