I want to prove that when receiving a binary search tree as an argument, the [insert] function generates another binary search tree. Insert Function: Fixpoint insert {V : Type} (x : key) (v : V) (t : ...

I want to build a proof of correctness for elements_tr... It is actually related to some sort of reimplementation of BSTs with int keys. Elements_tr is defined as follows: Fixpoint elements_aux {V : T...

I am trying to prove that particular implementations of how to calculate the edit distance between two strings are correct and yield identical results. I went with the most natural way to define edit ...

fun perfect(n) = let fun add_factors(n) = let fun f(i) = if n mod i = 0 then i else 0; fun sum(a, b) = if a > b then 0 ...