commit 9038bf6be4d9428a4d03fc61b44d1c7956211d35 · anil.recoil.org/opam-repository

+85
packages/elpi/elpi.1.14.0/opam
···

       1
       1
       +
       opam-version: "2.0"

     

       2
       2
       +
       maintainer: "Enrico Tassi <enrico.tassi@inria.fr>"

     

       3
       3
       +
       authors: [ "Claudio Sacerdoti Coen" "Enrico Tassi" ]

     

       4
       4
       +
       license: "LGPL-2.1-or-later"

     

       5
       5
       +
       homepage: "https://github.com/LPCIC/elpi"

     

       6
       6
       +
       doc: "https://LPCIC.github.io/elpi/"

     

       7
       7
       +
       dev-repo: "git+https://github.com/LPCIC/elpi.git"

     

       8
       8
       +
       bug-reports: "https://github.com/LPCIC/elpi/issues"

     

       9
       9
       +
       

     

       10
       10
       +
       build: [

     

       11
       11
       +
         ["dune" "subst"] {dev}

     

       12
       12
       +
         [make "build" "DUNE_OPTS=-p %{name}% -j %{jobs}%"]

     

       13
       13
       +
         [make "tests" "DUNE_OPTS=-p %{name}%" "TIMEOUT=240"] {with-test & os != "macos" & os-distribution != "alpine" & os-distribution != "freebsd"}

     

       14
       14
       +
       ]

     

       15
       15
       +
       

     

       16
       16
       +
       depends: [

     

       17
       17
       +
         "ocaml" {>= "4.04.0"}

     

       18
       18
       +
         "stdlib-shims"

     

       19
       19
       +
         "camlp5" {< "7.99"}

     

       20
       20
       +
         "ppxlib" {>= "0.12.0" }

     

       21
       21
       +
         "re" {>= "1.7.2"}

     

       22
       22
       +
         "ppx_deriving" {>= "4.2"}

     

       23
       23
       +
         "ANSITerminal" {with-test}

     

       24
       24
       +
         "cmdliner" {with-test}

     

       25
       25
       +
         "dune" {>= "2.2.0"}

     

       26
       26
       +
         "conf-time" {with-test}

     

       27
       27
       +
       ]

     

       28
       28
       +
       synopsis: "ELPI - Embeddable λProlog Interpreter"

     

       29
       29
       +
       description: """

     

       30
       30
       +
       ELPI implements a variant of λProlog enriched with Constraint Handling Rules,

     

       31
       31
       +
       a programming language well suited to manipulate syntax trees with binders.

     

       32
       32
       +
       

     

       33
       33
       +
       ELPI is designed to be embedded into larger applications written in OCaml as

     

       34
       34
       +
       an extension language. It comes with an API to drive the interpreter and 

     

       35
       35
       +
       with an FFI for defining built-in predicates and data types, as well as

     

       36
       36
       +
       quotations and similar goodies that are handy to adapt the language to the host

     

       37
       37
       +
       application.

     

       38
       38
       +
       

     

       39
       39
       +
       This package provides both a command line interpreter (elpi) and a library to

     

       40
       40
       +
       be linked in other applications (eg by passing -package elpi to ocamlfind).

     

       41
       41
       +
       

     

       42
       42
       +
       The ELPI programming language has the following features:

     

       43
       43
       +
       

     

       44
       44
       +
       - Native support for variable binding and substitution, via an Higher Order

     

       45
       45
       +
         Abstract Syntax (HOAS) embedding of the object language. The programmer needs

     

       46
       46
       +
         not to care about De Bruijn indexes.

     

       47
       47
       +
       

     

       48
       48
       +
       - Native support for hypothetical context. When moving under a binder one can

     

       49
       49
       +
         attach to the bound variable extra information that is collected when the

     

       50
       50
       +
         variable gets out of scope. For example when writing a type-checker the

     

       51
       51
       +
         programmer needs not to care about managing the typing context.

     

       52
       52
       +
       

     

       53
       53
       +
       - Native support for higher order unification variables, again via HOAS.

     

       54
       54
       +
         Unification variables of the meta-language (λProlog) can be reused to

     

       55
       55
       +
         represent the unification variables of the object language. The programmer

     

       56
       56
       +
         does not need to care about the unification-variable assignment map and

     

       57
       57
       +
         cannot assign to a unification variable a term containing variables out of

     

       58
       58
       +
         scope, or build a circular assignment.

     

       59
       59
       +
       

     

       60
       60
       +
       - Native support for syntactic constraints and their meta-level handling rules.

     

       61
       61
       +
         The generative semantics of Prolog can be disabled by turning a goal into a

     

       62
       62
       +
         syntactic constraint (suspended goal). A syntactic constraint is resumed as

     

       63
       63
       +
         soon as relevant variables gets assigned. Syntactic constraints can be

     

       64
       64
       +
         manipulated by constraint handling rules (CHR).

     

       65
       65
       +
       

     

       66
       66
       +
       - Native support for backtracking. To ease implementation of search.

     

       67
       67
       +
       

     

       68
       68
       +
       - The constraint store is extensible.  The host application can declare

     

       69
       69
       +
         non-syntactic constraints and use custom constraint solvers to check their

     

       70
       70
       +
         consistency.

     

       71
       71
       +
       

     

       72
       72
       +
       - Clauses are graftable. The user is free to extend an existing program by

     

       73
       73
       +
         inserting/removing clauses, both at runtime (using implication) and at

     

       74
       74
       +
         "compilation" time by accumulating files.

     

       75
       75
       +
       

     

       76
       76
       +
       ELPI is free software released under the terms of LGPL 2.1 or above."""

     

       77
       77
       +
       url {

     

       78
       78
       +
         src:

     

       79
       79
       +
           "https://github.com/LPCIC/elpi/releases/download/v1.14.0/elpi-1.14.0.tbz"

     

       80
       80
       +
         checksum: [

     

       81
       81
       +
           "sha256=acc61ab4f9d9b80cc2b1d848bf3ed1c121634e8b42e0dfe086005a76b79ec2ec"

     

       82
       82
       +
           "sha512=de851b0cb1bd65e18fdc2b4a992a52eceb4c8e68a059e3652d7cfe525f0d31303ce323c2c20f01c55a633a6481adba05d16cc4c7f44707e189c073e759a1accd"

     

       83
       83
       +
         ]

     

       84
       84
       +
       }

     

       85
       85
       +
       x-commit-hash: "d607597c71515554ed9b9a3e430ccecdc50400f4"