Section: New Software and Platforms

HOT

HOT is an automated termination prover for higher-order rewrite systems based on the notion of computability closure and size annotation [31] . It won the 2012 competition in the category “higher-order rewriting union beta”. The sources (5000 lines of OCaml) are not public. It is developed by Frédéric Blanqui.