Efficient binder representation in OCaml
See the codeBindlib is a library allowing the manipulation of data structures with bound variables. It is particularly useful when writing ASTs for programming languages, but also for manipulating terms of the λ-calculus or quantified formulas. In the internals, binders are represented using a form of higher-order abstract syntax (HOAS).
Ressources:
Projects using Bindlib:
List of dependencies:
You can either pin the repository with opam or run the following.
make
make install
Main contributors:
The project received additional contributions from:
OCaml
98.9%
Makefile
1.1%
Efficient binder representation in OCaml
See the codeBindlib is a library allowing the manipulation of data structures with bound variables. It is particularly useful when writing ASTs for programming languages, but also for manipulating terms of the λ-calculus or quantified formulas. In the internals, binders are represented using a form of higher-order abstract syntax (HOAS).
Ressources:
Projects using Bindlib:
List of dependencies:
You can either pin the repository with opam or run the following.
make
make install
Main contributors:
The project received additional contributions from:
OCaml
98.9%
Makefile
1.1%