#### Trie Data Structure

Trie data structure and implementation in OCaml.

Trie data structure and implementation in OCaml.

Schloss Dagstuhl - NSF Support Grant.

Paper about language-based security at Oakland 2017.

An example of constant-time implementation for truncating a list in OCaml.

An example of probabilistic functional program.

Variable-length arguments in OCaml with the concept of folding.

B-tree implementation in OCaml.

Red-black tree implementation in OCaml.

Heap-sort algorithm implementation in OCaml.

Heap implementation in OCaml.

Dynamic permutation implementation in OCaml.

Permutation implementation in OCaml.

Dutch partition problem implementation in OCaml.

Paper at ESLsyn 2014.

International mathematic Olympic 2016.

Synchronous programming.

Reactive and synchronous reactive programming.

Paper about PSCV at CAV 2016.

Additional functions for lists in the standard library.

Given a string s and a list of strings ls. Find a shortest substring of s that contains all strings in a list of strings ls.

I decided to write my notes (aka blogs) on GitHub cooperating with Jekyll instead of WordPress.