-
Notifications
You must be signed in to change notification settings - Fork 1.1k
/
opam
41 lines (41 loc) · 1.29 KB
/
opam
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
opam-version: "2.0"
maintainer: "simon.cruanes@inria.fr"
authors: ["Simon Cruanes <simon.cruanes@inria.fr>"]
homepage: "https://github.com/c-cube/datalog"
license: "BSD-2-Clause"
doc: ["http://cedeela.fr/~simon/software/datalog/index.html"]
tags: [
"datalog"
"relational"
"query"
]
build: ["./configure" "--bindir" bin "--docdir" doc]
remove: [["ocamlfind" "remove" "datalog"]]
depends: [
"ocaml" {>= "4.00.1" & < "4.06.0"}
"ocamlfind"
"ocamlbuild" {build}
"num"
]
dev-repo: "git+https://github.com/c-cube/datalog"
install: [
[make "all" "install_file"]
[make "install"]
]
synopsis: "An in-memory datalog implementation for OCaml."
description: """
It features two main algorithm:
- bottom-up focuses on big sets of rules with small relations, with frequent
updates of the relations. Therefore, it tries to achieve good behavior in
presence of incremental modifications of the relations.
- top-down resembles prolog (and allows nested subterms). It handles
stratified negation and only explores the part of the search space that
is relevant to a given query."""
flags: light-uninstall
url {
src: "https://github.com/c-cube/datalog/archive/0.5.tar.gz"
checksum: [
"sha256=c22c4cbdecd254c12f3ff3057bdb046b4a8667773b61769ee268e75f39f7fbc2"
"md5=383a0589cca14bccda4586564acca263"
]
}