We implement algorithms with general recursion in TT using the Bove-Capretta method
-
General recursion in type theory by Ana Bove and Venanzio Capretta:
http://www.duplavis.com/venanzio/publications/General_Recursion_MSCS_2005.pdf -
Implementations of sorting algorithms in Agda by Twan van Laarhoven:
https://gist.github.com/twanvl/5635740 -
Formal proof of complexity classes. We may formalize the Master Theorem. Formalization in Isabelle/HOL: https://www21.in.tum.de/~eberlm/pubs/divide_and_conquer_isabelle.html