Expression trees for TypeScript similar to C#. Expression trees represent code in a tree-like data structure, where each node is an expression, for example, a method call or a binary operation such as x < y.

Building an expression transformer in Rust. It is similar to Coq.

A simple language meant for transforming mathematical expressions inspired by Coq and Noq.

A program which reads user input (in terms of functions containing 2 parameters) and produces the equivalent mathematical expression.