Explore projects

An LR(1) parser generator for OCaml.

SAT-Equiv is an equivalence checker for cryptographic protocols. It proceeds by reduction to planning problem and SAT-formula, for a bounded number of sessions.

A library for constraint-based Hindley-Milner type inference.

An OCaml syntax extension (technically, a ppx_deriving plugin) which generates object-oriented visitors for traversing and transforming data structures.

An LR(1) parser generator for OCaml.

Fuzzing infrastructure for an implementation of sequences.

Formally verified ML implementation of Knuth's Dancing Links algorithm, using CFML.

Why3 is a software verification platform, featuring a versatile ML-style language and interfaces to various powerful automated and interactive theorem provers.

Why3 is a software verification platform, featuring a versatile ML-style language and interfaces to various powerful automated and interactive theorem provers.

Formalizations accompanying my thesis "Extending Type Theory with Syntactical Models".

Tool for timed automata verification and robustness analysis

Code of the lablwebkit library

Zen computational linguistics OCaml library