depytversion
Yet-an-other type combinator library
Depyt provides type combinators to define runtime representation for OCaml types and generic operations to manipulate values with a runtime type representation.
The type combinators supports all the usual type primitives but also compact definitions of records and variants. It also allows to define the runtime representation of recursive types.
Depyt is a modern reboot of Dyntype but using GADTs-based combinators instead of syntax-extensions. When we originally wrote Dyntype (in 2012) GADTs were not available in OCaml and camlp4 was everywhere -- this is not the case anymore. Finally, Depyt avoids some of the performance caveats present in Dyntype by avoiding allocating and converting between intermediate formats.
Variants
For instance, to define variants:
```ocaml
Tags | org:mirage |
---|---|
Author | Thomas Gazagnaire <thomas@gazagnaire.org> |
License | ISC |
Published | |
Homepage | https://github.com/samoht/depyt |
Issue Tracker | https://github.com/samoht/depyt/issues |
Maintainer | Thomas Gazagnaire <thomas@gazagnaire.org> |
Dependencies | |
Source [http] | https://github.com/samoht/depyt/releases/download/0.2.0/depyt-0.2.0.tbz sha256=8072cad30f34f7b4b940942dcd37aea902fbe94cc04e25b12d463e8d6fa1bb25 md5=b5e53bea6298f6b255fda6b906496938 |
Edit | https://github.com/ocaml/opam-repository/tree/master/packages/depyt/depyt.0.2.0/opam |