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