this repo has no description
anil.recoil.org
1opam-version: "2.0"
2maintainer: "Enrico Tassi <enrico.tassi@inria.fr>"
3authors: [ "Claudio Sacerdoti Coen" "Enrico Tassi" ]
4license: "LGPL-2.1-or-later"
5homepage: "https://github.com/LPCIC/elpi"
6doc: "https://github.com/LPCIC/elpi"
7dev-repo: "git+https://github.com/LPCIC/elpi.git"
8bug-reports: "https://github.com/LPCIC/elpi/issues"
9
10build: [ [ make ] [ make "byte" ] ]
11install: [
12 [ make "install" ]
13 [ make "install-bin" "BIN=%{bin}%" ]
14]
15
16depends: [
17 "ocaml" {>= "4.03.0"}
18 "ocamlfind" {build}
19 "camlp5" {<= "7.99"}
20 "ppx_tools_versioned"
21 "ppx_deriving"
22 "ocaml-migrate-parsetree" {< "2.0.0"}
23 "re" {>= "1.7.2"}
24]
25synopsis: "ELPI - Embeddable λProlog Interpreter"
26description: """
27ELPI implements a variant of λProlog enriched with Constraint Handling Rules,
28a programming language well suited to manipulate syntax trees with binders.
29
30ELPI is designed to be embedded into larger applications written in OCaml as
31an extension language. It comes with an API to drive the interpreter and
32with an FFI for defining built-in predicates and data types, as well as
33quotations and similar goodies that are handy to adapt the language to the host
34application.
35
36This package provides both a command line interpreter (elpi) and a library to
37be linked in other applications (eg by passing -package elpi to ocamlfind).
38
39The ELPI programming language has the following features:
40
41- Native support for variable binding and substitution, via an Higher Order
42 Abstract Syntax (HOAS) embedding of the object language. The programmer needs
43 not to care about De Bruijn indexes.
44
45- Native support for hypothetical context. When moving under a binder one can
46 attach to the bound variable extra information that is collected when the
47 variable gets out of scope. For example when writing a type-checker the
48 programmer needs not to care about managing the typing context.
49
50- Native support for higher order unification variables, again via HOAS.
51 Unification variables of the meta-language (λProlog) can be reused to
52 represent the unification variables of the object language. The programmer
53 does not need to care about the unification-variable assignment map and
54 cannot assign to a unification variable a term containing variables out of
55 scope, or build a circular assignment.
56
57- Native support for syntactic constraints and their meta-level handling rules.
58 The generative semantics of Prolog can be disabled by turning a goal into a
59 syntactic constraint (suspended goal). A syntactic constraint is resumed as
60 soon as relevant variables gets assigned. Syntactic constraints can be
61 manipulated by constraint handling rules (CHR).
62
63- Native support for backtracking. To ease implementation of search.
64
65- The constraint store is extensible. The host application can declare
66 non-syntactic constraints and use custom constraint solvers to check their
67 consistency.
68
69- Clauses are graftable. The user is free to extend an existing program by
70 inserting/removing clauses, both at runtime (using implication) and at
71 "compilation" time by accumulating files.
72
73ELPI is free software released under the terms of LGPL 2.1 or above."""
74url {
75 src: "https://github.com/LPCIC/elpi/archive/v1.2.0.tar.gz"
76 checksum: [
77 "sha256=414c24880e5e006c328a23169a7cd66d9574567ea4999cd6d4a0724ff2716ddc"
78 "md5=b55fc75513bdbd3ba097ee480e30d0b9"
79 ]
80}