tyabt

Strongly typed many-sorted abstract binding trees (ABTs)
README

Tyabt is an OCaml implementation of many-sorted abstract binding trees.
Abstract binding trees (ABTs) are similar to abstract syntax trees, but also
keep track of variable scopes. Many-sorted ABTs support multiple syntactic
classes, known as sorts. This library uses GADTs and phantom types to
statically ensure that only syntactically valid ABTs are representable.

ABTs are described in Robert Harper's textbook, Practical Foundations for
Programming Languages
, and are
inspired by the notation of the Nuprl proof development system.

Install
Sources
tyabt-0.1.0.tbz
sha256=cfce3264cf6427e9e956f5b52a67fc65883317e7318db4fc2416307b9a3116c6
sha512=f9436ef29330bc71933d2fb1af7d3aea6c4c7a61d60e6a385bb3326a4b3b9b3936f3adc47f93d901b4cabcc5405810eb5c309c1077f860777770d12fcc076ce1
Dependencies
odoc
with-doc
ocaml
>= "4.12"
dune
>= "2.8"
Reverse Dependencies